Chordal Networks of Polynomial Ideals

DOI10.1137/16M106995XzbMath1444.13037arXiv1604.02618OpenAlexW3099302898MaRDI QIDQ5347294

Diego Cifuentes, Pablo A. Parrilo

Publication date: 23 May 2017

Published in: SIAM Journal on Applied Algebra and Geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1604.02618

zbMATH Keywords

chordal graphsstructured polynomialstriangular setschordal networks

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Computational aspects in algebraic geometry (14Q99) Solving polynomial systems; resultants (13P15)

Related Items

Chordality Preserving Incremental Triangular Decomposition and Its Implementation, A Geometric Approach for Analyzing Parametric Biological Systems by Exploiting Block Triangular Structure, Chordal graphs in triangular decomposition in top-down style, Choosing better variable orderings for cylindrical algebraic decomposition via exploiting chordal structure, On the Chordality of Simple Decomposition in Top-Down Style, Analyses and implementations of chordality-preserving top-down algorithms for triangular decomposition

Uses Software

• Epsilon
• Macaulay2
• RegularChains
• SageMath
• SINGULAR
• Binomials.m2
• ISOLATE
• ComputeTW
• Chordal

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sparse polynomial division using a heap
• An efficient tree decomposition method for permanents and mixed discriminants
• Treewidth computations. I: Upper bounds
• Binomial edge ideals and conditional independence statements
• Elimination methods
• Solving zero-dimensional algebraic systems
• A generalized Euclidean algorithm for computing triangular representations of algebraic varieties
• Solving zero-dimensional systems through the rational univariate representation
• Boosting search with variable elimination in constraint optimization and constraint satisfaction problems
• Computing triangular systems and regular systems
• On the theories of triangular sets
• Commuting birth-and-death processes
• Exploiting Chordal Structure in Polynomial Ideals: A Gröbner Bases Approach
• Modern Computer Algebra
• Complexity of Finding Embeddings in a k-Tree
• Algorithmic Aspects of Vertex Elimination on Graphs
• Binary Decision Diagrams
• Branching Programs and Binary Decision Diagrams
• Monomial Algebras
• Hilbert's Nullstellensatz and an Algorithm for Proving Combinatorial Infeasibility
• Decompositions of binomial ideals