相关论文: Stable Invariants of Words from Random Matrices

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…

We investigate the lattice of machine invariant classes. This is an infinite completely distributive lattice but it is not a Boolean lattice. We show the subword complexity and the growth function create machine invariant classes. So the…

In this paper, we study a class of cellular automata (CA) called stable cellular automata (SCA) that preserve stability by reflection, modulo-recurrent, and richness. After applying these automata to Sturmian words, we determine some of…

We establish a spectral gap for stable commutator length (scl) of integral chains in right-angled Artin groups (RAAGs). We show that this gap is not uniform, i.e. there are RAAGs and integral chains with scl arbitrarily close to zero. We…

Let $w$ be a word in the free group of rank $n \in \mathbb{N}$ and let $\mathcal{V}(w)$ be the variety of groups defined by the law $w=1$. Define $\mathcal{V}(w^*)$ to be the class of all groups $G$ in which for any infinite subsets $X_1,…

The availability of large linguistic data sets enables data-driven approaches to study linguistic change. The Google Books corpus unigram frequency data set is used to investigate the word rank dynamics in eight languages. We observed the…

In this paper, we prove several stability theorems for multiplicities of naturally defined representations of symmetric groups. The first such theorem states that if we consider the diagonal action of the symmetric group $S_{m+r}$ on $k$…

We investigate the relationship between various isomorphism invariants for finite groups. Specifically, we use the Weisfeiler-Leman dimension (WL) to characterize, compare and quantify the effectiveness and complexity of invariants for…

A Sturmian word is a map W from the natural numbers into {0,1} for which the set of {0,1}-vectors F_n(W):={(W(i),W(i+1),...,W(i+n-1))^T : i \ge 0} has cardinality exactly n+1 for each positive integer n. Our main result is that the volume…

Given a group-word w and a group G, the verbal subgroup w(G) is the one generated by all w-values in G. The word w is called concise if w(G) is finite whenever the set of w-values in G is finite. It is an open question whether every word is…

We study inert, and ambiguous conjugacy classes in the modular group $\mathrm{PSL}(2,\mathbb{Z})$ from a purely combinatorial perspective. Using word length in the free product representation $\mathbb{Z}_2 * \mathbb{Z}_3$ of the modular…

We consider word complexity and topological entropy for random substitution subshifts. In contrast to previous work, we do not assume that the underlying random substitution is compatible. We show that the subshift of a primitive random…

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…

The word problem for discrete groups is well-known to be undecidable by a Turing Machine; more precisely, it is reducible both to and from and thus equivalent to the discrete Halting Problem. The present work introduces and studies a real…

We study a class of inverse monoids of the form M = Inv< X | w=1 >, where the single relator w has a combinatorial property that we call sparse. For a sparse word w, we prove that the word problem for M is decidable. We also show that the…

Recently, we have classified Hermitian random matrix ensembles that are invariant under the conjugate action of the unitary group and stable with respect to matrix addition. Apart from a scaling and a shift, the whole information of such an…

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…

Sentence formation is a highly structured, history-dependent, and sample-space reducing (SSR) process. While the first word in a sentence can be chosen from the entire vocabulary, typically, the freedom of choosing subsequent words gets…

We compute spectra of large stochastic matrices $W$, defined on sparse random graphs, where edges $(i,j)$ of the graph are given positive random weights $W_{ij}>0$ in such a fashion that column sums are normalized to one. We compute spectra…

Given a group-word w and a group G, the verbal subgroup w(G) is the one generated by all w-values in G. The word w is said to be concise if w(G) is finite whenever the set of w-values in G is finite. In the sixties P. Hall asked whether…