Modular algorithms for computing Gröbner bases.
From MaRDI portal
Publication:1401905
Recommendations
- On the modular computation of Gröbner bases with integer coefficients
- Parallel modular computation of Gröbner and involutive bases
- Computing bases of modular forms using the graded algebra structure
- scientific article; zbMATH DE number 5052246
- Computation of Gröbner bases
- scientific article; zbMATH DE number 5494047
- A new framework for computing Gröbner bases
- Modular techniques for noncommutative Gröbner bases
- scientific article; zbMATH DE number 1163420
- scientific article; zbMATH DE number 1276818
Cites work
- A p-adic approach to the computation of Gröbner bases
- Exact Solutions of Linear Equations with Rational Coefficients by Congruence Techniques
- Hilbert functions and the Buchberger algorithm
- scientific article; zbMATH DE number 3649988 (Why is no real title available?)
- scientific article; zbMATH DE number 3900153 (Why is no real title available?)
- scientific article; zbMATH DE number 3941661 (Why is no real title available?)
- scientific article; zbMATH DE number 41264 (Why is no real title available?)
- scientific article; zbMATH DE number 62658 (Why is no real title available?)
- scientific article; zbMATH DE number 704831 (Why is no real title available?)
- Lifting standard bases in filtered structures
- Mapping integers and Hensel codes onto Farey fractions
- On an installation of Buchberger's algorithm
- On lucky ideals for Gröbner basis computations
- On lucky primes
- Some comments on the modular approach to Gröbner-bases
Cited in
(64)- A p-adic approach to the computation of Gröbner bases
- On lucky ideals for Gröbner basis computations
- On lucky primes
- A smoothness test for higher codimensions
- Linearizability and critical period bifurcations of a generalized Riccati system
- Slimgb: Gröbner bases with slim polynomials
- Usage of modular techniques for efficient computation of ideal operations
- Parallel modular computation of Gröbner and involutive bases
- Using semicontinuity for standard bases computations
- Modular techniques for noncommutative Gröbner bases
- Standard bases over Euclidean domains
- Efficient Gröbner bases computation over principal ideal rings
- Qualitative studies of some biochemical models
- On the modular computation of Gröbner bases with integer coefficients
- Computing and using minimal polynomials
- Isochronicity and linearizability of planar polynomial Hamiltonian systems
- Certifying solutions to overdetermined and singular polynomial systems over \(\mathbb{Q}\)
- Parallelization of modular algorithms
- Reduced Gröbner bases and Macaulay-Buchberger basis theorem over Noetherian rings
- Gröbner bases for families of affine or projective schemes
- The solution of the 1:-3 resonant center problem in the quadratic case
- Giac and GeoGebra -- improved Gröbner basis computations
- The center problem and composition condition for Abel differential equations
- Bad Primes in Computational Algebraic Geometry
- An application of regular chain theory to the study of limit cycles
- Size of coefficients of lexicographical Gröbner bases: the zero-dimensional, radical and bivariate case
- Computation of highly ramified coverings
- Efficient Algorithms for Computing Nœther Normalization
- scientific article; zbMATH DE number 5509903 (Why is no real title available?)
- Modular Algorithms for Computing a Generating Set of the Syzygy Module
- Gröbner bases of symmetric ideals
- scientific article; zbMATH DE number 62658 (Why is no real title available?)
- The center problem for a \({1:-4}\) resonant quadratic system
- scientific article; zbMATH DE number 1263402 (Why is no real title available?)
- Local to global algorithms for the Gorenstein adjoint ideal of a curve
- scientific article; zbMATH DE number 1860716 (Why is no real title available?)
- Groebner basis methods for stationary solutions of a low-dimensional model for a shear flow
- Ideals modulo a prime
- A modular algorithm to compute the generalized Hermite normal form for \(\mathbb{Z}[x]\)-lattices
- Isochronicity and linearizability of a planar cubic system
- Centers and limit cycles of a generalized cubic Riccati system
- scientific article; zbMATH DE number 5494047 (Why is no real title available?)
- The use of bad primes in rational reconstruction
- Probabilistic saturations and Alt's problem
- p-adic algorithm for bivariate Gröbner bases
- Digital collections of examples in mathematical sciences
- 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
- \textsc{Rings}: an efficient Java/Scala library for polynomial rings
- Methodologies of Symbolic Computation
- An approach to solving systems of polynomials via modular arithmetics with applications
- A Modular Algorithm for Computing the Intersection of a One-Dimensional Quasi-Component and a Hypersurface
- An \(\mathfrak{m}\)-adic algorithm for bivariate Gröbner bases
- msolve. A library for solving polynomial systems
- Distortion varieties
- \textsf{f4ncgb}: high performance Gröbner basis computations in free algebras
- Computing generic fibers of polynomial ideals with FGLM and hensel lifting
- Modular algorithms for computing Gröbner bases in free algebras
- Wronski pairs of honeycomb curves
- Calculation of first integrals of a two-dimensional ODE system near a degenerate stationary point by computer algebra tools
- Computing integral bases via localization and Hensel lifting
- Bistability and oscillations in chemical reaction networks
- The center problem for a 2:-3 resonant cubic Lotka-Volterra system
- Integrability conditions for Lotka-Volterra planar complex quintic systems
This page was built for publication: Modular algorithms for computing Gröbner bases.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1401905)
