Finding binomials in polynomial ideals

DOI10.1186/s40687-017-0106-0zbMath1428.13044arXiv1607.02135OpenAlexW2962752012WikidataQ59528072 ScholiaQ59528072MaRDI QIDQ2408988

Yanyan Li

Publication date: 10 October 2017

Published in: Research in the Mathematical Sciences (Search for Journal in Brave)

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

zbMATH Keywords

algorithmbinomial idealtropical geometrybinomial detection

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Combinatorial aspects of tropical varieties (14T15) Number-theoretic algorithms; complexity (11Y16) Algebraic number theory computations (11Y40) Polynomials, factorization in commutative rings (13P05) Algebraic numbers; rings of algebraic integers (11R04)

Related Items

Binomiality testing and computing sparse polynomials via witness sets ⋮ Higher connectivity of tropicalizations ⋮ No short polynomials vanish on bounded rank matrices ⋮ Computing the binomial part of a polynomial ideal ⋮ Toric varieties from cyclic matrix semigroups ⋮ When is a polynomial ideal binomial after an ambient automorphism?

Uses Software

• SINGULAR
• Binomials.m2

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Decompositions of commutative monoid congruences and binomial ideals.
• Detecting binomiality
• Algorithms for commutative algebras over the rational numbers
• Binomial ideals
• Gröbner deformations of hypergeometric differential equations
• Computing tropical varieties
• Polytopal linear retractions
• A Singular Introduction to Commutative Algebra
• Unsolvability in 3 × 3 Matrices
• ON THE UNDECIDABILITY OF THE FREENESS OF INTEGER MATRIX SEMIGROUPS
• Stable intersections of tropical varieties