H Rahkooy - arXiv preprint arXiv:2410.17208, 2024 - arxiv.org
In this paper, we present a new algorithm for computing the linear recurrence relations of multi-dimensional sequences. Existing algorithms for computing these relations arise in …
G Villard - Journal of Symbolic Computation, 2025 - Elsevier
Given two polynomials a and b in F q [x, y] which have no non-trivial common divisors, we prove that a generator of the elimination ideal< a, b>∩ F q [x] can be computed in quasi …
X Li, W Niu - Mathematical Methods in the Applied Sciences, 2022 - Wiley Online Library
In this paper, a method is proposed to analyze the structure of dual space of the saturated ideal generated by a regular set and the local multiplicities of its zeros. In detail, we …
Resultants and Gr\" obner bases are crucial tools in studying polynomial elimination theory. We investigate relations between the variety of the resultant of two polynomials and the …