Computing the binomial part of a polynomial ideal

DOI10.1016/J.JSC.2024.102298MaRDI QIDQ6192534zbMATH OpenOpenAlexWikidataFDO

Authors Martin Kreuzer, Florian Walsh

Publication date 11 March 2024

Published in Journal of Symbolic Computation (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

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

zbMATH Keywords

binomial idealcellular decompositionexponent latticebinomial part

Mathematics Subject Classification ID

Polynomials, factorization in commutative rings (13P05) Other special types of modules and ideals in commutative rings (13C13) Commutative rings defined by binomial ideals, toric rings, etc. (13F65) Computational methods for problems pertaining to field theory (12-08)

Recommendations

• Binomial ideals
• A divide and conquer method to compute binomial ideals
• Computing Gröbner bases of pure binomial ideals via submodules of Z^n
• Combinatorics of binomial primary decomposition
• Binomial fibers and indispensable binomials

Cites work

• scientific article; zbMATH DE number 4071018 (Why is no real title available?)
• scientific article; zbMATH DE number 1515218 (Why is no real title available?)
• scientific article; zbMATH DE number 871949 (Why is no real title available?)
• scientific article; zbMATH DE number 2206382 (Why is no real title available?)
• A space efficient algorithm for group structure computation
• Algorithms for commutative algebras over the rational numbers
• An Effective Framework for Constructing Exponent Lattice Basis of Nonzero Algebraic Numbers
• Binomial ideals
• Binomial ideals
• Binomiality testing and computing sparse polynomials via witness sets
• Cellular binomial ideals. Primary decomposition of binomial ideals
• Computational linear and commutative algebra
• Computing generating sets of lattice ideals and Markov bases of lattices
• Computing sparse multiples of polynomials
• Computing the algebraic relations of \(C\)-finite sequences and multisequences
• Computing the structure of a finite abelian group
• Conquering inseparability: primary decomposition and multivariate factorization over algebraic function fields of positive characteristic
• Effective computation of the integral closure of a morphism
• Factoring into coprimes in essentially linear time
• Finding binomials in polynomial ideals
• Modern computer algebra
• Normalization of rings
• On some computational problems in finite abelian groups
• Order bounds for C2-finite sequences
• Quantum automata and algebraic groups
• Recognizing Units in Number Fields
• SINGULAR
• The calculation of radical ideals in positive characteristic
• When is a polynomial ideal binomial after an ambient automorphism?

Cited in

(1)

• Computing the unit group of a commutative finite \(\mathbb{Z}\)-algebra

Describes a project that uses

Uses Software

• SageMath

This page was built for publication: Computing the binomial part of a polynomial ideal

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