Related papers: Morphisms preserving the set of words coding three…
We investigate the avoidability of unary patterns of size of four with morphic permutations. More precisely, we show that, for the positive integers $i,j,k$, the sizes of the alphabets over which a pattern $x \pi ^ {i} (x) \pi^{j}(x)…
Circular words are cyclically ordered finite sequences of letters. We give a computer-free proof of the following result by Currie: square-free circular words over the ternary alphabet exist for all lengths $l$ except for 5, 7, 9, 10, 14,…
We present several enumeration results holding in sets of words called neutral and which satisfy restrictive conditions on the set of possible extensions of nonempty words. These formulae concern return words and bifix codes. They…
Denote by $\mathbb G(k,n)$ the Grassmannian of linear subspaces of dimension $k$ in $\mathbb P^n$. We show that if $n>m$ then every morphism $\varphi: \mathbb G(k,n) \to \mathbb G(l,m)$ is constant.
Let $\ell \geq 5$ be a prime, and let $\nu_\eta$ denote the Dedekind eta multiplier. For an odd integer $r$, and a real Dirichlet character $\psi$, recent work of Ahlgren, Andersen, and the author showed that quadratic congruences modulo…
We show that the permutation complexity of the image of a Sturmian word by a binary marked morphism is $n+k$ for some constant $k$ and all lengths $n$ sufficiently large.
The graphs with permutation-representation number (\textit{prn}) at most two are known. While a characterization for the class of graphs with the \textit{prn} at most three is an open problem, we summarize the graphs of this class that are…
A \emph{square} is a finite non-empty word consisting of two identical adjacent blocks. A word is \emph{square-free} if it does not contain a square as a factor. In any finite word one may delete the repeated block of a square, obtaining…
We study infinite words u over an alphabet A satisfying the property P : P(n)+ P(n+1) = 1+ #A for any n in N, where P(n) denotes the number of palindromic factors of length n occurring in the language of u. We study also infinite words…
In this paper we introduce and study a new property of infinite words: An infinite word $x\in A^\mathbb{N}$, with values in a finite set $A$, is said to be $k$-self-shuffling $(k\geq 2)$ if $x$ admits factorizations: $x=\prod_{i=0}^\infty…
This paper classifies binary morphisms that map to ultimately periodic words. In particular, if a morphism h maps an infinite non-ultimately periodic word to an ultimately periodic word then it must be true that h(0) commutes with h(1).
Any infinite uniformly recurrent word ${\bf u}$ can be written as concatenation of a finite number of return words to a chosen prefix $w$ of ${\bf u}$. Ordering of the return words to $w$ in this concatenation is coded by derivated word…
In this paper, we will give a natural definition for morphisms between multiplicative unitaries. We will then discuss some equivalences of this definition and some interesting properties of them. Moreover, we will define normal…
Triple periodic minimal surfaces (TPMS) have garnered significant interest due to their structural efficiency and controllable geometry, making them suitable for a wide range of applications. This paper investigates the relationships…
We give a new characterization of biinfinite Sturmian sequences in terms of indistinguishable asymptotic pairs. Two asymptotic sequences on a full $\mathbb{Z}$-shift are indistinguishable if the sets of occurrences of every pattern in each…
We introduce a class of fixed points of primitive morphisms among aperiodic binary generalized pseudostandard words. We conjecture that this class contains all fixed points of primitive morphisms among aperiodic binary generalized…
We analyze the constraint structure of a spin-3/2 particle interacting with a pseudoscalar. Requiring the self consistency of the considered effective field theory imposes restrictions on the possible interaction terms. In the present case…
In this paper, we investigate the combinatorial and density properties of infinite words generated by Fibonacci-type morphisms, focusing on their subword structure, palindrome density, and extremal statistical behaviors. Using the morphism…
We say that a finite factor $f$ of a word $w$ is \emph{imaged} if there exists a non-erasing morphism $m$, distinct from the identity, such that $w$ contains $m(f)$. We show that every infinite word contains an imaged factor of length at…
Let us call subdivision {\it good}, if 1) set corresponding to each symbol is convex (i.e. interval or (semi)closed interval). 2) If points $A$ and $B$ corresponds to the some color and interval $(A,B)$ has discontinuity point, then $f(A)$…