Computing Linear Extensions for Polynomial Posets Subject to Algebraic Constraints
From MaRDI portal
Publication:5001675
DOI10.1137/20M1343208MaRDI QIDQ5001675
Shane Kepley, Konstantin Mischaikow, Lun Zhang
Publication date: 23 July 2021
Published in: SIAM Journal on Applied Algebra and Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2006.02622
Combinatorics of partially ordered sets (06A07) Dynamical systems in biology (37N25) Lattices (06B99) Quantifier elimination, model completeness, and related topics (03C10) Computational real algebraic geometry (14Q30)
Related Items (2)
Modeling transport regulation in gene regulatory networks ⋮ Extending Combinatorial Regulatory Network Modeling to Include Activity Control and Decay Modulation
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- DSGRN
- Lattice structures for attractors. II
- The number of linear extensions of subset ordering
- The enumeration of comparative probability relations
- Boolean term orders and the root system \(B_n\)
- Computational homology
- The number of linear extensions of the Boolean lattice
- Zeta functions, periodic trajectories, and the Conley index
- The Conley index and symbolic dynamics
- Reverse-engineering of polynomial dynamical systems
- Exact solutions to linear programming problems
- An algorithmic approach to chain recurrence
- Lattice structures for attractors. I
- Cohomology of isolated invariant sets under perturbation
- Introduction to Focus Issue: Quantitative Approaches to Genetic Networks
- Conley--Morse Databases for the Angular Dynamics of Newton's Method on the Plane
- Combinatorial-topological framework for the analysis of global dynamics
- Constructing a single open cell in a cylindrical algebraic decomposition
- Model Rejection and Parameter Reduction via Time Series
- PP is as Hard as the Polynomial-Time Hierarchy
- On rest points of dynamical systems
- Mappings and homological properties in the Conley index theory
- Chaos in the Lorenz equations: a computer-assisted proof
- A Rigorous Numerical Method for the Global Analysis of Infinite-Dimensional Discrete Dynamical Systems
- Rigorous Numerics for Global Dynamics: A Study of the Swift--Hohenberg Equation
- Global Asymptotic Dynamics of Gradient-Like Bistable Equations
- A Database Schema for the Analysis of Global Dynamics of Multiparameter Systems
- Combinatorial Representation of Parameter Space for Switching Networks
- On the global dynamics of attractors for scalar delay equations
- Algorithms in real algebraic geometry
- Linear programming. Foundations and extensions
- Improved projection for cylindrical algebraic decomposition
This page was built for publication: Computing Linear Extensions for Polynomial Posets Subject to Algebraic Constraints
