English
Related papers

Related papers: The modular group and words in its two generators

200 papers

Let $S=\langle a_1,\ldots,a_p\rangle$ be a numerical semigroup, $s\in S$ and ${\sf z}(s)$ its set of factorizations. The set of length is denoted by ${\mathcal L}(s)=\{{\tt L}(x_1,\dots,x_p)\mid (x_1,\dots,x_p)\in{\sf Z}(s)\}$ where ${\tt…

Commutative Algebra · Mathematics 2019-06-05 J. I. García-García , D. Marín-Aragón , A. Vigneron-Tenorio

We count the finitely generated subgroups of the modular group $\textsf{PSL}(2,\mathbb{Z})$. More precisely: each such subgroup $H$ can be represented by its Stallings graph $\Gamma(H)$, we consider the number of vertices of $\Gamma(H)$ to…

Group Theory · Mathematics 2022-01-03 Frédérique Bassino , Cyril Nicaud , Pascal Weil

A universal word (u-word) for $d$-dimensional permutations of length $n$ is a 2-dimensional word with $d-1$ rows, any size $n$ window of which is order-isomorphic to exactly one permutation of length $n$, and all permutations of length $n$…

Combinatorics · Mathematics 2026-03-03 Sergey Kitaev , Dun Qiu

Large language models (LLMs) take sequences of subwords as input, requiring them to effective compose subword representations into meaningful word-level representations. In this paper, we present a comprehensive set of experiments to probe…

Computation and Language · Computer Science 2025-08-26 Qiwei Peng , Yekun Chai , Anders Søgaard

A factorization of an element $x$ in a monoid $(M, \cdot)$ is an expression of the form $x = u_1^{z_1} \cdots u_k^{z_k}$ for irreducible elements $u_1, \ldots, u_k \in M$, and the length of such a factorization is $z_1 + \cdots + z_k$. We…

We introduce a new family of C_2-cofinite N=1 vertex operator superalgebras SW(m), $m \geq 1$, which are natural super analogs of the triplet vertex algebra family W(p), $p \geq 2$, important in logarithmic conformal field theory. We…

Quantum Algebra · Mathematics 2009-04-17 Drazen Adamovic , Antun Milas

We construct an extension $E(A,G)$ of a given group $G$ by infinite non-Archimedean words over an discretely ordered abelian group like $Z^n$. This yields an effective and uniform method to study various groups that "behave like $G$". We…

Group Theory · Mathematics 2011-02-08 Volker Diekert , Alexei Myasnikov

A word $u=u_1\dots u_n$ is a scattered factor of a word $w$ if $u$ can be obtained from $w$ by deleting some of its letters: there exist the (potentially empty) words $v_0,v_1,..,v_n$ such that $w = v_0u_1v_1...u_nv_n$. The set of all…

Formal Languages and Automata Theory · Computer Science 2020-03-11 Laura Barker , Pamela Fleischmann , Katharina Harwardt , Florin Manea , Dirk Nowotka

A {\it $k$-involution} is an involution with a fixed point set of codimension $k$. The conjugacy class of such an involution, denoted $S_k$, generates $\text{M\"ob}(n)$-the the group of isometries of hyperbolic $n$-space-if $k$ is odd, and…

Group Theory · Mathematics 2010-12-30 Ara Basmajian , Karan Puri

We consider several vertex operator (super)algebras closely related to $V_{-1}(\frak{sl} (n) )$, $n \ge 3$ : (a) the parafermionic subalgebra $K(\frak{sl}(n),-1)$ for which we completely describe its inner structure, (b) the vacuum algebra…

Quantum Algebra · Mathematics 2018-10-03 Drazen Adamovic , Antun Milas

For a unital ring $S$, an $S$-linear quasigroup is a unital $S$-module, with automorphisms $\rho$ and $\lambda$ giving a (nonassociative) multiplication $x\cdot y=x^\rho+y^\lambda$. If $S$ is the field of complex numbers, then ordinary…

Group Theory · Mathematics 2019-10-23 Jonathan D. H. Smith , Stefanie G. Wang

In the free group $F_k$, an element is said to be primitive if it belongs to a free generating set. In this paper, we describe what a generic primitive element looks like. We prove that up to conjugation, a random primitive word of length…

Group Theory · Mathematics 2014-10-24 Doron Puder , Conan Wu

We prove that outer commutator words are uniformly concise, i.e. if an outer commutator word w takes m different values in a group G, then the order of the verbal subgroup w(G) is bounded by a function depending only on m and not on w or G.…

Group Theory · Mathematics 2014-02-26 Gustavo A. Fernández-Alcober , Marta Morigi

Following Inoue et al., we define a word to be a repetition if it is a (fractional) power of exponent at least 2. A word has a repetition factorization if it is the product of repetitions. We study repetition factorizations in several…

Formal Languages and Automata Theory · Computer Science 2023-11-30 Jeffrey Shallit , Xinhao Xu

In this paper we study generating functions resembling the rank of strongly unimodal sequences. We give combinatorial interpretations, identities in terms of mock modular forms, asymptotics, and a parity result. Our functions imitate a…

Number Theory · Mathematics 2019-06-24 Kathrin Bringmann , Chris Jennings-Shaffer

Partial words are sequences over a finite alphabet that may contain wildcard symbols, called holes, which match or are compatible with all letters; partial words without holes are said to be full words (or simply words). Given an infinite…

Discrete Mathematics · Computer Science 2011-08-19 Francine Blanchet-Sadri , Aleksandar Chakarov , Lucas Manuelli , Jarett Schwartz , Slater Stich

We show how to count and randomly generate finitely generated subgroups of the modular group $\textsf{PSL}(2,\mathbb{Z})$ of a given isomorphism type. We also prove that almost malnormality and non-parabolicity are negligible properties for…

Group Theory · Mathematics 2021-03-01 Frédérique Bassino , Cyril Nicaud , Pascal Weil

Let $G$ be a locally compact group, $L(G)$ be its group von Neumann algebra equipped with the Plancherel weight $\varphi_G$. In this paper, we consider the following two questions. (1) When is the restriction of $\varphi_G$ to the…

Operator Algebras · Mathematics 2025-09-19 Yuki Miyamoto

We say that two finite words $u$ and $v$ are abelian equivalent if and only if they have the same number of occurrences of each letter, or equivalently if they define the same Parikh vector. In this paper we investigate various abelian…

Combinatorics · Mathematics 2009-04-21 Gwénaël Richomme , Kalle Saari , Luca Q. Zamboni

We study the language-theoretic aspects of the word problem, in the sense of Duncan & Gilman, of free products of semigroups and monoids. First, we provide algebraic tools for studying classes of languages known as super-AFLs, which…

Group Theory · Mathematics 2021-12-21 Carl-Fredrik Nyberg-Brodda
‹ Prev 1 3 4 5 6 7 10 Next ›