When is a polynomial ideal binomial after an ambient automorphism?

DOI10.1007/S10208-018-9405-0zbMATH Open1429.13010arXiv1706.03629OpenAlexW2626284558MaRDI QIDQ2007855FDOQ2007855

Ezra Miller, Mateusz Michalek, Lukas Katthän

Publication date: 22 November 2019

Published in: Foundations of Computational Mathematics (Search for Journal in Brave)

Abstract: Can an ideal I in a polynomial ring k[x] over a field be moved by a change of coordinates into a position where it is generated by binomials $x^a-c{x}^b$ with c in k, or by unital binomials (i.e., with c = 0 or 1)? Can a variety be moved into a position where it is toric? By fibering the G-translates of I over an algebraic group G acting on affine space, these problems are special cases of questions about a family F of ideals over an arbitrary base B. The main results in this general setting are algorithms to find the locus of points in B over which the fiber of F - is contained in the fiber of a second family F' of ideals over B; - defines a variety of dimension at least d; - is generated by binomials; or - is generated by unital binomials. A faster containment algorithm is also presented when the fibers of F are prime. The big-fiber algorithm is probabilistic but likely faster than known deterministic ones. Applications include the setting where a second group T acts on affine space, in addition to G, in which case algorithms compute the set of G-translates of I - whose stabilizer subgroups in T have maximal dimension; or - that admit a faithful multigrading by $Z^r$ of maximal rank r. Even with no ambient group action given, the final application is an algorithm to - decide whether a normal projective variety is abstractly toric. All of these loci in B and subsets of G are constructible; in some cases they are closed.

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

zbMATH Keywords

binomialalgorithmgroup actionpolynomial ringtoric varietyidealorbitconstructible set

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Toric varieties, Newton polyhedra, Okounkov bodies (14M25) Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Actions of groups on commutative rings; invariant theory (13A50) Fibrations, degenerations in algebraic geometry (14D06) Group actions on varieties or schemes (quotients) (14L30) Effectivity, complexity and computational aspects of algebraic geometry (14Q20) Other algebraic groups (geometric aspects) (14L40) Commutative rings defined by binomial ideals, toric rings, etc. (13F65)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Combinatorial Commutative Algebra
• Toric varieties
• Gröbner geometry of Schubert polynomials
• The tame and the wild automorphisms of polynomial rings in three variables
• Polynomial automorphisms and the Jacobian conjecture
• Secant varieties of Segre-Veronese varieties
• Éléments de géométrie algébrique. IV: Étude locale des schémas et des morphismes de schémas. (Troisième partie). Rédigé avec la colloboration de J. Dieudonné
• Binomial ideals
• Comprehensive Gröbner bases
• Computing the canonical representation of constructible sets
• Gröbner bases for polynomial systems with parameters
• On the ideals of equivariant tree models
• Irreducible decomposition of binomial ideals
• Toric Ideals of Phylogenetic Invariants
• Relevant phylogenetic invariants of evolutionary models
• On geometry of binary symmetric models of phylogenetic trees
• Algebraic geometry of Bayesian networks
• Decompositions of commutative monoid congruences and binomial ideals.
• Binary cumulant varieties
• Flexible affine cones and flexible coverings
• Finite phylogenetic complexity and combinatorics of tables
• Combinatorics of binomial primary decomposition
• Some structure theorems for algebraic groups
• Secant Cumulants and Toric Geometry
• Finding binomials in polynomial ideals

Cited In (6)

• When does a polynomial ideal contain a positive polynomial?
• Computing the binomial part of a polynomial ideal
• Toric geometry of path signature varieties
• From Polynomial Invariants to Linear Loops
• Title not available (Why is that?)
• Binomiality testing and computing sparse polynomials via witness sets

Uses Software

• Macaulay2
• Binomials.m2

This page was built for publication: When is a polynomial ideal binomial after an ambient automorphism?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2007855)