Chinese Remainder Theorem for bivariate lexicographic Gröbner bases
Pages 208 - 217
Abstract
This article proposes an algorithm that merges pairwise coprime bivariate lexicographic Gröbner bases (lexGb) and an algorithm that splits a lexGb into smaller lexGbs without factorization, in a Chinese Remainder Theorem fashion.
References
[1]
D. J. Bernstein. 2005. Factoring into coprimes in essentially linear time. J. Algorithms 54, 1 (2005), 1–30.
[2]
Xavier Dahan. 2009. Size of coefficients of lexicographical Gröbner bases. In Proceedings of ISSAC’09 (Seoul, Korea). ACM, New York, NY, USA, 117–126.
[3]
Xavier Dahan. 2022. Lexicographic Gröbner bases of bivariate polynomials modulo a univariate one. Journal of Symbolic Computation 110 (2022), 24–65.
[4]
Jean-Charles Faugère, Patrizia Gianni, Daniel Lazard, and Teo Mora. 1993. Efficient computation of zero-dimensional Gröbner bases by change of ordering. Journal of Symbolic Computation 16, 4 (1993), 329–344.
[5]
Bàlint Felszeghy, Bàlasz Ráth, and Lajos Rónyai. 2006. The lex game and some applications. Journal of Symbolic Computation 41, 6 (2006), 663 – 681.
[6]
Seung Gyu Hyun, Stephen Melczer, Éric Schost, and Catherine St-Pierre. 2019. Change of basis for -primary ideals in one and two variables. In Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation. 227–234.
[7]
Erich Kaltofen. 1985. Sparse Hensel lifting. In European Conference on Computer Algebra. Springer, 4–17.
[8]
Daniel Lazard. 1985. Ideal bases and primary decomposition: case of two variables. Journal Symbolic Computation 1, 3 (1985), 261–270.
[9]
Daniel Lazard. 1992. Solving zero-dimensional algebraic systems. Journal of Symbolic Computation 13 (1992), 147–160.
[10]
M. Lederer. 2008. The vanishing ideal of a finite set of closed points in affine space. J. of Pure and Applied Algebra 212 (2008), 1116–1133.
[11]
Maria Grazia Marinari and Teo Mora. 2003. A remark on a remark by Macaulay or enhancing Lazard structural theorem. Bull. Iranian Math. Soc. 29, 1 (2003), 1–45, 85.
[12]
H Michael Möller. 1993. On decomposing systems of polynomial equations with finitely many solutions. Applicable Algebra in Engineering, Communication and Computing 4, 4 (1993), 217–230.
[13]
Joseph-F. Ritt. 1932. Differential equations from an algebraic standpoint. Colloquiium publications of the AMS 14 (1932).
[14]
Éric Schost and Catherine St-Pierre. 2023. Newton iteration for lexicographic Gröbner bases in two variables. arxiv:2302.03766 [math.AC]
[15]
Éric Schost and Catherine St-Pierre. 2023. p-adic algorithms for bivariate Gröbner bases. In Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation (Tromsø, Norway). ACM, New York, NY, USA, 10 pages.
[16]
Joris van der Hoeven and Robin Larrieu. 2018. Fast Reduction of Bivariate Polynomials with Respect to Sufficiently Regular Gröbner Bases. In Proceedings of the 2018 ACM International Symposium on Symbolic and Algebraic Computation (New York, NY, USA) (ISSAC ’18). ACM, New York, NY, USA, 199–206.
[17]
Joris van der Hoeven and Grégoire Lecerf. 2021. Fast computation of generic bivariate resultants. Journal of Complexity 62 (2021), 101499.
[18]
Gilles Villard. 2018. On Computing the Resultant of Generic Bivariate Polynomials. In Proceedings of the 2018 ACM International Symposium on Symbolic and Algebraic Computation (New York, NY, USA) (ISSAC ’18). ACM, 391–398.
[19]
Gilles Villard. 2023. Elimination ideal and bivariate resultant over finite fields. In Proceedings of the 2023 ACM International Symposium on Symbolic and Algebraic Computation (Tromsø, Norway) (ISSAC ’23). ACM press, New York, NY, USA.
[20]
Jocahim von zur Gathen and Jürgen Gerhard. 2003. Modern computer algebra. Cambridge University Press, New York, NY, USA. Second Edition.
[21]
Wen-Tsu Wu. 1986. On zeros of algebraic equations - an application of Ritt principle. Kexue Tongbao 5 (1986), 1–5.
Recommendations
An alternative approach to comprehensive Gröbner bases
Special issue: International symposium on symbolic and algebraic computation (ISSAC 2002)We give an alternative definition of comprehensive Gröbner bases in terms of Gröbner bases in polynomial rings over commutative Von Neumann regular rings. Our comprehensive Gröbner bases are defined as Gröbner bases in polynomial rings over certain ...
A simple algorithm to compute comprehensive Gröbner bases using Gröbner bases
ISSAC '06: Proceedings of the 2006 international symposium on Symbolic and algebraic computationWe introduce a simple algorithm to compute comprehensive Gröbner bases. It requires only computations of reduced Gröbner bases in polynomial rings over ground fields. It is so simple that we can easily implement it on any computer algebra system that ...
Computing Gröbner bases of pure binomial ideals via submodules of Zn
A binomial ideal is an ideal of the polynomial ring which is generated by binomials. In a previous paper, we gave a correspondence between pure saturated binomial ideals of K[x"1,...,x"n] and submodules of Z^n and we showed that it is possible to ...
Comments
Information & Contributors
Information
Published In
July 2023
567 pages
Copyright © 2023 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 24 July 2023
Check for updates
Author Tags
Qualifiers
- Research-article
- Research
- Refereed limited
Funding Sources
- JSPS KAKENHI
Conference
ISSAC 2023
ISSAC 2023: International Symposium on Symbolic and Algebraic Computation 2023
July 24 - 27, 2023
Tromsø, Norway
Acceptance Rates
Overall Acceptance Rate 395 of 838 submissions, 47%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 51Total Downloads
- Downloads (Last 12 months)19
- Downloads (Last 6 weeks)2
Reflects downloads up to 30 Jan 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign inFull Access
View options
View or Download as a PDF file.
PDFeReader
View online with eReader.
eReaderHTML Format
View this article in HTML Format.
HTML Format