skip to main content
article
Free access

Admissible orders and linear forms

Published: 01 May 1987 Publication History

Abstract

Admissible orders on terms (power-products of finitely many indeterminates X1,..., Xn play a fundamental role in the definition and construction of Groebner bases for polynomial ideals (see [Bul). By passage to exponents, these orders may be construed as linear orders on [EQUATION] compatible with addition and with smallest element [EQUATION] = (0,...,0). Any such order extends uniquely to a linear order < on [EQUATION] turning ([EQUATION], +, >) into an ordered group such that all elements of [EQUATION] are non-negative, Conversely, any restriction of such an order to [EQUATION] is an admissible order on [EQUATION]. So from now on an "admissible order" will be a linear group order on [EQUATION] with [EQUATION] >= 0.

References

[1]
{Bu} B. Buchberger, Groebner bases: An algorithmic method in polynomial ideal theory, in Recent trends in multidimensional systems theory, Reidel Publ. Comp. 1965.
[2]
{Ga} A. Galligo, Theoreme de division et stabilite en geometrie analytique locale, Ann. Inst. Fourier Univ. Grenoble 29 (1979), 107--184.
[3]
{GJ} M. R. Garey, D. S. Johnson, Computers & Intractability, Freeman, New York, printing 1984.
[4]
{Ro} L. Robbiano, Term orderings on the polynomial ring, in EUROCAL '85, Springer LNCS vol. 204, (1985), pp. 513--517.

Cited By

View all
  • (2016)BibliographyAlgebraic Operads10.1201/b20061-14(343-361)Online publication date: 31-Mar-2016
  • (2005)The complexity of the coverability, the containment, and the equivalence problems for commutative semigroupsFundamentals of Computation Theory10.1007/BFb0036189(257-268)Online publication date: 21-Jun-2005
  • (2005)Characterisations of lexicographic sets and simply-connected Hilbert schemesApplied Algebra, Algebraic Algorithms and Error-Correcting Codes10.1007/3-540-63163-1_18(221-236)Online publication date: 8-Jun-2005
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM SIGSAM Bulletin
ACM SIGSAM Bulletin  Volume 21, Issue 2
May 1987
28 pages
ISSN:0163-5824
DOI:10.1145/24554
Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 May 1987
Published in SIGSAM Volume 21, Issue 2

Check for updates

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)77
  • Downloads (Last 6 weeks)18
Reflects downloads up to 22 Oct 2024

Other Metrics

Citations

Cited By

View all
  • (2016)BibliographyAlgebraic Operads10.1201/b20061-14(343-361)Online publication date: 31-Mar-2016
  • (2005)The complexity of the coverability, the containment, and the equivalence problems for commutative semigroupsFundamentals of Computation Theory10.1007/BFb0036189(257-268)Online publication date: 21-Jun-2005
  • (2005)Characterisations of lexicographic sets and simply-connected Hilbert schemesApplied Algebra, Algebraic Algorithms and Error-Correcting Codes10.1007/3-540-63163-1_18(221-236)Online publication date: 8-Jun-2005
  • (2005)Symideal Gröbner basesRewriting Techniques and Applications10.1007/3-540-61464-8_42(48-62)Online publication date: 2-Jun-2005
  • (2005)Optimal gröbner base algorithms for binomial idealsAutomata, Languages and Programming10.1007/3-540-61440-0_132(244-255)Online publication date: 2-Jun-2005
  • (2005)The ideal structure of Gröbner base computationsIntegrating Symbolic Mathematical Computation and Artificial Intelligence10.1007/3-540-60156-2_12(156-166)Online publication date: 2-Jun-2005
  • (2005)Constructing universal Gröbner basesApplied Algebra, Algebraic Algorithms and Error-Correcting Codes10.1007/3-540-51082-6_96(408-417)Online publication date: 1-Jun-2005
  • (2003)Cited ReferencesComputer algebra handbook10.5555/940131.940137(493-622)Online publication date: 1-Jan-2003
  • (2002)Finite SAGBI bases for polynomial invariants of conjugates of alternating groupsMathematics of Computation10.1090/S0025-5718-01-01405-371:238(761-765)Online publication date: 1-Apr-2002
  • (2001)An Optimal Algorithm for Constructing the Reduced Gröbner Basis of Binomial Ideals, and Applications to Commutative SemigroupsJournal of Symbolic Computation10.5555/2791618.279218731:1(259-276)Online publication date: 1-Jan-2001
  • Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media