Degröbnerization: a political manifesto
From MaRDI portal
Publication:2100110
DOI10.1007/s00200-022-00586-zOpenAlexW4308456931MaRDI QIDQ2100110
Samuel Lundqvist, Michela Ceria, Ferdinando Mora
Publication date: 21 November 2022
Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00200-022-00586-z
Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Correcting errors and erasures via the syndrome variety
- On the decoding of binary cyclic codes with the Newton identities
- HELP: a sparse error locator polynomial for BCH codes
- Bar code: a visual representation for finite sets of terms and its applications
- The big mother of all dualities. 2: Macaulay bases
- The number of generators of a colength N ideal in a power series ring
- Solving zero-dimensional systems through the rational univariate representation
- Efficient computation of zero-dimensional Gröbner bases by change of ordering
- On the decoding of cyclic codes using Gröbner bases
- Computing ideals of points
- Computing Gröbner bases by FGLM techniques in a non-commutative setting
- Efficient computation of squarefree separator polynomials
- Multivariate interpolation and standard bases for Macaulay modules
- The Chen-Reed-Helleseth-Truong decoding algorithm and the Gianni-Kalkbrenner Gröbner shape theorem
- Multivariate polynomial equations with multiple zeros solved by matrix eigenproblems
- From algebraic sets to monomial linear bases by means of combinatorial algorithms
- Multiplication matrices and ideals of projective dimension zero
- Applied algebra, algebraic algorithms and error correcting codes. 13th international symposium, AAECC-13, Honolulu, HI, USA, November 15--19, 1999. Proceedings
- Bar code for monomial ideals
- A computational algebra approach to the reverse engineering of gene regulatory networks
- Computing and using minimal polynomials
- Gröbner bases of ideals defined by functionals with an application to ideals of projective points
- Bezoutian and quotient ring structure
- The lex game and some applications
- Indicator function and complex coding for mixed fractional factorial designs
- Vector space bases associated to vanishing ideals of points
- Computational Linear and Commutative Algebra
- Finding BCH error locator polynomials in one step
- Solving projective complete intersection faster
- Methods in Algebraic Statistics for the Design of Experiments
- Gröbner Bases, Coding, and Cryptography
- Use of Grobner bases to decode binary cyclic codes up to the true minimum distance
- General principles for the algebraic decoding of cyclic codes
- An FGLM-like algorithm for computing the radical of a zero-dimensional ideal
- On the Shape of the General Error Locator Polynomial for Cyclic Codes
- Numerical Polynomial Algebra
- A divide-and-conquer algorithm for computing gröbner bases of syzygies in finite dimension
- Computing Gröbner bases of ideals of few points in high dimensions
- Solving systems of algebraic equations by using gröbner bases
- Properties of Gröbner bases under specializations
- Complexity of Comparing Monomials and Two Improvements of the Buchberger-Möller Algorithm
- A practical method for enumerating cosets of a finite abstract group
- On a certain classification of rings and semigroups
- Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
This page was built for publication: Degröbnerization: a political manifesto
