Related papers: Almost all alternating groups are invariably gener…

A subset $A$ of a group $G$ is called product-free if there is no solution to $a=bc$ with $a,b,c$ all in $A$. It is easy to see that the largest product-free subset of the symmetric group $S_n$ is obtained by taking the set of all odd…

A finite transitive permutation group is elusive if it contains no derangements of prime order. These groups are closely related to a longstanding open problem in algebraic graph theory known as the Polycirculant Conjecture, which asserts…

Two classical results of Stafford say that every (left) ideal of the $n$-th Weyl algebra $A_n$ can be generated by two elements, and every holonomic $A_n$-module is cyclic, i.e. generated by one element. We modify Stafford's original proofs…

In this paper, we classify all $2$-blocks for which the defect groups are abelian and the inertial quotient has prime order. As a consequence, we prove that Brou\'e's abelian defect group conjecture holds for all blocks under consideration…

The idea of generating prime numbers through sequence of sets of co-primes was the starting point of this paper that ends up by proving two conjectures, the existence of infinitely many twin primes and the Goldbach conjecture. The main idea…

Every finite simple group can be generated by two elements, and Guralnick and Kantor proved that, moreover, every nontrivial element is contained in a generating pair. Groups with this property are said to be $\frac{3}{2}$-generated.…

For $n\geq 5$ the natural permutation module for the alternating group $\mathfrak{A}_n$ has a unique non-trivial composition factor, being called its natural simple module. We determine the vertices and sources of the natural simple…

If X is a non-empty subset of a finite group G, we denote by o(x) the order of x in G. Then we put The number o(X) is called the average order of X. Zapirain in 2011 , posed the following question: Let G be a finite (p-) group and N a…

We prove that a random group, in Gromov's density model with $d < 1/16$ satisfies with overwhelming probability a universal-existential first-order sentence $\sigma$ (in the language of groups) if and only if $\sigma$ is true in a…

We first give a short group theoretic proof of the following result of Lackenby. If $G$ is a large group, $H$ is a finite index subgroup of $G$ admitting an epimorphism onto a non--cyclic free group, and $g$ is an element of $H$, then the…

We construct a family of finitely generated infinite periodic groups. The basic example is a 2-group, called the tetrahedron group. We generalize the construction by suggesting a family of infinite finitely generated dice groups. We provide…

To any finite group $G$, we may associate a graph whose vertices are the elements of $G$ and where two distinct vertices $x$ and $y$ are adjacent if and only if the order of the subgroup $\langle x, y\rangle$ is divisible by at least 3…

Commutative totally ordered monoids abound, number systems for example. When the monoid is not assumed commutative, one may be hard pressed to find an example. One suggested by Professor Orr Shalit are the countable ordinals with addition.…

In this paper we investigate some new problems in additive combinatorics. Our problems mainly involve permutations (or circular permutations) $n$ distinct numbers (or elements of an additive abelian group) $a_1,\ldots,a_n$ with adjacent…

We study the action of the multiplicative group generated by two prime numbers in $\mathbf{Z}/Q\mathbf{Z}$. More specifically, we study returns to the set $([-Q^\varepsilon,Q^\varepsilon]\cap \mathbf{Z})/Q\mathbf{Z}$. This is intimately…

Let $G$ be an almost simple group. We prove that if $x \in G$ has prime order $p \ge 5$, then there exists an involution $y$ such that $<x,y>$ is not solvable. Also, if $x$ is an involution then there exist three conjugates of $x$ that…

We prove that, for almost all $r \leq N^{1/2}/\log^{O(1)}N$, for any given $b_1 \mod r$ with $(b_1, r) = 1$, and for almost all $b_2 \mod r$ with $(b_2, r) = 1$, we have that almost all natural numbers $2n \leq N$ with $2n \equiv b_1 + b_2…

Two players alternate moves in the following impartial combinatorial game: Given a finitely generated abelian group $A$, a move consists of picking some nonzero element $a \in A$. The game then continues with the quotient group $A/ \langle…

Given an automorphism $x$ of order bigger than $2$ of a sporadic simple group $S$, we show that there are at most $3$ conjugates of $x$ required to generate a subgroup of order divisible by a fixed prime divisor $r$ of $|S|$. The only…

We introduce a family of maps generating continued fractions where the digit $1$ in the numerator is replaced cyclically by some given non-negative integers $(N_1,\ldots,N_m)$. We prove the convergence of the given algorithm, and study the…