ARAntoine Renard
Antoine Renard
*This is an algorithmically generated author record based on publicly available information.
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Antoine Renard has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Michel Rigo
Department of Mathematics, University of Liège, Liège, Belgium
4 shared publications - Markus A. Whiteland
Department of Computer Science, Loughborough University, Loughborough, UK
3 shared publications Bastien Mignoty
ENS Lyon, Lyon Cedex 07, France
1 shared publicationMarkus A. Whiteland
1 shared publicationMichel Rigo
1 shared publication
Latest Publications
- Open Access
Variants of Wythoff game with terminal positions or blocking maneuvers
We show how the software Walnut can be used to obtain concise proofs of results concerning variants of the famous Wythoff game, in which blocking maneuvers or terminal positions are added, as discussed respectively by Larsson (2011) and Komak et al. (2025). Our approach provides automatic proofs that both confirm and extend their results, and the same techniques apply to newly introduced variants as well. Then, using classic techniques, we obtain new recursive and morphic characterizations of Wythoff-type games where the set of terminal positions $(x,y)$ satisfy $x+y\le\ell$. The use of Walnut in combinatorial game theory is relatively recent, and only a few examples have been explored so far. The Wythoff game, being directly connected to the Fibonacci numeration system, proves especially well-suited to this kind of approach. It permits us to solve instances for a fixed value of a parameter.Open AccessVariants of Wythoff game with terminal positions or blocking maneuvers
We show how the software Walnut can be used to obtain concise proofs of results concerning variants of the famous Wythoff game, in which blocking maneuvers or terminal positions are added, as discussed respectively by Larsson (2011) and Komak et al. (2025). Our approach provides automatic proofs that both confirm and extend their results, and the same techniques apply to newly introduced variants as well. Then, using classic techniques, we obtain new recursive and morphic characterizations of Wythoff-type games where the set of terminal positions $(x,y)$ satisfy $x+y\le\ell$. The use of Walnut in combinatorial game theory is relatively recent, and only a few examples have been explored so far. The Wythoff game, being directly connected to the Fibonacci numeration system, proves especially well-suited to this kind of approach. It permits us to solve instances for a fixed value of a parameter. - 18 September 2025
- Published by Springer Nature in International Journal of Game Theory
- Vol. 54 (2) , 1-32
Automatic proofs in combinatorial game theory
- 18 September 2025
- Published by Springer Nature in International Journal of Game Theory
- Vol. 54 (2) , 1-32
Automatic proofs in combinatorial game theory
- 1 March 2025
- Published by Springer Nature in Journal of Algebraic Combinatorics
- Vol. 61 (2) , 1-33
Introducing q-deformed binomial coefficients of words
- 1 March 2025
- Published by Springer Nature in Journal of Algebraic Combinatorics
- Vol. 61 (2) , 1-33
Introducing q-deformed binomial coefficients of words
- 7 January 2025
- Published by Elsevier in Discrete Mathematics
- Vol. 348 (5)
q-Parikh matrices and q-deformed binomial coefficients of words
- 7 January 2025
- Published by Elsevier in Discrete Mathematics
- Vol. 348 (5)
q-Parikh matrices and q-deformed binomial coefficients of words
- Open Access
q-Parikh Matrices and q-deformed binomial coefficients of words
We have introduced a q-deformation, i.e., a polynomial in q with natural coefficients, of the binomial coefficient of two finite words u and v counting the number of occurrences of v as a subword of u. In this paper, we examine the q-deformation of Parikh matrices as introduced by Eğecioğlu in 2004. Many classical results concerning Parikh matrices generalize to this new framework: Our first important observation is that the elements of such a matrix are in fact q-deformations of binomial coefficients of words. We also study their inverses and as an application, we obtain new identities about q-binomials. For a finite word z and for the sequence $(p_n)_{n\ge 0}$ of prefixes of an infinite word, we show that the polynomial sequence $\binom{p_n}{z}_q$ converges to a formal series. We present links with additive number theory and k-regular sequences. In the case of a periodic word $u^ω$, we generalize a result of Salomaa: the sequence $\binom{u^n}{z}_q$ satisfies a linear recurrence relation with polynomial coefficients. Related to the theory of integer partition, we describe the growth and the zero set of the coefficients of the series associated with $u^ω$. Finally, we show that the minors of a q-Parikh matrix are polynomials with natural coefficients and consider a generalization of Cauchy's inequality. We also compare q-Parikh matrices associated with an arbitrary word with those associated with a canonical word $12\cdots k$ made of pairwise distinct symbols.Open Accessq-Parikh Matrices and q-deformed binomial coefficients of words
We have introduced a q-deformation, i.e., a polynomial in q with natural coefficients, of the binomial coefficient of two finite words u and v counting the number of occurrences of v as a subword of u. In this paper, we examine the q-deformation of Parikh matrices as introduced by Eğecioğlu in 2004. Many classical results concerning Parikh matrices generalize to this new framework: Our first important observation is that the elements of such a matrix are in fact q-deformations of binomial coefficients of words. We also study their inverses and as an application, we obtain new identities about q-binomials. For a finite word z and for the sequence $(p_n)_{n\ge 0}$ of prefixes of an infinite word, we show that the polynomial sequence $\binom{p_n}{z}_q$ converges to a formal series. We present links with additive number theory and k-regular sequences. In the case of a periodic word $u^ω$, we generalize a result of Salomaa: the sequence $\binom{u^n}{z}_q$ satisfies a linear recurrence relation with polynomial coefficients. Related to the theory of integer partition, we describe the growth and the zero set of the coefficients of the series associated with $u^ω$. Finally, we show that the minors of a q-Parikh matrix are polynomials with natural coefficients and consider a generalization of Cauchy's inequality. We also compare q-Parikh matrices associated with an arbitrary word with those associated with a canonical word $12\cdots k$ made of pairwise distinct symbols.