Cutting corners

DOI10.1006/aama.1999.0645zbMath0955.52008OpenAlexW2911895609MaRDI QIDQ5916326

Bernd Sturmfels, Shmuel Onn

Publication date: 4 March 2001

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/02eb347fd1bf3486a0815510be2c66d3f461b07f

zbMATH Keywords

Gröbner basespolynomial time algorithmstaircasestaircase polytopecorner cutcorner cut polyhedron

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Computational aspects related to convexity (52B55) Enumerative combinatorics (05A99) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Varieties and morphisms (14A10)

Related Items

Cutting corners with spheres in \(d\)-dimensions, Random monomial ideals, Minimal average degree aberration and the state polytope for experimental designs, The complexity of vector partition, Standard complexes of matroids and lattice paths, Alexander duality in experimental designs, Betti numbers of polynomial hierarchical models for experimental designs, Combinatorics of triangular partitions, Variation of stability for moduli spaces of unordered points in the plane, The Hilbert zonotope and a polynomial time algorithm for universal Gröbner bases., The Number of Gröbner Bases in Finite Fields (Research), Bar code for monomial ideals, The Algebraic Method in Quadrature for Uncertainty Quantification, A Polyhedral Characterization of Border Bases, A tropical toolkit, A short history of algebraic statistics, The number of plane corner cuts, On border basis and Gröbner basis schemes, Linear-shaped partition problems, Vertex characterization of partition polytopes of bipartitions and of planar point sets, Cutting Corners by Circles and Spheres, On the number of corner cuts

Cites Work

• A criterion for detecting m-regularity
• The Gröbner fan of an ideal
• Standard bases and geometric invariant theory. I: Initial ideals and state polytopes
• Nonhomogeneous spectra of numbers
• The number of generators of a colength N ideal in a power series ring
• Fiber polytopes
• Separable partitions
• Representations and characterizations of vertices of bounded-shape partition polytopes
• The number of outside corners of monomial ideals
• The number of plane corner cuts
• On the number of convex lattice polytopes
• A linear algorithm for nonhomogeneous spectra of numbers
• Analyse locale des droites discrètes. Généralisation et application à la connexité des plans discrets
• A Polynomial Time Algorithm for Shaped Partition Problems
• Theory and Application of Plane Partitions: Part 1
• A Lower Bound for the Volume of Strictly Convex Bodies with many Boundary Lattice Points
• Unnamed Item
• Unnamed Item
• Unnamed Item