Related papers: Morphic and Automatic Words: Maximal Blocks and Di…

Given a totally finite ordered alphabet $ A $, endowing the set of words over $ A $ with the alternating lexicographic order, we define a new class of Lyndon words. We study the fundamental properties of the associated symbolic dynamical…

We prove that the subvariety of $SL(2)\times SL(2)$ given by the matrix equation $w(X,Y)=\alpha$, where $w$ is a word in two letters, is closely related to an explicit smooth conic bundle over the associated `trace surface' in the…

A finite word $w$ is called \emph{rich} if it contains $\vert w\vert+1$ distinct palindromic factors including the empty word. Let $q\geq 2$ be the size of the alphabet. Let $R(n)$ be the number of rich words of length $n$. Let $d>1$ be a…

The approximation of natural numbers subsets has always been one of the fundamental issues in computability theory. Computable approximation, $\Delta_2$-approximation, as well as introducing the generically computable sets have been some…

We prove several asymptotic results for partial and false theta functions arising from Jacobi forms, as the modular variable $\tau$ tends to $0$ along the imaginary axis, and the elliptic variable $z$ is unrestricted in the complex plane.…

A graph $G = (V, E)$ is word-representable if there exists a word $w$ over the alphabet $V$ such that, for any two distinct vertices $x, y \in V$, $xy \in E$ if and only if $x$ and $y$ alternate in $w$. Two letters $x$ and $y$ are said to…

A finite word $w$ of length $n$ contains at most $n+1$ distinct palindromic factors. If the bound $n+1$ is attained, the word $w$ is called rich. An infinite word $w$ is called rich if every finite factor of $w$ is rich. Let $w$ be a word…

We consider partial symmetric Toeplitz matrices where a positive definite completion exists. We characterize those patterns where the maximum determinant completion is itself Toeplitz. We then extend these results with positive definite…

Given an $n\times n$ symmetric matrix $W\in [0,1]^{[n]\times [n]}$, let $\mathcal{G}(n,W)$ be the random graph obtained by independently including each edge $jk$ with probability $W_{jk}$. Given a degree sequence ${\bf d}=(d_1,\ldots,…

We give a new characterization of primitive permutation groups tied to the notion of completely reachable automata. Also, we introduce sync-maximal permutation groups tied to the state complexity of the set of synchronizing words of certain…

Consider the space of sequences of k letters ordered lexicographically. We study the set M({\alpha}) of all maximal sequences for which the asymptotic proportions {\alpha} of the letters are prescribed, where a sequence is said to be…

We introduce a novel decidable fragment of first-order logic. The fragment is one-dimensional in the sense that quantification is limited to applications of blocks of existential (universal) quantifiers such that at most one variable…

We show that every automorphism $\alpha$ of a free group $F_k$ of finite rank $k$ has {\it asymptotically periodic} dynamics on $F_k$ and its boundary $\partial F_k$: there exists a positive power $\alpha^q$ such that every element of the…

This article fits in the area of research that investigates the application of topological duality methods to problems that appear in theoretical computer science. One of the eventual goals of this approach is to derive results in…

We study the triplet vertex operator algebra $\mathcal{W}(p)$ of central charge $1-\frac{6(p-1)^2}{p}$, $p \geq 2$. We show that $\trip$ is $C_2$-cofinite but irrational since it admits indecomposable and logarithmic modules. Furthermore,…

Fix a finite field $K$ of order $q$ and a word $w$ in a free group $F$ on $r$ generators. A $w$-random element in $GL_N(K)$ is obtained by sampling $r$ independent uniformly random elements $g_1,\ldots,g_r\in GL_N(K)$ and evaluating…

Let $A$ be a finite or countable alphabet and let $\theta$ be literal (anti)morphism onto $A^*$ (by definition, such a correspondence is determinated by a permutation of the alphabet). This paper deals with sets which are invariant under…

Logics and automata models for languages over infinite alphabets, such as Freeze LTL and register automata, serve the verification of processes or documents with data. They relate tightly to formalisms over nominal sets, such as…

A systematic study is made, for an arbitrary finite relational language with at least one symbol of arity at least 2, of classes of nonrigid finite structures. The well known results that almost all finite structures are rigid and that the…

$\Omega$-automata and Wilke algebras are formalisms for characterising $\omega$-regular languages via their ultimately periodic words. $\Omega$-automata read finite representations of ultimately periodic words, called lassos, and they are a…