Related papers: Olson's theorem for cyclic groups

Let G be a finitely generated linear group over a field of characteristic 0. Suppose that every solvable subgroup of G is polycyclic. Then the claim is made that any solvable subgroup of G is separable. This is proven for G=SL_n(Z).…

The union-closed sets conjecture (Frankl's conjecture) says that for any finite union-closed family of finite sets, other than the family consisting only of the empty set, there exists an element that belongs to at least half of the sets in…

We prove that every partially ordered set on $n$ elements contains $k$ subsets $A_{1},A_{2},\dots,A_{k}$ such that either each of these subsets has size $\Omega(n/k^{5})$ and, for every $i<j$, every element in $A_{i}$ is less than or equal…

Simon's congruence, denoted \sim_n, relates words having the same subwords of length up to n. We show that, over a k-letter alphabet, the number of words modulo \sim_n is in 2^{\Theta(n^{k-1} log n)}.

We show that under the proper forcing axiom the class of all Aronszajn lines behave like $\sigma$-scattered orders under the embeddability relation. In particular, we are able to show that the class of better quasi order labeled fragmented…

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 $\delta > 1/2$. We prove that if $A$ is a subset of the primes such that the relative density of $A$ in every reduced residue class is at least $\delta$, then almost all even integers can be written as the sum of two primes in $A$. The…

We prove that the double covers of the alternating and symmetric groups are determined by their complex group algebras. To be more precise, let $n\geq 5$ be an integer, $G$ a finite group, and let $\AAA$ and $\SSS^\pm$ denote the double…

A conjecture of Jackson from 1981 states that every $d$-regular oriented graph on $n$ vertices with $n\leq 4d+1$ is Hamiltonian. We prove this conjecture for sufficiently large $n$. In fact we prove a more general result that for all…

A finite group $G$ is called a Schur group, if any Schur ring over $G$ is the transitivity module of a permutation group on the set $G$ containing the regular subgroup of all right translations. It was proved by R. P\"oschel (1974) that…

Let~$A$ be a set of nonnegative integers. Let~$(h A)^{(t)}$ be the set of all integers in the sumset~$hA$ that have at least~$t$ representations as a sum of~$h$ elements of~$A$. In this paper, we prove that, if~$k \geq 2$,…

Let $G$ be a finite group and $\alpha(G)=\frac{|C(G)|}{|G|}$\,, where $C(G)$ denotes the set of cyclic subgroups of $G$. In this short note, we prove that $\alpha(G)\leq\alpha(Z(G))$ and we describe the groups $G$ for which the equality…

The prime number graph is the set of points $(n,p_n)$ where $p_n$ denotes the $n^{\rm th}$ prime. Let $L(n)$ be the minimum number of straight line segments needed to cover the first $n$ points in this set. Let $B(n)$ be the largest number…

Let A={a_s(mod n_s)}_{s=0}^k be a system of residue classes. With the help of cyclotomic fields we obtain a theorem which unifies several previously known results concerning system A. In particular, we show that if every integer lies in…

A family of sets is said to be symmetric if its automorphism group is transitive, and $3$-wise intersecting if any three sets in the family have nonempty intersection. Frankl conjectured in 1981 that if $\mathcal{A}$ is a symmetric $3$-wise…

A relation algebra is called measurable when its identity is the sum of measurable atoms, and an atom is called measurable if its square is the sum of functional elements. In this paper we show that atomic measurable relation algebras have…

Denote the sum of element orders in a finite group $G$ by $\psi(G)$ and let $C_n$ denote the cyclic group of order $n$. In this paper, we prove that if $|G|=n$ and $\psi(G)>\frac{13}{21}\,\psi(C_n)$, then $G$ is nilpotent. Moreover, we have…

Let $A$ be a set and $f:A\rightarrow A$ a bijective function. Necessary and sufficient conditions on $f$ are determined which makes it possible to endow $A$ with a binary operation $*$ such that $(A,*)$ is a cyclic group and $f\in…

The main result in Y.~O.~Hamidoune's paper "Adding Distinct Congruence Classes" ({\em Combin.~Probab.~Comput.}~{\bf 7} (1998) 81-87) is as follows: If $S$ is a generating subset of a cyclic group $G$ such that $0 \not \in S$ and $|S| \geq…

A perfect code in a graph $\Gamma = (V, E)$ is a subset $C$ of $V$ such that no two vertices in $C$ are adjacent and every vertex in $V \setminus C$ is adjacent to exactly one vertex in $C$. A subgroup $H$ of a group $G$ is called a…