9 papers
An uniform version of Dvir and Moran's theorem
Gábor Hegedüs
Dvir and Moran proved the following upper bound for the size of a family $\mbox{$\cal F$}$ of subsets of with $\mbox{Vdim}(\mbox{$\cal F$} Δ\mbox{$\cal F$})\leq d$. Let $d\le…
-balancing families
Gábor Hegedüs
P. Hrube\v s, S. Natarajan Ramamoorthy, A. Rao and A. Yehudayoff proved the following result: Let be a prime and let be a polynomial. Sup…
Sets avoiding -term arithmetic progressions in are exponentially small
Gábor Hegedüs
Pach and Palincza proved the following generalization of Ellenberg and Gijswijt's bound for the size of -term arithmetic progression-free subsets, where : Let $m…
A new proof of a generalization of Gerzon's bound
Gábor Hegedüs
In this paper we give a short, new proof of a natural generalization of Gerzon's bound. This bound improves the Delsarte, Goethals and Seidel's upper bound in a special case. Our p…
A new upper bound for the size of -distance sets in boxes
Gábor Hegedüs
Let be integers. Define Let $\mbox{$\cal G$}\subseteq {\mathbb R}^n$ be an arbitrar…
A new exponential upper bound for the Erdős-Ginzburg-Ziv constant
Gábor Hegedüs
Naslund used Tao's slice rank bounding method to give new exponential upper bounds for the Erdős--Ginzburg-Ziv constant of finite Abelian groups of high rank. In our short manuscri…