Related papers: The modular group and words in its two generators
Two finite words $u$ and $v$ are called Abelian equivalent if each letter occurs equally many times in both $u$ and $v$. The abelian closure $\mathcal{A}(\mathbf{x})$ of (the shift orbit closure of) an infinite word $\mathbf{x}$ is the set…
We show that for any positive integer $m\ge 1$, $m$-relator quotients of the modular group $M = PSL(2,\mathbb{Z})$ generically satisfy a very strong Mostow-type \emph{isomorphism rigidity}. We also prove that such quotients are generically…
In this paper we present a new compact expression of the elliptic genus of SL(2)/U(1)-supercoset theory by making use of the `spectral flow method' of the path-integral evaluation. This new expression is written in a form like a Poincare…
A regular continuant is the denominator $K$ of a terminating regular continued fraction, interpreted as a function of the partial quotients. We regard $K$ as a function defined on the set of all finite words on the alphabet $1<2<3<\dots$…
A subsequence of a word $w$ is a word $u$ such that $u = w[i_1] w[i_2] \cdots w[i_k]$, for some set of indices $1 \leq i_1 < i_2 < \dots < i_k \leq \vert w \vert$. A word $w$ is \emph{$k$-subsequence universal} over an alphabet $\Sigma$ if…
Given a finite word u, we define its palindromic length |u|_{pal} to be the least number n such that u=v_1v_2... v_n with each v_i a palindrome. We address the following open question: Does there exist an infinite non ultimately periodic…
A known result for the finite general linear group $\GL(n,\FF_q)$ and for the finite unitary group $\U(n,\FF_{q^2})$ posits that the sum of the irreducible character degrees is equal to the number of symmetric matrices in the group. Fulman…
After 100 years of effort, the classification of all the finite subgroups of SU(3) is yet incomplete. The most recently updated list can be found in P.O. Ludl, J. Phys. A: Math. Theor. 44 255204 (2011), where the structure of the series (C)…
We investigate the number of sets of words that can be formed from a finite alphabet, counted by the total length of the words in the set. An explicit expression for the counting sequence is derived from the generating function, and…
An algebra is finitely related (or has finite degree) if its term functions are determined by some finite set of finitary relations. Nilpotent monoids built from words, via Rees quotients of free monoids, have been used to exhibit many…
A numerical semigroup $S$ is a subset of the non-negative integers containing $0$ that is closed under addition. The Hilbert series of $S$ (a formal power series equal to the sum of terms $t^n$ over all $n \in S$) can be expressed as a…
We consider the following problem. Let us fix a finite alphabet A; for any given d-uple of letter frequencies, how to construct an infinite word u over the alphabet A satisfying the following conditions: u has linear complexity function, u…
We introduce the notion of expandability in the context of automaton semigroups and groups: a word is k-expandable if one can append a suffix to it such that the size of the orbit under the action of the automaton increases by at least k.…
In this note we prove an integral identity involving complex powers of generators of quantum group $U_{q}(\mathfrak{sl}(3))$ considered as certain positive operators in the setting of positive principal series representations. This identity…
Given a finitely generated group with generating set $S$, we study the \emph{cogrowth} sequence, which is the number of words of length $n$ over the alphabet $S$ that are equal to one. This is related to the probability of return for walks…
The polynomial deformations of the Witten extensions of the U(su(2)) and U(osp(1,2)) algebras are three generator algebras with normal ordering, admitting a two generator subalgebra. The modules and the representations of these algebras are…
Vincular or dashed patterns resemble classical patterns except that some of the letters within an occurrence are required to be adjacent. We prove several infinite families of Wilf-equivalences for k-ary words involving vincular patterns…
For a function algebra A we investigate relations between the following three topics: isomorphisms of singly generated A-modules, Morita equivalence bimodules, and `real harmonic functions' with respect to A. We also consider certain groups…
The \emph{word problem} of a group $G = \langle \Sigma \rangle$ can be defined as the set of formal words in $\Sigma^*$ that represent the identity in $G$. When viewed as formal languages, this gives a strong connection between classes of…
A cylinder $C^1_u$ is the set of infinite words with fixed prefix $u$. A double-cylinder $C^2_{[1,u]}$ is "the same" for bi-infinite words. We show that for every word $u$ and any automorphism $\varphi$ of the free group $F$ the image…