Related papers: Words avoiding 7/3-powers and the Thue-Morse morph…
We say that a Lie (super)algebra is ''symmetric'' if with every root (with respect to the maximal torus) it has the opposite root of the same multiplicity. Over algebraically closed fields of positive characteristics (up to 7 or 11, enough…
We introduce the forward limit set $\Lambda$ of a semigroup $S$ generated by a family of substitutions of a finite alphabet, which typically coincides with the set of all possible s-adic limits of that family. We provide several alternative…
We present several examples of T^8/P orbifolds with $P \subset SU(4)$. We compute their Hodge numbers and consider turning on discrete torsion. We then study supersymmetric compactifications of type II, heterotic, and type I strings on…
We investigate different notions of recognizability for a free monoid morphism $\sigma: \mathcal{A}^* \to \mathcal{B}^*$. Full recognizability occurs when each (aperiodic) point in $\mathcal{B}^\mathbb{Z}$ admits at most one tiling with…
We show that the SO(3) monopole cobordism formula from Feehan and Leness (2002) implies that all smooth, closed, oriented four-manifolds with $b^1=0$ and $b^+\geq 3$ and odd with Seiberg-Witten simple type satisfy the superconformal simple…
Let $f_W(n)$ be the number of different factors of length $n$ appearing in $W$. A classical result of Morse and Hedlund, stated in 1938, asserts that an infinite word $W$ is ultimately periodic if and only if $f_W(n)\leq n$ for some $n\in…
We consider words coding exchange of three intervals with permutation (3,2,1), here called 3iet words. Recently, a characterization of substitution invariant 3iet words was provided. We study the opposite question: what are the morphisms…
We give a hyperelliptic formulation of the Ansatz of D'Hoker and Phong. We give an explicit family of binary invariants, one for each genus, that satisfies this hyperelliptic Ansatz. We also prove that this is the unique family of weight…
We prove that the `connective constant' for ternary square-free words is at least $2^{1/17} = 1.0416 ... $, improving on Brinkhuis and Brandenburg's lower bounds of $2^{1/24}=1.0293 ...$ and $2^{1/22}=1.032 ...$ respectively. This is the…
We investigate several questions related to the notion of recognizable morphism. The main result is a new proof of Moss\'e's theorem and actually of a generalization to non primitive morphisms due to Berth\'e et al. We actually prove the…
The first morphological learner based upon the theory of Whole Word Morphology Ford et al. (1997) is outlined, and preliminary evaluation results are presented. The program, Whole Word Morphologizer, takes a POS-tagged lexicon as input,…
We define invariants of braids rather than invariants of conjugacy classes of braids. For any pure three-braid we give effective upper and lower bounds for these invariants. This is done in terms of a natural syllable decomposition of the…
The Thue--Morse sequence is a prototypical automatic sequence found in diverse areas of mathematics, and in computer science. We study occurrences of factors $w$ within this sequence, more precisely, the sequence of gaps between consecutive…
We introduce and study two analogs of one of the best known sequence in Mathematics : Thue-Morse sequence. The first analog is concerned with the parity of number of runs of 1's in the binary representation of nonnegative integers. The…
Works of Hooley and Heath-Brown imply a near-optimal bound on the number $N$ of integral solutions to $x_1^3+\dots+x_6^3 = 0$ in expanding regions, conditional on automorphy and GRH for certain Hasse--Weil $L$-functions; for regions of…
For a rational number $r$ such that $1<r\leq 2$, an undirected $r$-power is a word of the form $xyx'$, where the word $x$ is nonempty, the word $x'$ is in $\{x,x^R\}$, and we have $|xyx'|/|xy|=r$. The undirected repetition threshold for $k$…
We tabulate bounds on the optimal number of mutually unbiased bases in R^d. For most dimensions d, it can be shown with relatively simple methods that either there are no real orthonormal bases that are mutually unbiased or the optimal…
We study word structures of the form $(D,<,P)$ where $D$ is either $\mathbb{N}$ or $\mathbb{Z}$, $<$ is the natural linear ordering on $D$ and $P\subseteq D$ is a predicate on $D$. In particular we show: (a) The set of recursive…
Let $q$ be a power of $2$ and let $\mathbb{F}_q$ be the finite field with $q$ elements. For a positive integer $n$, the polynomial $X^n-1\in\mathbb{F}_q[X]$ is called $3$-sparse over $\mathbb{F}_q$ if every monic irreducible factor of…
Improved upper and lower bounds on the number of square-free ternary words are obtained. The upper bound is based on the enumeration of square-free ternary words up to length 110. The lower bound is derived by constructing generalised…