Related papers: A Remark on "Counting primitive elements in free g…

Let $x$, $y$ be two integral quaternions of norm $p$ and $l$, respectively, where $p$, $l$ are distinct odd prime numbers. We investigate the structure of $<x,y>$, the multiplicative group generated by $x$ and $y$. Under a certain condition…

A group obtained from a nontrivial group by adding one generator and one relator which is a proper power of a word in which the exponent-sum of the additional generator is one contains the free square of the initial group and almost always…

We prove the existence of primitive sets (sets of integers in which no element divides another) in which the gap between any two consecutive terms is substantially smaller than the best known upper bound for the gaps in the sequence of…

We give an alternative proof to the theorem recently proved by Louvaris, Wise and Yehuda, that the growth rates of finitely generated subgroups of $F_r$ are dense in $[1,2r-1]$.

We compute the rate of exponential growth of the free inverse monoid of rank $r$ (and hence an upper bound on the corresponding rate for all $r$-generated inverse monoids and semigroups). This turns out to be an algebraic number strictly…

An element w of the extension E of degree n over the finite field F=GF(q) is called free over F if {w, w^q,...,w^{q^{n-1}}} is a (normal) basis of E/F. The Primitive Normal Basis Theorem, first established in full by Lenstra and Schoof…

For any $k>1$, we find the asymptotics of the counting function of $k$-th power-free elements in an additive arithmetic semigroup with exponential growth of the abstract prime counting function. This paper continues the authors' earlier…

We prove that every group ring of a non-abelian locally free group which is the union of an ascending sequence of free groups is primitive. In particular, every group ring of a countable non-abelian locally free group is primitive. In…

We show that any two elements of the pure braid group either commute or generate a free group, settling a question of Luis Paris. Our proof involves the theory of 3-manifolds and the theory of group actions on trees.

This work introduces the first in-depth study of h-free and h-full elements in abelian monoids, providing a unified approach for understanding their role in various mathematical structures. Let m be an element of an abelian monoid, with…

In this paper, we introduce a novel approach for generating random elements of a finite group given a set of generators of that. Our method draws upon combinatorial group theory and automata theory to achieve this objective. Furthermore, we…

To any free group automorphism, we associate a real pretree with several nice properties. First, it has a rigid/non-nesting action of the free group with trivial arc stabilizers. Secondly, there is an expanding pretree-automorphism of the…

We sketch a simplification of proofs of old results on the arithmeticity of the group generated by opposing integral unipotent radicals in higher rank arithmetic groups

We give two slight generalizations of results of Poizat about elementary theories of groups obtained by free constructions. The first-one concerns the non-superstability of such groups in most cases, and the second-one concerns the…

Using integral methods we recover and generalize some results by F\'{e}lix, Halperin and Thomas on the growth of the rational homology groups of free loop spaces, and obtain a new family of spaces whose $p$-torsion in homotopy groups grows…

Many groups possess highly symmetric generating sets that are naturally endowed with an underlying combinatorial structure. Such generating sets can prove to be extremely useful both theoretically in providing new existence proofs for…

We present upper and two-sided bounds of the exponential growth rate for a wide range of power-free languages. All bounds are obtained with the use of algorithms previously developed by the author.

We prove that centralizers of elements in [f.g. free]-by-cyclic groups are computable. As a corollary we get that, given two conjugate elements in a [f.g. free]-by-cyclic group, the set of conjugators can be computed and that the conjugacy…

We construct finitely generated simple algebras with prescribed growth types, which can be arbitrarily taken from a large variety of (super-polynomial) growth types. This (partially) answers a question raised by the author in a recent…

We introduce a new method of proving upper estimates of growth of finitely generated groups and constructing groups of intermediate growth using graphs of their actions. These estimates are of the form $\exp(n^\alpha)$ for some $\alpha<1$,…