SearcharxivSearch

arXiv subjects

Christophe Reutenauer

Publications and source records attributed to Christophe Reutenauer.

At least 19 recordsLinked to original sources

Pairs of intertwined integer sequences

In previous work we computed the number $C_n(q)$ of ideals of codimension $n$ of the algebra ${\mathbb{F}}_q[x,y,x^{-1}, y^{-1}]$ of two-variable Laurent polynomials over a finite field: it turned out that $C_n(q)$ is a palindromic polynomial of degree $2n$ in $q$, divisible by $(q-1)^2$. The quotient $P_n(q) = C_n(q)/(q-1)^2$ is a palindromic polynomial of degree $2n-2$. For each $n\geq 1$ let ${\overline{P}}_n(X) \in {\mathbb{Z}}[X]$ be the degree $n-1$ polynomial such that ${\overline{P}}_n(q+q^{-1}) = P_n(q)/q^{n-1}$. In this note we show that for any integer $N$ the integer value ${\overline{P}}_n(N)$ is close to the value at $N$ of the degree $n-1$ polynomial $F_{n-1}(X) = 1 + \sum_{k=1}^{n-1} \, {\overline{T}}_k(X)$, which is a sum of monic versions ${\overline{T}}_k(X)$ of Chebyshev polynomials of the first kind. We give a precise formula for ${\overline{P}}_n(X)$ as a linear combination of $F_k(X)$'s, each appearance of the latter being parametrized by an odd divisor of $n$. As a consequence, ${\overline{P}}_n(X) = F_{n-1}(X)$ if and only if $n$ is a power of $2$. We exhibit similar formulas for $C_n(q)$.

math.NT

Christoffel Matrices and Sturmian Determinants

We discuss certain matrices associated with Christoffel words, and show that they have a group structure. We compute their determinants and show a relationship between the Zolotareff symbol from number theory.

math.CO

Characterizations of Perfectly Clustering Words

Perfectly clustering words are one of many possible generalizations of Christoffel words. In this article, we propose a factorization of a perfectly clustering word on a $n$ letters alphabet into a product of $n-1$ palindromes with a letter between each of them. This factorization allows us to generalize two combinatorial characterization of Christoffel words due to Pirillo (1999) and de Luca and Mignosi (1994).

math.CO

A Symmetry Property of Christoffel Words

Motivated by the theory of trapezoidal words, whose sequences of cardinality of factors by length are symmetric, we introduce a bivariate variant of this symmetry. We show that this symmetry characterizes Christoffel words, and establish other related results.

math.CO

Quivers of stylic algebras

We construct a complete system of primitive orthogonal idempotents and give an explicit quiver presentation of the monoid algebra of the stylic monoid introduced by Abram and Reutenauer [arXiv:2106.06556].

math.RT

On a Lemma of Schensted

We give a direct proof of Schensted's lemma asserting that row and column insertion in a tableau commute.

math.CO

The palindromization map

The palindromization map has been defined initially by Aldo de Luca in the context of Sturmian words. It was extended to the free group of rank $2$ by Kassel and the second autho We extend their construction to arbitrary alphabets. We also investigate the suffix automaton and compact suffix automaton of the words obtained by palindromization.

math.CO

The Stylic Monoid

The free monoid $A^*$ on a finite totally ordered alphabet $A$ acts at the left on columns, by Schensted left insertion. This defines a finite monoid, denoted $Styl(A)$ and called the stylic monoid. It is canonically a quotient of the plactic monoid. Main results are: the cardinality of $Styl(A)$ is equal to the number of partitions of a set on $|A|+1$ elements. We give a bijection with so-called $N$-tableaux, similar to Schensted's algorithm, explaining this fact. Presentation of $Styl(A)$: it is generated by $A$ subject to the plactic (Knuth) relations and the idempotent relations $a^2=a$, $a\in A$. The canonical involutive anti-automorphism on $A^*$, which reverses the order on $A$, induces an involution of $Styl(A)$, which similarly to the corresponding involution of the plactic monoid, may be computed by an evacuation-like operation (Schützenberger involution on tableaux) on so-called standard immaculate tableaux (which are in bijection with partitions). The monoid $Styl(A)$ is $J$-trivial, and the $J$-order of $Styl(A)$ is graded: the co-rank is given by the number of elements in the $N$-tableau. The monoid $Styl(A)$ is the syntactic monoid for the the function which associates to each word $w\in A^*$ the length of its longest strictly decreasing subword.

math.CO

An order on circular permutations

Motivation coming from the study of affine Weyl groups, a structure of ranked poset is defined on the set of circular permutations in $S_n$ (that is, $n$-cycles). It is isomorphic to the poset of so-called admitted vectors, and to an interval in the affine symmetric group $\tilde S_n$ with the weak order. The poset is a semidistributive lattice, and the rank function, whose range is cubic in $n$, is computed by some special formula involving inversions. We prove also some links with Eulerian numbers, triangulations of an $n$-gon, and Young's lattice.

math.CO

Primitive Elements of the Hopf Algebras of Tableaux

The character theory of symmetric groups, and the theory of symmetric functions, both make use of the combinatorics of Young tableaux, such as the Robinson-Schensted algorithm, Schuetzenberger's "jeu de taquin", and evacuation. In 1995 Poirier and the second author introduced some algebraic structures, different from the plactic monoid, which induce some products and coproducts of tableaux, with homomorphisms. Their starting point are the two dual Hopf algebras of permutations, introduced by the authors in 1995. In 2006 Aguiar and Sottile studied in more detail the Hopf algebra of permutations: among other things, they introduce a new basis, by Moebius inversion in the poset of weak order, that allows them to describe the primitive elements of the Hopf algebra of permutations. In the present note, by a similar method, we determine the primitive elements of the Poirier-Reutenauer algebra of tableaux, using a partial order on tableaux defined by Taskin.

math.CO

Quasi-automatic semigroups

A quasi-automatic semigroup is defined by a finite set of generators, a rational (regular) set of representatives, such that if a is a generator or neutral, then the graph of right multiplication by a on the set of representatives is a rational relation. This class of semigroups contains previously considered semigroups and groups (Sakarovitch, Epstein et al., Campbell et al.). Membership of a semigroup to this class does not depend on the choice of the generators. These semigroups are rationally presented. Representatives may be computed in exponential time. Their word problem is decidable in exponential time. They enjoy a property similar to the so-called Lipschitz property, or fellow traveler property. If graded, they are automatic. In the case of groups, they are finitely presented with an exponential isoperimetric inequality and they are characterized by the weak Lipschitz property.

math.GR

Some variations on Lyndon words

In this paper we compare two finite words $u$ and $v$ by the lexicographical order of the infinite words $u^ω$ and $v^ω$. Informally, we say that we compare $u$ and $v$ by the infinite order. We show several properties of Lyndon words expressed using this infinite order. The innovative aspect of this approach is that it allows to take into account also non trivial conditions on the prefixes of a word, instead that only on the suffixes. In particular, we derive a result of Ufnarovskij [V. Ufnarovskij, "Combinatorial and asymptotic methods in algebra", 1995] that characterizes a Lyndon word as a word which is greater, with respect to the infinite order, than all its prefixes. Motivated by this result, we introduce the prefix standard permutation of a Lyndon word and the corresponding (left) Cartesian tree. We prove that the left Cartesian tree is equal to the left Lyndon tree, defined by the left standard factorization of Viennot [G. Viennot, "Algèbres de Lie libres et monoïdes libres", 1978]. This result is dual with respect to a theorem of Hohlweg and Reutenauer [C. Hohlweg and C. Reutenauer, "Lyndon words, permutations and trees", 2003].

cs.DM

On generalized Lyndon words

A generalized lexicographical order on infinite words is defined by choosing for each position a total order on the alphabet. This allows to define generalized Lyndon words. Every word in the free monoid can be factorized in a unique way as a nonincreasing factorization of generalized Lyndon words. We give new characterizations of the first and the last factor in this factorization as well as new characterization of generalized Lyndon words. We also give more specific results on two special cases: the classical one and the one arising from the alternating lexicographical order.

cs.DM

Rational series in the free group and the Connes operator

We characterize rational series over the free group by using an operator introduced by A. Connes. We prove that rational Malcev--Neumann series posses rational expressions without simplifications. Finally, we develop an effective algorithm for solving the word problem in the free skew field.

math.CO

Birecurrent sets

A set is called recurrent if its minimal automaton is strongly connected and birecurrent if it is recurrent as well as its reversal. We prove a series of results concerning birecurrent sets. It is already known that any birecurrent set is completely reducible (that is, such that the minimal representation of its characteristic series is completely reducible). The main result of this paper characterizes completely reducible sets as linear combinations of birecurrent sets

cs.FL

Golden Ratio and Phyllotaxis, what is the mathematical link?

Exploiting Markoff's Theory for rational approximations of real numbers, we explicitly link how hard it is to approximate a given number to an idealized notion of growth capacity for plants which we express as a modular invariant function depending on this number. Assuming that our growth capacity is biologically relevant, this allows us to explain in a satisfying mathematical way why the golden ratio occurs in nature.

math.HO

Complete determination of the zeta function of the Hilbert scheme of $n$ points on a two-dimensional torus

We compute the coefficients of the polynomials $C_n(q)$ defined by the equation \begin{equation*} 1 + \sum_{n\geq 1} \, \frac{C_n(q)}{q^n} \, t^n = \prod_{i\geq 1}\, \frac{(1-t^i)^2}{1-(q+q^{-1})t^i + t^{2i}} \, . \end{equation*} As an application we obtain an explicit formula for the zeta function of the Hilbert scheme of $n$ points on a two-dimensional torus and show that this zeta function satisfies a remarkable functional equation. The polynomials $C_n(q)$ are divisible by $(q-1)^2$. We also compute the coefficients of the polynomials $P_n(q) = C_n(q)/(q-1)^2$: each coefficient counts the divisors of $n$ in a certain interval; it is thus a non-negative integer. Finally we give arithmetical interpretations for the values of $C_n(q)$ and of $P_n(q)$ at $q = -1$ and at roots of unity of order $3$, $4$, $6$.

math.NT