Thibaut Verron
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Thibaut Verron has a total of 15 co-authors. Here are the top co-authors by number of shared publications:
- Clemens Hofstadler
Johannes Kepler University Linz, Linz, Austria
4 shared publications Jean-Charles Faugère
3 shared publications- Manuel Kauers
Institute for Algebra, Johannes Kepler University, Linz, Austria
3 shared publications - Maria Francis
Computer Science and Engineering, Indian Institute of Technology Hyderabad, Hyderabad, Telangana, India
3 shared publications Mohab Safey El Din
3 shared publicationsAlain Jacquemard
Sorbonne Universités, UPMC Univ. Paris 06, Inria Paris, PolSys project, CNRS UMR 7606, Paris, France
1 shared publication
Latest Publications
- 2 April 2026
- Published by Agence Bibliographique de l'Enseignement Supérieur
Regularisation of Gröbner basis computations for weighted and determinantal systems, and application to medical imagery
Régularisation du calcul de bases de Gröbner pour des systèmes avec poids et déterminantiels, et application en imagerie médicale: La résolution de systèmes polynomiaux est un problème aux multiples applications, et les bases de Gröbner sont un outil important dans ce cadre. Il est connu que de nombreux systèmes issus d'applications présentent une structure supplémentaire par rapport à des systèmes arbitraires, et que ces structures peuvent souvent être exploitées pour faciliter le calcul de bases de Gröbner.Dans cette thèse, on s'intéresse à deux exemples de telles structures, pour différentes applications. Tout d'abord, on étudie les systèmes homogènes avec poids, qui sont homogènes si on calcule le degré en affectant un poids à chaque variable. Cette structure apparaît naturellement dans de nombreuses applications, dont un problème de cryptographie (logarithme discret). On montre comment les algorithmes existants, efficaces pour les polynômes homogènes, peuvent être adaptés au cas avec poids, avec des bornes de complexité générique divisées par un facteur polynomial en le produit des poids.Par ailleurs, on étudie un problème de classification de racines réelles pour des variétés définies par des déterminants. Ce problème a une application directe en théorie du contrôle, pour l'optimisation de contraste de l'imagerie à résonance magnétique. Ce système particulier s'avère insoluble avec les stratégies générales pour la classification. On montre comment ces stratégies peuvent tirer profit de la structure déterminantielle du système, et on illustre ce procédé en apportant des réponses aux questions posées par le problème d'optimisation de contraste.
- 2 April 2026
- Published by Agence Bibliographique de l'Enseignement Supérieur
Regularisation of Gröbner basis computations for weighted and determinantal systems, and application to medical imagery
Régularisation du calcul de bases de Gröbner pour des systèmes avec poids et déterminantiels, et application en imagerie médicale: La résolution de systèmes polynomiaux est un problème aux multiples applications, et les bases de Gröbner sont un outil important dans ce cadre. Il est connu que de nombreux systèmes issus d'applications présentent une structure supplémentaire par rapport à des systèmes arbitraires, et que ces structures peuvent souvent être exploitées pour faciliter le calcul de bases de Gröbner.Dans cette thèse, on s'intéresse à deux exemples de telles structures, pour différentes applications. Tout d'abord, on étudie les systèmes homogènes avec poids, qui sont homogènes si on calcule le degré en affectant un poids à chaque variable. Cette structure apparaît naturellement dans de nombreuses applications, dont un problème de cryptographie (logarithme discret). On montre comment les algorithmes existants, efficaces pour les polynômes homogènes, peuvent être adaptés au cas avec poids, avec des bornes de complexité générique divisées par un facteur polynomial en le produit des poids.Par ailleurs, on étudie un problème de classification de racines réelles pour des variétés définies par des déterminants. Ce problème a une application directe en théorie du contrôle, pour l'optimisation de contraste de l'imagerie à résonance magnétique. Ce système particulier s'avère insoluble avec les stratégies générales pour la classification. On montre comment ces stratégies peuvent tirer profit de la structure déterminantielle du système, et on illustre ce procédé en apportant des réponses aux questions posées par le problème d'optimisation de contraste.
- Open Access
On the computation of Gröbner bases for matrix-weighted homogeneous systems
In this paper, we examine the structure of systems that are weighted homogeneous for several systems of weights, and how it impacts the computation of Gr\"obner bases. We present several linear algebra algorithms for computing Gr\"obner bases for systems with this structure, either directly or by reducing to existing structures. We also present suitable optimization techniques. As an opening towards complexity studies, we discuss potential definitions of regularity and prove that they are generic if non-empty. Finally, we present experimental data from a prototype implementation of the algorithms in SageMath.
Open AccessOn the computation of Gröbner bases for matrix-weighted homogeneous systems
In this paper, we examine the structure of systems that are weighted homogeneous for several systems of weights, and how it impacts the computation of Gr\"obner bases. We present several linear algebra algorithms for computing Gr\"obner bases for systems with this structure, either directly or by reducing to existing structures. We also present suitable optimization techniques. As an opening towards complexity studies, we discuss potential definitions of regularity and prove that they are generic if non-empty. Finally, we present experimental data from a prototype implementation of the algorithms in SageMath.
- Open Access
- 5 April 2024
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 125
On the computation of Gröbner bases for matrix-weighted homogeneous systems
- 5 April 2024
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 125
Open AccessOn the computation of Gröbner bases for matrix-weighted homogeneous systems
- Open Access
- 2 April 2024
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 125
Short proofs of ideal membership
- 2 April 2024
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 125
Open AccessShort proofs of ideal membership
- Open Access
- 24 July 2023
- Published by Association for Computing Machinery (ACM)
- p. 517-525
Universal Analytic Gröbner Bases and Tropical Geometry
- 24 July 2023
- Published by Association for Computing Machinery (ACM)
- p. 517-525
Open AccessUniversal Analytic Gröbner Bases and Tropical Geometry
- Open Access
- 24 July 2023
- Published by Association for Computing Machinery (ACM)
- p. 298-306
Signature Gröbner bases in free algebras over rings
- 24 July 2023
- Published by Association for Computing Machinery (ACM)
- p. 298-306
Open AccessSignature Gröbner bases in free algebras over rings
- Open Access
- 24 July 2023
- Published by Association for Computing Machinery (ACM)
- p. 372-380
Transcendence Certificates for D-finite Functions
Although in theory we can decide whether a given D-finite function is transcendental, transcendence proofs remain a challenge in practice. Typically, transcendence is certified by checking certain incomplete sufficient conditions. In this paper we propose an additional such condition which catches some cases on which other tests fail.
- 24 July 2023
- Published by Association for Computing Machinery (ACM)
- p. 372-380
Open AccessTranscendence Certificates for D-finite Functions
Although in theory we can decide whether a given D-finite function is transcendental, transcendence proofs remain a challenge in practice. Typically, transcendence is certified by checking certain incomplete sufficient conditions. In this paper we propose an additional such condition which catches some cases on which other tests fail.
- Open Access
Signature Gröbner bases, bases of syzygies and cofactor reconstruction in the free algebra
Signature-based algorithms have become a standard approach for computing Gr\"obner bases in commutative polynomial rings. However, so far, it was not clear how to extend this concept to the setting of noncommutative polynomials in the free algebra. In this paper, we present a signature-based algorithm for computing Gr\"obner bases in precisely this setting. The algorithm is an adaptation of Buchberger's algorithm including signatures. We prove that our algorithm correctly enumerates a signature Gr\"obner basis as well as a Gr\"obner basis of the module generated by the leading terms of the generators' syzygies, and that it terminates whenever the ideal admits a finite signature Gr\"obner basis. Additionally, we adapt well-known signature-based criteria eliminating redundant reductions, such as the syzygy criterion, the F5 criterion and the singular criterion, to the case of noncommutative polynomials. We also generalize reconstruction methods from the commutative setting that allow to recover, from partial information about signatures, the coordinates of elements of a Gr\"obner basis in terms of the input polynomials, as well as a basis of the syzygy module of the generators. We have written a toy implementation of all the algorithms in the Mathematica package OperatorGB and we compare our signature-based algorithm to the classical Buchberger algorithm for noncommutative polynomials.
Open AccessSignature Gröbner bases, bases of syzygies and cofactor reconstruction in the free algebra
Signature-based algorithms have become a standard approach for computing Gr\"obner bases in commutative polynomial rings. However, so far, it was not clear how to extend this concept to the setting of noncommutative polynomials in the free algebra. In this paper, we present a signature-based algorithm for computing Gr\"obner bases in precisely this setting. The algorithm is an adaptation of Buchberger's algorithm including signatures. We prove that our algorithm correctly enumerates a signature Gr\"obner basis as well as a Gr\"obner basis of the module generated by the leading terms of the generators' syzygies, and that it terminates whenever the ideal admits a finite signature Gr\"obner basis. Additionally, we adapt well-known signature-based criteria eliminating redundant reductions, such as the syzygy criterion, the F5 criterion and the singular criterion, to the case of noncommutative polynomials. We also generalize reconstruction methods from the commutative setting that allow to recover, from partial information about signatures, the coordinates of elements of a Gr\"obner basis in terms of the input polynomials, as well as a basis of the syzygy module of the generators. We have written a toy implementation of all the algorithms in the Mathematica package OperatorGB and we compare our signature-based algorithm to the classical Buchberger algorithm for noncommutative polynomials.
- Open Access
- 5 April 2022
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 113, 211-241
Signature Gröbner bases, bases of syzygies and cofactor reconstruction in the free algebra
- 5 April 2022
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 113, 211-241
Open AccessSignature Gröbner bases, bases of syzygies and cofactor reconstruction in the free algebra
- Open Access
The generating function of Kreweras walks with interacting boundaries is not algebraic
Beaton, Owczarek and Xu (2019) studied generating functions of Kreweras walks and of reverse Kreweras walks in the quarter plane, with interacting boundaries. They proved that for the reverse Kreweras step set, the generating function is always algebraic, and for the Kreweras step set, the generating function is always D-finite. However, apart from the particular case where the interactions are symmetric in $x$ and~$y$, they left open the question of whether the latter one is algebraic. Using computer algebra tools, we confirm their intuition that the generating function of Kreweras walks is not algebraic, apart from the particular case already identified.Open AccessThe generating function of Kreweras walks with interacting boundaries is not algebraic
Beaton, Owczarek and Xu (2019) studied generating functions of Kreweras walks and of reverse Kreweras walks in the quarter plane, with interacting boundaries. They proved that for the reverse Kreweras step set, the generating function is always algebraic, and for the Kreweras step set, the generating function is always D-finite. However, apart from the particular case where the interactions are symmetric in $x$ and~$y$, they left open the question of whether the latter one is algebraic. Using computer algebra tools, we confirm their intuition that the generating function of Kreweras walks is not algebraic, apart from the particular case already identified.