Related papers: Balanced words in higher dimensions
Large language models exhibit strong multilingual capabilities despite limited exposure to non-English data. Prior studies show that English-centric large language models map multilingual content into English-aligned representations at…
Brlek et al. (2008) studied smooth infinite words and established some results on letter frequency, recurrence, reversal and complementation for 2-letter alphabets having same parity. In this paper, we explore smooth infinite words over…
We study a deliberately simple, fully non-linguistic model of text: a sequence of independent draws from a finite alphabet of letters plus a single space symbol. A word is defined as a maximal block of non-space symbols. Within this…
A square-free word $w$ over a fixed alphabet $\Sigma$ is extremal if every word obtained from $w$ by inserting a single letter from $\Sigma$ (at any position) contains a square. Grytczuk et al. recently introduced the concept of extremal…
The Quadratic Density Hales Jewett conjecture with $2$ letters states that for large enough $n$, every dense subset of $\{0,1\}^{n^{2}}$ contains a combinatorial line where the wildcard set is of the form $\gamma \times \gamma$ where…
We consider arbitrary dense wireless networks, in which $n$ nodes are placed in an arbitrary (deterministic) manner on a square region of unit area and communicate with each other over Gaussian fading channels. We provide inner and outer…
Many complex generative systems use languages to create structured objects. We consider a model of random languages, defined by weighted context-free grammars. As the distribution of grammar weights broadens, a transition is found from a…
Two formalisms, both based on context-free grammars, have recently been proposed as a basis for a non-uniform random generation of combinatorial objects. The former, introduced by Denise et al, associates weights with letters, while the…
A generalized word in two letters $A$ and $B$ is an expression of the form $W=A^{\alpha_1}B^{\beta_1}A^{\alpha_2}B^{\beta_2}... A^{\alpha_N}B^{\beta_N}$ in which the exponents $\alpha_i$, $\beta_i$ are nonzero real numbers. When independent…
Large Language Models (LLMs) have shown remarkable abilities recently, including passing advanced professional exams and demanding benchmark tests. This performance has led many to suggest that they are close to achieving humanlike or…
We compute the exact maximum state complexity for the language consisting of $m$ words of length $N$, and characterize languages achieving the maximum. We also consider a special case, namely languages $C(w)$ consisting of the conjugates of…
We present a generalization of a known fact from combinatorics on words related to periodicity into quasiperiodicity. A string is called periodic if it has a period which is at most half of its length. A string $w$ is called quasiperiodic…
In this manuscript, we study a special class of correspondences on $\mathbb{P}^{1} \times \mathbb{P}^{1}$ given by a polynomial relation, say $P(z, w)$. We focus on what we call restrictive polynomial correspondence and characterise that it…
A word is level if each letter appears in it the same number of times, plus or minus 1. We give a complete characterization of the lengths for which level ternary circular square-free words exist. Key words: combinatorics on words, circular…
We show how to enumerate words in $1^{m_1} \dots n^{m_n}$ that avoid the increasing consecutive pattern $12 \dots r$ for any $r \geq 2$. Our approach yields an $O(n^{s+1})$ algorithm to enumerate words in $1^s \dots n^s$, avoiding the…
We refine Lagrange's four-square theorem in new ways by imposing some restrictions involving powers of two (including $1$). For example, we show that each $n=1,2,3,\ldots$ can be written as $x^2+y^2+z^2+w^2$ $(x,y,z,w\in\mathbb…
The Erd\H{o}s discrepancy problem, now a theorem by T. Tao, asks whether every sequence with values plus or minus one has unbounded discrepancy along all homogeneous arithmetic progressions. We establish weighted variants of this problem,…
We study the cycle structure of words in several random permutations. We assume that the permutations are independent and that their distribution is conjugation invariant, with a good control on their short cycles. If, after successive…
To any infinite word w over a finite alphabet A we can associate two infinite words min(w) and max(w) such that any prefix of min(w) (resp. max(w)) is the lexicographically smallest (resp. greatest) amongst the factors of w of the same…
In a recent comment, M. Kosterlitz described how the discrepancy about the lack of broken translational symmetry in two dimensions - doubting the existence of 2D crystals - and the first computer simulations foretelling 2D crystals at least…