Related papers: The (7,4)-conjecture in finite groups

A set of integers greater than 1 is primitive if no element divides another. Erd\H{o}s proved in 1935 that the sum of $1/(n \log n)$ for $n$ running over a primitive set $A$ is universally bounded over all choices for $A$. In 1988 he asked…

In this paper, we prove that the symmetric group $\mathrm{S}_n$ has $2^{n^2/16+o(n^2)}$ subgroups, settling a conjecture of Pyber from 1993. We also derive asymptotically sharp upper and lower bounds on the number of subgroups of…

We prove the Erd\H os--S\'os conjecture for trees with bounded maximum degree and large dense host graphs. As a corollary, we obtain an upper bound on the multicolour Ramsey number of large trees whose maximum degree is bounded by a…

Let D denote the (n-1)-dimensional simplex. Let Y be a random 2-dimensional subcomplex of D obtained by starting with the full 1-skeleton of D and then adding each 2-simplex independently with probability p. For a fixed c>0 it is shown that…

A famous conjecture of Erd\H os and Straus is that for every integer $n\ge2$, $4/n$ can be represented as $1/x+1/y+1/z$, where $x,y,z$ are positive integers. This conjecture was generalized to $5/n$ by Sierpi\'nski, and then Schinzel…

Let G be an additive abelian group whose finite subgroups are all cyclic. Let A_1,...,A_n (n>1) be finite subsets of G with cardinality k>0, and let b_1,...,b_n be pairwise distinct elements of G with odd order. We show that for every…

An n-ary operation q:A^n->A is called an n-ary quasigroup of order |A| if in x_0=q(x_1,...,x_n) knowledge of any n elements of x_0,...,x_n uniquely specifies the remaining one. An n-ary quasigroup q is permutably reducible if…

Motivated by weighted partition of $n$ that vanish if and only if $n$ is a prime, Craig, van Ittersum, and Ono conjecture a classification of quasimodular forms which detect primes in the sense that the $n$-th Fourier coefficient vanishes…

Let S $\subseteq$ N be a numerical semigroup with multiplicity m = min(S \ {0}), conductor c = max(N \ S) + 1 and minimally generated by e elements. Let L be the set of elements of S which are smaller than c. Wilf conjectured in 1978 that…

A $d$-ary quasigroup of order $n$ is a $d$-ary operation over a set of cardinality $n$ such that the Cayley table of the operation is a $d$-dimensional latin hypercube of the same order. Given a binary quasigroup $G$, the $d$-iterated…

We investigate a beautiful conjecture of T. Wilde on character values and element orders of finite groups. We reduce it to a statement on nearly simple groups that can be checked ``prime by prime". For these groups, we show that a strong…

Graham conjectured in 1971 that for any prime $p$, any subset $S\subseteq \mathbb{Z}_p\setminus \{0\}$ admits an ordering $s_1,s_2,\dots,s_{|S|}$ where all partial sums $s_1, s_1+s_2,\dots,s_1+s_2+\dots+s_{|S|}$ are distinct. We prove this…

The subgroup commutativity degree of a group G has been defined in [6] as the probability that two subgroups of G commute, or equivalently that the product of two subgroups is again a subgroup. Problem 4.3 of [6] asks whether there exist…

We study the number of $s$-element subsets $J$ of a given abelian group $G$, such that $|J+J|\leq K|J|$. Proving a conjecture of Alon, Balogh, Morris and Samotij, and improving a result of Green and Morris, who proved the conjecture for $K$…

In 1965 Erd\H os conjectured that for all $k\ge2$, $s\ge1$ and $n\ge k(s+1)$, an $n$-vertex $k$-uniform hypergraph $\F$ with $\nu(\F)=s$ cannot have more than \newline $\max\{\binom{sk+k-1}k,\;\binom nk-\binom{n-s}k\}$ edges. It took almost…

Let $G$ be a finite cyclic group. Every sequence $S$ over $G$ can be written in the form $S=(n_1g)\cdot...\cdot(n_lg)$ where $g\in G$ and $n_1,\cdots,n_l\in[1,{\hbox{\rm ord}}(g)]$, and the index $\ind(S)$ of $S$ is defined to be the…

The number of subgroups and the number of cyclic subgroups are natural combinatorial invariants of a finite group. We investigate how restrictions on these quantities, together with the number of distinct prime divisors of $|G|$, enforce…

In this note, we show that among finite nilpotent groups of a given order or finite groups of a given odd order, the cyclic group of that order has the minimum number of edges in its cyclic subgroup graph. We also conjecture that this holds…

We propose a framework to prove Malle's conjecture for the compositum of two number fields based on proven results of Malle's conjecture and good uniformity estimates. Using this method we can prove Malle's conjecture for $S_n\times A$ over…

Let $G$ be a finite cyclic group. Every sequence $S$ over $G$ can be written in the form $S=(n_1g)\cdot...\cdot(n_kg)$ where $g\in G$ and $n_1,\cdots,n_k\in[1,{\hbox{\rm ord}}(g)]$, and the index $\ind S$ of $S$ is defined to be the minimum…