A theorem on refining division orders by the reverse lexicographic order
From MaRDI portal
Publication:1099197
DOI10.1215/S0012-7094-87-05517-7zbMath0638.06003MaRDI QIDQ1099197
Publication date: 1987
Published in: Duke Mathematical Journal (Search for Journal in Brave)
monomialsrefinementdivision algorithmmonoid structurereverse lexicographic orderstandard basis for homogeneous idealsvector space of homogeneous polynomials
Partial orders, general (06A06) Software, source code, etc. for problems pertaining to commutative algebra (13-04) Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Enumerative combinatorics (05A99)
Related Items
Sur la complexité du calcul des projections d'une courbe projective, Maximum betti numbers of homogeneous ideals with a given hilbert function, The syzygies of m-full ideals, Bistability and oscillations in chemical reaction networks, The converse of a theorem by Bayer and Stillman, Gotzmann theorems for exterior algebras and combinatorics, Quasi-stability versus Genericity, Smoothable Gorenstein Points Via Marked Schemes and Double-generic Initial Ideals, The Gröbner fan of an ideal, A geometrical approach to multiset orderings, Standard bases and geometric invariant theory. I: Initial ideals and state polytopes, Deterministic genericity for polynomial ideals, Borel sets and sectional matrices, The asymptotic behaviour of symbolic generic initial systems of generic points, Hilbert schemes with two Borel-fixed points in arbitrary characteristic, Freiman Borel-type ideals, Gröbner bases of reaction networks with intermediate species, Computing syzygies in finite dimension using fast linear algebra, The Eliahou-Kervaire resolution is cellular, The Lex-Plus-Powers conjecture holds for pure powers, Multi-Rees algebras of strongly stable ideals, The ubiquity of smooth Hilbert schemes, Combinatorial dimension theory of algebraic varieties, Sparse FGLM algorithms, Borel generators, Stillman’s conjecture via generic initial ideals, Ideals generated by reverse lexicographic segments, GENERALIZED REDUCTION TO COMPUTE TORIC IDEALS, The Rees algebra of a two-Borel ideal is Koszul, On an extension of Galligo's theorem concerning the Borel-fixed points on the Hilbert scheme, Double-generic initial ideal and Hilbert scheme, Chow polytopes and general resultants, Some results on Gröbner bases over commutative rings, Computation of Hilbert functions, Counting and Gröbner bases, The generic initial ideals of powers of a 2-complete intersection, Algebraic Shifting of Finite Graphs, Generic Initial Ideals of Arithmetically Cohen–Macaulay Projective Subschemes, Unnamed Item, Grothendieck–Plücker Images of Hilbert Schemes are Degenerate, Non-general type surfaces in \(\mathbb{P}^4\): Some remarks on bounds and constructions, Bigeneric initial ideals, diagonal subalgebras and bigraded Hilbert functions, The Locus of Points of the Hilbert Scheme with Bounded Regularity, On associated primes of initial ideals, A new algorithm for discussing Gröbner bases with parameters., On the computation of Hilbert-Poincaré series, Solving parametric systems of polynomial equations over the reals through Hermite matrices, Axial constants and sectional regularity of homogeneous ideals
Cites Work
- Unnamed Item
- A criterion for detecting m-regularity
- New constructive methods in classical ideal theory
- Standard bases and geometric invariant theory. I: Initial ideals and state polytopes
- Über B. Buchbergers Verfahren, Systeme algebraischer Gleichungen zu lösen
- Uniformizing functions for certain Shimura curves, in the case D=6