Ideals modulo a prime

DOI10.1142/S0219498821500420zbMATH Open1472.13043arXiv1801.06112OpenAlexW2995901691WikidataQ126587676 ScholiaQ126587676MaRDI QIDQ4988232FDOQ4988232

Authors: John Abbott, Anna M. Bigatti, Lorenzo Robbiano 

Publication date: 12 May 2021

Published in: Journal of Algebra and its Applications (Search for Journal in Brave)

Abstract: The main focus of this paper is on the problem of relating an ideal $I$ in the polynomial ring $mathbbQ[x_1,dots,x_n]$ to a corresponding ideal in $mathbb{F}_p[x_1,dots,x_n]$ where $p$ is a prime number; in other words, the extit{reduction modulo $p$} of $I$. We first define a new notion of $sigma$-good prime for $I$ which does depends on the term ordering $sigma$, but not on the given generators of $I$. We relate our notion of $sigma$-good primes to some other similar notions already in the literature. Then we introduce and describe a new invariant called the universal denominator which frees our definition of reduction modulo~$p$ from the term ordering, thus letting us show that all but finitely many primes are good for $I$. One characteristic of our approach is that it enables us to easily detect some bad primes, a distinct advantage when using modular methods.

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

Recommendations

• On lucky primes
• On lucky ideals for Gröbner basis computations
• Modular algorithms for computing minimal associated primes and radicals of polynomial ideals
• Usage of modular techniques for efficient computation of ideal operations
• The use of bad primes in rational reconstruction

zbMATH Keywords

idealsmodularterm orderingsGröbner bases

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Applications of commutative algebra (e.g., to statistics, control theory, optimization, etc.) (13P25) Computational aspects of algebraic surfaces (14Q10) Software, source code, etc. for problems pertaining to commutative algebra (13-04)

Cites Work

• SINGULAR
• Title not available (Why is that?)
• Title not available (Why is that?)
• Modular algorithms for computing Gröbner bases.
• The Gröbner fan of an ideal
• Title not available (Why is that?)
• Implementation of prime decomposition of polynomial ideals over small finite fields
• A modular method to compute the rational univariate representation of zero-dimensional ideals
• Parallelization of modular algorithms
• Implicitization of hypersurfaces
• Gröbner bases with coefficients in rings
• Title not available (Why is that?)
• Bad Primes in Computational Algebraic Geometry
• A p-adic approach to the computation of Gröbner bases
• Fault-tolerant modular reconstruction of rational numbers
• Maximal quotient rational reconstruction
• Usage of modular techniques for efficient computation of ideal operations
• Computing and using minimal polynomials
• Computational linear and commutative algebra
• Modular Algorithms for Computing Minimal Associated Primes and Radicals of Polynomial Ideals

Cited In (4)

• Usage of modular techniques for efficient computation of ideal operations
• \textsc{Sagbi} combinatorics of maximal minors and a \textsc{Sagbi} algorithm
• Modular computations of standard bases for subalgebras
• The use of bad primes in rational reconstruction

Uses Software

• CoCoA
• CoCoALib
• gmp
• SINGULAR

This page was built for publication: Ideals modulo a prime

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