Related papers: Long relators in groups generated by two parabolic…
Lists of equivalence classes of words under rotation or rotation plus reversal (i.e., necklaces and bracelets) have many uses, and efficient algorithms for generating these lists exist. In combinatorial group theory elements of a group are…
To any family of languages LAN, let us associate the class, denoted $\pi(\text{LAN})$, of finitely generated groups that admit a group presentation whose set of relators forms a language in LAN. We show that the class of L-presented groups,…
A generating set $S$ for a group $G$ is independent if the subgroup generated by $S\setminus \{s\}$ is properly contained in $G$, for all $s \in S.$ In this paper, we study a problem proposed by Peter Glasby: we investigate finite groups,…
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…
We produce new short laws in two variables valid in finite groups of Lie type. Our result improves upon results of Kozma and the second named author, and is sharp up to logarithmic factors, for all families except possibly the Suzuki…
For the free group $F_r$ on $r>1$ generators (respectively, the free product $G_1 * G_2$ of two nontrivial finite groups $G_1$ and $G_2$), we obtain the asymptotic for the number of conjugacy classes of commutators in $F_r$ (respectively,…
We prove that a semigroup generated by a reversible two-state Mealy automaton is either finite or free of rank 2. This fact leads to the decidability of finiteness for groups generated by two-state or two-letter invertible-reversible Mealy…
Retrieval-Augmented Generation (RAG) is a framework in which a Generator, such as a Large Language Model (LLM), produces answers by retrieving documents from an external collection using a Retriever. In practice, Generators must integrate…
A quasi-automatic semigroup is defined by a finite set of generators, a rational (regular) set of representatives, such that if a is a generator or neutral, then the graph of right multiplication by a on the set of representatives is a…
We show that there is an order-preserving embedding of the additive group of rational numbers $\mathbb{Q}$ into a 2-generator group $G$. The group $G$ can be chosen to be a solvable group $G$ of length 3, which is a minimal result in the…
A relative one-relator presentation has the form P = < X,H ; R > where X is a set, H is a group, and R is a group word on X and H. We show that if the group word on X obtained from R by deleting all the terms from H has what we call the…
In this paper we explore the connections between the class of Visibly Pushdown Languages ($\mathbf{VPL}$) and the natural sets of words one can associate to a finitely generated group. We show that the word problem of a finitely generated…
We study the positive theory of groups acting on trees and show that under the presence of weak small cancellation elements, the positive theory of the group is trivial, i.e. coincides with the positive theory of a non-abelian free group.…
Let G be a finite group with Sylow p-subgroup P. We show that the character table of G determines whether P has maximal nilpotency class and whether P is a minimal non-abelian group. The latter result is obtained from a precise…
A finitely generated group is lacunary hyperbolic if one of its asymptotic cones is an $\mathbb{R}$-tree. In this article we give a necessary and sufficient condition on lacunary hyperbolic groups in order to be stable under free product by…
A group has finite palindromic width if there exists $n$ such that every element can be expressed as a product of $n$ or fewer palindromic words. We show that if $G$ has finite palindromic width with respect to some generating set, then so…
The Aristotelian syllogistic cannot account for the validity of many inferences involving relational facts. In this paper, we investigate the prospects for providing a relational syllogistic. We identify several fragments based on (a)…
In this article, we provide three generators of propositional formulae for arbitrary languages, which uniformly sample three different formulae spaces. They take the same three parameters as input, namely, a desired depth, a set of atomics…
Logics with team semantics provide alternative means for logical characterization of complexity classes. Both dependence and independence logic are known to capture non-deterministic polynomial time, and the frontiers of tractability in…
We introduce and study some families of groups whose irreducible characters take values on quadratic extensions of the rationals. We focus mostly on a generalization of inverse semi-rational groups, which we call uniformly semi-rational…