[HTML][HTML] Block-Krylov techniques in the context of sparse-FGLM algorithms
Consider a zero-dimensional ideal I in K [X 1,…, X n]. Inspired by Faugère and Mou's Sparse
FGLM algorithm, we use Krylov sequences based on multiplication matrices of I in order to …
FGLM algorithm, we use Krylov sequences based on multiplication matrices of I in order to …
Change of basis for m-primary ideals in one and two variables
Following recent work by van der Hoeven and Lecerf (ISSAC 2017), we discuss the
complexity of linear mappings, called untangling and\emphtangling by those authors, that …
complexity of linear mappings, called untangling and\emphtangling by those authors, that …
On Recurrence Relations of Multi-dimensional Sequences
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 …
multi-dimensional sequences. Existing algorithms for computing these relations arise in …
Algorithms for linearly recurrent sequences of truncated polynomials
Linear recurrent sequences are those whose elements are defined as linear combinations of
preceding elements, and finding recurrence relations is a fundamental problem in computer …
preceding elements, and finding recurrence relations is a fundamental problem in computer …
Algorithms in Intersection Theory in the Plane
C St-Pierre - 2023 - uwspace.uwaterloo.ca
This thesis presents an algorithm to find the local structure of intersections of plane curves.
More precisely, we address the question of describing the scheme of the quotient ring of a …
More precisely, we address the question of describing the scheme of the quotient ring of a …