Related papers: When Do Random Subsets Decompose a Finite Group?

We study the following game on a finite graph $G = (V, E)$. At the start, each edge is assigned an integer $n_e \ge 0$, $n = \sum_{e \in E} n_e$. In round $t$, $1 \le t \le n$, a uniformly random vertex $v \in V$ is chosen and one of the…

We introduce a very general model of an inhomogenous random graph with independence between the edges, which scales so that the number of edges is linear in the number of vertices. This scaling corresponds to the p=c/n scaling for G(n,p)…

We consider groups of the form $G=AB$ with two locally cyclic subgroups $A$ and $B$. The structure of these groups is determined in the cases when $A$ and $B$ are both periodic or when one of them is periodic and the other is not. Together…

Let $\psi$ be a permutation of a finite set $X$. We define $\lambda(\psi)$ to be the largest fraction of elements of $X$ lying on a single cycle of $\psi$. For a finite group $G$, we define $\lambda(G)$ to be the maximum among the values…

Let $G$ be a transitive permutation group acting on $\Omega$. In this paper, we introduce and study the parameter ${\bf m}(G)$, which denotes the size of the smallest set of points $A$ such that, for every permutation $g\in G$, $A \cap A^g$…

This is the third in a series of papers in which we prove a conjecture of Boston and Shalev that the proportion of derangements (fixed point free elements) is bounded away from zero for transitive actions of finite simple groups on a set of…

A cyclic subgroup $N$ of a finite group $G$ is called a uni-width subgroup of $G$ if $N$ is the unique cyclic subgroup of $G$ of order $|N|$. In this article, we prove that a finite group $G$ admits a unique largest uni-width subgroup…

Let $\Bbb P$ be the set of all primes. A subgroup $H$ of a group $G$ is called {\it $\mathbb P$-subnormal} in $G$, if either $H=G$, or there exists a chain of subgroups $H=H_0\le H_1\le \ldots \le H_n=G, \ |H_{i}:H_{i-1}|\in \Bbb P, \…

For any group G of order n, a subset A of G is said to be product-free if there is no solution of the equation ab=c with a,b,c in A. Previous results of Gowers showed that the size of any product-free subset of G is at most n/d^(1/3), where…

Let $P$ be a probability on a finite group $G$, ${P^{(n)}}$ $n$-fold convolution of $P$ on $G$. Under mild condition, ${P^{(n)}}$ at $n \to \infty $ converges to the uniform probability on the group $G$. If $A = \left\{ {g \in G,\;P\left( g…

We consider a certain convolution semigroup $\Theta$ of probability distributions on the group $\mathbb{R}\times \mathbb{Z}(2)$, where $\mathbb{R}$ is the group of real numbers and $\mathbb{Z}(2)$ is the additive group of the integers…

Gowers has elegantly characterized the finite groups $G$ in which $A_1A_2A_3 = G$ for any positive density subsets $A_1,A_2,A_3$. This property, quasi-randomness, holds if and only if G does not admit a nontrivial irreducible representation…

Let $G$, $H$ be groups. We denote by $\eta(G,H)$ a certain extension of the non-abelian tensor product $G \otimes H$ by $G \times H$. We prove that if $G$ and $H$ are groups that act compatibly on each other and such that the set of all…

Let A be a subset of an abelian group G. We say that A is sum-free if there do not exist x,y and z in A satisfying x + y = z. We determine, for any G, the cardinality of the largest sum-free subset of G. This equals c(G)|G| where c(G) is a…

Let $G$ be a finite group, and let $H$ be a subgroup of $G$. We compute the probability, denoted by $P_G(H)$, that a left transversal of $H$ in $G$ is also a right transversal, thus a two-sided one. Moreover, we define, and denote by…

At high temperature, the overlap of two particles chosen independently according to the Gibbs measure of the branching Brownian motion converges to zero as time goes to infinity. We investigate the precise decay rate of the probability to…

The sumset is one of the most basic and central objects in additive number theory. Many of the most important problems (such as Goldbach's conjecture and Fermat's Last theorem) can be formulated in terms of the sumset $S + S = \{x+y :…

An instance of a random constraint satisfaction problem defines a random subset S (the set of solutions) of a large product space (the set of assignments). We consider two prototypical problem ensembles (random k-satisfiability and…

The proper subgroup $B$ of the group $G$ is called {\it strongly embedded}, if $2\in\pi(B)$ and $2\notin\pi(B \cap B^g)$ for any element $g \in G \setminus B $ and, therefore, $ N_G(X) \leq B$ for any 2-subgroup $ X \leq B $. An element $a$…

This paper concerns the general problem of classifying the finite deterministic automata that admit a synchronizing (or reset) word. (For our purposes it is irrelevant if the automata has initial or final states.) Our departure point is the…