相关论文: Infinite smooth Lyndon words
After giving a short introduction on smooth lattice polytopes, I will present a proof for the finiteness of smooth lattice polytopes with few lattice points. The argument is then turned into an algorithm for the classification of smooth…
In this book chapter, written in French, we consider the classical family of Sturmian words, defined as the aperiodic infinite words containing only $n+1$ factors of a length $n$, which is the minimal possible value. We will discuss several…
We derive the unique continuation property of a class of semi-linear elliptic equations with non-Lipschitz nonlinearities. The simplest type of equations to which our results apply is given as $-\Delta u = |u|^{\sigma-1} u$ in a domain…
We consider $m\times n$ rectangular matrices formed from Sturmian words with slope $\alpha$, and we fully characterise their balance properties in terms of the Ostrowski representations of $m$ and $n$ with respect to $\alpha$. This…
In this paper, we consider infinite words that arise as fixed points of primitive substitutions on a finite alphabet and finite colorings of their factors. Any such infinite word exhibits a "hierarchal structure" that will allow us to…
Rich words are characterized by containing the maximum possible number of distinct palindromes. Several characteristic properties of rich words have been studied; yet the analysis of repetitions in rich words still involves some interesting…
It is shown that there exist finitely generated infinite simple groups of infinite commutator width and infinite square width on which there exists no stably unbounded conjugation-invariant norm, and in particular stable commutator length…
By extending a construction due to Gross and McMullen [2], we show that for any odd integer n and for any even integer d>n+2 there are infinitely many Salem numbers $\alpha$ of degree d such that $\alpha^n-1$ is a unit. A similar result is…
In this paper, we construct a uniformely recurrent infinite word of low complexity without uniform frequencies of letters. This shows the optimality of a bound of Boshernitzan, which gives a sufficient condition for a uniformly recurrent…
We investigate the variance of the length of the longest common subsequences of two independent random words of size $n$, where the letters of one word are i.i.d. uniformly drawn from $\{\alpha_1, \alpha_2, \cdots, \alpha_m\}$, while the…
We show that a certain class of fully nonlinear nonlocal equations have smooth solutions as long as the right-hand side is nice and the boundary datum is bounded. To this end we follow the classical strategy. We first show that solutions…
Over finite words, languages of dot-depth one are expressively complete for alternation-free first-order logic. This fragment is also known as the Boolean closure of existential first-order logic. Here, the atomic formulas comprise order,…
We consider the language of $\Delta_0$-formulas with list terms interpreted over hereditarily finite list superstructures. We study the complexity of reasoning in extensions of the language of $\Delta_0$-formulas with non-standard list…
We define a class of languages of infinite words over infinite alphabets, and the corresponding automata. The automata used for recognition are a generalisation of deterministic Muller automata to the setting of nominal sets. Remarkably,…
Richomme asked the following question: what is the infimum of the real numbers $\alpha$ > 2 such that there exists an infinite word that avoids $\alpha$-powers but contains arbitrarily large squares beginning at every position? We resolve…
The complexity of an infinite word can be measured in several ways, the two most common measures being the subword complexity and the abelian complexity. In 2015, Rigo and Salimov introduced a family of intermediate complexities indexed by…
We show that being finitely presentable and being finitely presentable with solvable word problem are quasi-isometry invariants of finitely generated left cancellative monoids. Our main tool is an elementary, but useful, geometric…
We consider the four fragments FO2, the intersection of Sigma2 and FO2, the intersection of Pi2 and FO2, and Delta2 of first-order logic FO[<] over finite and infinite words. For all four fragments, we give characterizations in terms of…
Given any $\mu_1, \mu_2\in {\mathbb C}$ and $\alpha >0$, we prove the local existence of arbitrarily smooth solutions of the nonlinear Klein-Gordon equation $\partial_{ tt } u - \Delta u + \mu_1 u = \mu_2 |u|^\alpha u$ on ${\mathbb R}^N$,…
The (-\beta)-integers are natural generalisations of the \beta-integers, and thus of the integers, for negative real bases. They can be described by infinite words which are fixed points of anti-morphisms. We show that they are not…