Skip to content
Preprint

Random Cayley sum hypergraphs and $k$-fold sumsets

Oct 2026 · 1 citation · 10 references
Mathematics

Abstract

We denote by $f_k(\Gamma)$ the largest integer with the property that every subset of a finite abelian group $\Gamma$ of size at least $|\Gamma| - f_k(\Gamma)$ is a $k$-fold sumset. Extending a recent result of Alon and Pham, we prove that $$ f_k(\Gamma) \leq \widetilde{O} \left(n^{(2k-1)/(4k-3)}\right) $$ holds for all finite abelian groups $\Gamma$ and integers $k \geq 2$, where $n = |\Gamma|$. Additionally, we also show that the lower bound $f_k(\Gamma) \geq \widetilde{\Omega} \left(n^{1/k}\right)$ holds if $\Gamma$ has no nontrivial element of order dividing $k$. Our upper bound improves a previous result of Balogh, Liu, and Sharifzadeh, and recovers the bound of Alon and Pham in the case $k = 2$. The proof relies on a new upper bound for the independence number of random Cayley sum hypergraphs, which may be of independent interest.

View source

Similar papers

Preprint Sep 2026

Equal subset sums and close divisors

For $k\geq2$, let $\alpha_k$ be the supremum of the exponents $a$ for which almost every integer $n$ has $k$ distinct divisors in a multiplicative interval of relative length $(\log n)^{-a}$. Select each positive integer $i$ independently with probability $1/i$, forming a random set $\mathbf A$, and let $\beta_k$ be th...

Jian-Feng Hou, Hong-Bin Zhao · 0 citations
Preprint Nov 2026

Rational Tur\'an exponents of a single $k$-uniform hypergraph

For a fixed $k$-uniform hypergraph $F$, let $\mathrm{ex}_k(n,F)$ denote the maximum number of edges in an $F$-free $k$-uniform hypergraph on $n$ vertices. We prove that for every integer $k\ge2$ and every rational $r\in[0,1]$ there exists a $k$-uniform hypergraph $F_{k,r}$ such that \begin{equation*} \mathrm{ex}_k(n,F_...

Chang Liu, Jue Dai · 0 citations
Preprint Oct 2026

Lattices with Large Kissing Number from Local Density

Let $\kappa_p(n)$ denote the maximum kissing number of a lattice $\mathcal{L} \subset \mathbb{R}^n$. We prove that $\kappa_p(n) \geq 2^{\Omega(\sqrt{n})}$ for all $p\ge 1$ and that $\kappa_p(n) \geq \Omega(\alpha_p^n)$ for all $p>2$, where $\alpha_p>1$ is a constant depending only on $p$. In particular, our former resu...

Huck Bennett, Minki Hhan, Zi-Han Li et al. · 0 citations
Preprint Oct 2026

When Do Restricted Sumsets Cover a Finite Abelian Group?

For a subset $A$ of a finite abelian group $G$, let $\Sigma_k(A)$ denote the set of sums of $k$ distinct elements of $A$, and let $\Sigma(A)=\bigcup_{k\ge1}\Sigma_k(A)$. The problem of determining when $\Sigma(A)=G$ goes back to Erd\H{o}s and Heilbronn. Nguyen and Vu later formulated the corresponding fixed-length ques...

Dong-Chun Han, Yuan-Hong Ren · 1 citation
Preprint Oct 2026

Congruences modulo powers of $7$ for partitions with colored odd parts

Let $a_k(n)$ denote the number of partitions of $n$ in which even parts occur in one color and odd parts may occur in $k$ colors. We prove infinite families of congruences modulo powers of $7$ for $a_k(n)$ when $k \in \{4,5,7\}$. For each positive integer $\alpha$, let $\lambda_{k,\alpha}$ be the least nonnegative solu...

Saikat Maity, Manjil P. Saikia, P. Talukdar · 0 citations
Preprint Oct 2026

Strongly log-concave measures and lattices

Let $\Lambda \subseteq \mathbb{R}^n$ be a full rank lattice with the property that $\det \Gamma \ge 1$ for all sublattices $\Gamma \subseteq \Lambda^*$. We prove that there exists a symmetric random vector $X \in \mathbb{R}^n$ with a smooth, strictly positive density $f : \mathbb{R}^n \to (0, \infty)$ satisfying that (...

Brayden Letwin, Victor Reis, T. Rothvoss · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.