相关论文: Word Length Perturbations in Certain Symmetric Pre…

We investigate the properties of word lengths of elements from a three-reflection symmetric generating set of the dihedral group $D_n$. Specifically, we provide the upper bound $\lambda_1(D_n,S) \leq \lfloor\frac{n}{2}\rfloor + 1$ for a…

Symmetry plays a fundamental role in understanding natural phenomena and mathematical structures. This work develops a comprehensive theory for studying the persistent symmetries and degree of asymmetry of finite point configurations over…

The stable torsion length in a group is the stable word length with respect to the set of all torsion elements. We show that the stable torsion length vanishes in crystallographic groups. We then give a linear programming algorithm to…

In this paper we investigate metric properties of the groups $\Gamma_d(q)$ whose Cayley graphs are the Diestel-Leader graphs $DL_d(q)$ with respect to a given generating set $S_{d,q}$. These groups provide a geometric generalization of the…

We study stable W-length in groups, especially for W equal to the n-fold commutator gamma_n:=[x_1,[x_2, . . . [x_{n-1},x_n]] . . . ]. We prove that in any perfect group, for any n at least 2 and any element g, the stable commutator length…

In this paper, we introduce a geometric statistic called the "sprawl" of a group with respect to a generating set, based on the average distance in the word metric between pairs of words of equal length. The sprawl quantifies a certain…

The power graph $\Gamma_G$ of a finite group $G$ is the graph with the vertex set $G$, where two distinct elements are adjacent if one is a power of the other. An $L(2, 1)$-labeling of a graph $\Gamma$ is an assignment of labels from…

We compute the expected number of commutations appearing in a reduced word for the longest element in the symmetric group. The asymptotic behavior of this value is analyzed and shown to approach the length of the permutation, meaning that…

A subset of a group is characteristic if it is invariant under every automorphism of the group. We study word length in fundamental groups of closed hyperbolic surfaces with respect to characteristic generating sets consisting of a finite…

We investigate translation length functions for two-generated groups acting by isometries on $\Lambda$-trees, where $\Lambda$ is a totally ordered abelian group. In this context, we provide an explicit formula for the translation length of…

Computational asymmetry, i.e., the discrepancy between the complexity of transformations and the complexity of their inverses, is at the core of one-way transformations. We introduce a computational asymmetry function that measures the…

Large Language Models (LLMs) have demonstrated impressive performance across a wide range of applications; however, assessing their reasoning capabilities remains a significant challenge. In this paper, we introduce a framework grounded in…

We study some combinatorial properties of the word metric of Thompson's group F in the standard two generator finite presentation. We explore connections between the tree pair diagram representing an element w of F, its normal form in the…

Permutations on a set, endowed with function composition, build a group called a symmetric group. In addition to their algebraic structure, symmetric groups have two metrics that are of particular interest to us here: the Cayley distance…

The palindromic length of a finite word $w$ is defined as the minimal number of palindromes such that their product is $w$. Clearly, this function may take different values depending on if we consider $w$ as an element a free semigroup or…

Let $\mathcal A$ be an $\mathbb F$-algebra and let $\mathcal S$ be its generating set. The length of $\mathcal S$ is the smallest number $k$ such that $\mathcal A$ equals the $\mathbb F$-linear span of all products of length at most $k$ of…

The usual way to investigate the statistical properties of finitely generated subgroups of free groups, and of finite presentations of groups, is based on the so-called word-based distribution: subgroups are generated (finite presentations…

Every finite group $G$ has a normal series each of whose factors is either a solvable group or a direct product of non-abelian simple groups. The minimum number of nonsolvable factors, attained on all possible such series in $G$, is called…

Lambda calculus is the basis of functional programming and higher order proof assistants. However, little is known about combinatorial properties of lambda terms, in particular, about their asymptotic distribution and random generation.…

Asymptotic properties of finitely generated subgroups of free groups, and of finite group presentations, can be considered in several fashions, depending on the way these objects are represented and on the distribution assumed on these…