Usage of modular techniques for efficient computation of ideal operations

DOI10.1007/s11786-017-0325-1zbMath1402.13026OpenAlexW2778697438MaRDI QIDQ1993362

Masayuki Noro, Kazuhiro Yokoyama

Publication date: 5 November 2018

Published in: Mathematics in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11786-017-0325-1

zbMATH Keywords

Gröbner basismodular computationideal operation

Mathematics Subject Classification ID

Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)

Related Items

Modular techniques for noncommutative Gröbner bases, A Bridge between Euclid and Buchberger: (An Attempt to Enhance Gröbner Basis Algorithm by PRSs and GCDs), Modular computations of standard bases for subalgebras, Computing and using minimal polynomials, Ideals Modulo a Prime

Uses Software

• SINGULAR
• moddiq.lib

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Gröbner bases of symmetric ideals
• An approach to solving systems of polynomials via modular arithmetics with applications
• Bit-size estimates for triangular sets in positive dimension
• Hilbert functions and the Buchberger algorithm
• A p-adic approach to the computation of Gröbner bases
• On lucky ideals for Gröbner basis computations
• On lucky primes
• A new efficient algorithm for computing Gröbner bases \((F_4)\)
• Modular algorithms for computing Gröbner bases.
• A modular method to compute the rational univariate representation of zero-dimensional ideals
• Efficient arithmetic in successive algebraic extension fields using symmetries
• Parallelization of modular algorithms
• Implementation of prime decomposition of polynomial ideals over small finite fields
• Verification of Gröbner Basis Candidates
• Solving via Modular Methods
• Modular Algorithms for Computing a Generating Set of the Syzygy Module
• Sharp estimates for triangular sets
• Ideals, Varieties, and Algorithms
• Lifting techniques for triangular decompositions
• Linearizability of linear systems perturbed by fifth degree homogeneous polynomials
• Multi-modular algorithm for computing the splitting field of a polynomial
• The use of bad primes in rational reconstruction