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

We verify that every alternating group of degree at most one quadrillion is invariably generated by an element of prime order together with an element of prime power order.

Let $f(n)$ count the number of subsets of $\{1,...,n\}$ without an element dividing another. In this paper I show that $f(n)$ grows like the $n$-th power of some real number, in the sense that $\lim_{n\rightarrow \infty}f(n)^{1/n}$ exists.…

Using the Rowland idea, we find two infinite sets of generators of primes. We also pose some conjectures concerning twin primes.

Explanation of exponential growth in self-reproduction is an important step toward elucidation of the origins of life because optimization of the growth potential across rounds of selection is necessary for Darwinian evolution. To produce…

We use the free entropy defined by D. Voiculescu to prove that the free group factors can not be decomposed as closed linear spans of noncommutative monomials in elements of nonprime subfactors or abelian $*$-subalgebras, if the degrees of…

A (2,*)-group is a group that can be generated by two elements, one of which is an involution. We describe the method we have used to produce a census of all (2,*)-groups of order at most 6 000. Various well-known combinatorial structures…

It is shown that the big free group (the set of countably-long words over a countable alphabet) is almost free, in the sense that any function from the alphabet to a compact topological group factors through a homomorphism. This statement…

We consider the growth of an infinite family of finite groups. We are motivated by the remarkable contribution of Bass, Wolf, Milnor, Gromov, Grigorchuk on the word growth and structure of infinite groups, and the results of Black on the…

We will give an example of a branch group $G$ that has exponential growth but does not contain any non-abelian free subgroups. This answers question 16 from \cite{Bartholdi} positively. The proof demonstrates how to construct a non-trivial…

This paper is the fourth one of a series whose chief objective is studying the influence of different mass spectra on the dynamical evolution of open star clusters. Results from several N-body calculations with primordial binaries and mass…

Let $G$ be a finite abelian group $G$ with $N$ elements. In this paper we give a O(N) time algorithm for computing a basis of $G$. Furthermore, we obtain an algorithm for computing a basis from a generating system of $G$ with $M$ elements…

We prove in Theorem $2.2$ that the multiplicatively closed subset generated by at most two elements in the set of natural numbers $\mathbb{N}$ has arbitrarily large gaps by explicitly constructing large integer intervals with known prime…

Let $\mathcal C$ be a set of finite groups which is closed under taking subgroups and let $d$ and $M$ be positive integers. Suppose that for any $G\in\mathcal C$ whose order is divisible by at most two distinct primes there exists an…

A classical theorem of Forster asserts that a finite module $M$ of rank $\leq n$ over a Noetherian ring of Krull dimension $d$ can be generated by $n + d$ elements. We prove a generalization of this result, with "module" replaced by…

Consider a random word $X^n=(X_1,\ldots ,X_n)$ in an alphabet consisting of $4$ letters, with the letters viewed either as $A$, $U$, $G$ and $C$ (i.e., nucleotides in an RNA sequence) or $\alpha$, $\bar{\alpha}$, $\beta$ and $\bar{\beta}$…

We describe a deterministic algorithm for finding a generating element of the multiplicative group of the finite field $\mathbb{F}_{p^n}$ where $p$ is a prime. In time polynomial in $p$ and $n$, the algorithm either outputs an element that…

The present paper is the [slightly expanded] text of our talk at the Conference "Advances in Group Theory and Applications" at Porto Cesareo in June 2011. Our main results assert that [elementary] Chevalley groups very rarely have finite…

We show that a relatively hyperbolic group either is virtually cyclic or has uniform exponential growth.

Let G be a group generated by $r$ elements $g_1,g_2,..., g_r.$ Among the reduced words in $g_1,g_2,..., g_r$ of length $n$ some, say $\gamma_n,$ represent the identity element of the group $G.$ It has been shown in a combinatorial way that…

We prove that any finitely generated one ended group has linear end depth. Moreover, we give alternative proofs to theorems relating the growth of a finitely generated group to the number of its ends.