Admissible orders and linear forms
From MaRDI portal
Cited in
(23)- Computing dimension and independent sets for polynomial ideals
- On the number of term orders
- A new notion of reduction: Generating universal Gröbner bases of ideals in \(K[x,y]\)
- An algorithm for solving parametric linear systems
- Comprehensive Gröbner bases
- Covers and fans of polynomial ideals
- On the walk
- Connectedness of Hilbert function strata and other connectedness results
- A rewriting technique for universal polynomial invariants
- Rings of polynomial invariants of the alternating group have no finite SAGBI bases with respect to any admissible order
- Algebraic algorithms for sampling from conditional distributions
- Gröbner bases, invariant theory and equivariant dynamics
- Optimal algorithms for the coverability, the subword, the containment, and the equivalence problems for commutative semigroups.
- A combinatorial result on Gröbner fans with an application to universal Gröbner bases
- The ``smallest ring of polynomial invariants of a permutation group which has no finite SAGBI bases w. r. t. any admissible order
- An optimal algorithm for constructing the reduced Gröbner basis of binomial ideals
- Finite SAGBI bases for polynomial invariants of conjugates of alternating groups
- Symideal Gröbner bases
- The complexity of the coverability, the containment, and the equivalence problems for commutative semigroups
- Some relational structures with polynomial growth and their associated algebras. II: Finite generation.
- An optimal algorithm for constructing the reduced Gröbner basis of binomial ideals, and applications to commutative semigroups
- Stability and Buchberger criterion for standard bases in power series rings
- Standard bases and some computations in rings of power series
This page was built for publication: Admissible orders and linear forms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3801689)
