Related papers: Almost all alternating groups are invariably gener…

We describe $\{2,3\}$-groups in which the order of a product of any two elements of orders at most $4$ does not exceed $9$ and the centralizer of every involution is a locally cyclic $2$-subgroup. In particular, we will prove that these…

A causal set is a partially ordered set on a countably infinite ground-set such that each element is above finitely many others. A natural extension of a causal set is an enumeration of its elements which respects the order. We bring…

Let $G$ be a subgroup of the symmetric group $S_n$. If the proportion of fixed-point-free elements in $G$ (or a coset) equals the proportion of fixed-point-free elements in $S_n$, then $G=S_n$. The analogue for $A_n$ holds if $n \ge 7$. We…

We present an elementary proof that the nonassociative simple Moufang loops over finite prime fields are generated by three elements. In the last section, we conclude that integral Cayley numbers of unit norm are generated multiplicatively…

Let A_n be the alternating group on n letters. For n>5, we describe the elements alpha, beta in A_n when alpha^{A_n} beta^{A_n} is the union of at most four distinct conjugacy classes.

We say that a loop is unbreakable when it does not have nontrivial subloops. While the cyclic groups of prime order are the only unbreakable finite groups, we show that nonassociative unbreakable loops exist for every order n >= 5. We…

Let $G$ be a group generated by a set $X$. It is well known and easy to check that \[ [g_1, g_2, \dots ,g_n] = 1 \mbox{ for all } g_i \in G \qquad \iff \qquad [x_1, x_2, \dots , x_n] =1 \mbox{ for all } x_i \in X. \] Let $L$ be a Lie…

We are interested in ordering the elements of a subset A of the non-zero integers modulo n in such a way that all the partial sums are distinct. We conjecture that this can always be done and we prove various partial results about this…

We prove that an Alexander quandle of prime order is generated by any pair of distinct elements. Furthermore, we prove for such a quandle that any ordered pair of distinct elements can be sent to any other such pair by an automorphism of…

If we pick two elements of a non-abelian group at random, the odds this pair commutes is at most 5/8, so there is a "gap" between abelian and non-abelian groups \cite{G}. We prove a "topological" generalization estimating the odds a word…

Let $A\subset [1,x]$ be a non-empty set of primes with $|A|= \alpha x(\log x)^{-1}$. We prove that there exist absolute constants $c_1,c_2>0$ such that, as $x$ gets sufficiently large, we have $|A+A|\geq c_1(\log x)(\log \log…

Let G be a 2-group of order 2^n, n>5, and nilpotency class n-2. The invariants of such groups determined by their group algebras over the field of two elements are given in the paper.

We study the group of interval exchange transformations and obtain several characterizations of its commutator group. In particular, it turns out that the commutator group is generated by elements of order 2.

Let $(G,+)$ be an abelian group and consider a subset $A \subseteq G$ with $|A|=k$. Given an ordering $(a_1, \ldots, a_k)$ of the elements of $A$, define its {\em partial sums} by $s_0 = 0$ and $s_j = \sum_{i=1}^j a_i$ for $1 \leq j \leq…

For any prime number p and any positive real number {\alpha}, we construct a finitely generated group {\Gamma} with p-gradient equal to {\alpha}. This construction is used to show that there exist uncountably many pairwise non-commensurable…

Let $p_1=2, p_2=3, p_3=5, \ldots$ be the consecutive prime numbers, $S_n$ the numerical semigroup generated by the primes not less than $p_n$ and $u_n$ the largest irredundant generator of $S_n$. We will show, that $\bullet$ $u_n\sim3p_n$.…

Let $G$ be a transitive permutation group on a finite set of size at least $2$. By a well known theorem of Fein, Kantor and Schacher, $G$ contains a derangement of prime power order. In this paper, we study the finite primitive permutation…

A group $G$ is said to be factorized into subsets $A_1, A_2, \ldots, A_s\subseteq G$ if every element $g$ in $G$ can be uniquely represented as $g=g_1g_2\ldots g_s$, where $g_i\in A_i$, $i=1,2,\ldots,s$. We consider the following…

For a finite group $A$ with normal subgroup $G$, a subgroup $U$ of $G$ is an $A$-prime-power-covering subgroup if $U$ meets every $A$-conjugacy-class of elements of $G$ of prime power order. It is conjectured that $|G:U|$ is bounded by some…

In this paper we use Dirichlet's theorem in order to elementally prove two theorems. The first says that since a polynomial ax+b generates one prime, it also generates infinites. The second theorem (which is proved in a very simillar way to…