INDEPENDENT SETS FROM AN ALGEBRAIC PERSPECTIVE

DOI10.1142/S0218196711006819zbMath1239.13039arXiv1003.3508OpenAlexW2963745617MaRDI QIDQ5389114

Alicia Dickenstein, Enrique A. Tobis

Publication date: 24 April 2012

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

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

zbMATH Keywords

complexityGröbner basisposetsHilbert seriesindependent setsantichains

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07) Computational aspects and applications of commutative rings (13P99) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Algebraic aspects of posets (06A11)

Related Items (2)

Robust toric ideals ⋮ Enumeration and classification of self-orthogonal partial Latin rectangles by using the polynomial method

Uses Software

• CoCoA
• Macaulay2
• SINGULAR
• EdgeIdeals

Cites Work

• Unnamed Item
• On the location of roots of independence polynomials
• Counting solutions to binomial complete intersections
• Independence polynomials of circulants with an application to music
• Computation of Hilbert functions
• Stable sets and polynomials
• On the ideal theory of graphs
• Distributive lattices, bipartite graphs and Alexander duality
• The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
• The number of unlabeled orders on fourteen elements

This page was built for publication: INDEPENDENT SETS FROM AN ALGEBRAIC PERSPECTIVE