Search

We show that the Union-Closed Conjecture holds for the union-closed family generated by the cyclic translates of any fixed set., Comment: 3 pages. Updated references

Alon and F\"{u}redi (1993) showed that the number of hyperplanes required to cover $\{0,1\}^n\setminus \{0\}$ without covering $0$ is $n$. We initiate the study of such exact hyperplane covers of the hypercube for other subsets of the hypercube. In particular, we provide exact solutions for covering $\{0,1\}^n$ while missing up to four points and give asymptotic bounds in the general case. Several interesting questions are left open., Comment: Small fixes and updated code

A subspace of $\mathbb{F}_2^n$ is called cyclically covering if every vector in $\mathbb{F}_2^n$ has a cyclic shift which is inside the subspace. Let $h_2(n)$ denote the largest possible codimension of a cyclically covering subspace of $\mathbb{F}_2^n$. We show that $h_2(p)= 2$ for every prime $p$ such that 2 is a primitive root modulo $p$, which, assuming Artin's conjecture, answers a question of Peter Cameron from 1991. We also prove various bounds on $h_2(ab)$ depending on $h_2(a)$ and $h_2(b)$ and extend some of our results to a more general set-up proposed by Cameron, Ellis and Raynaud., Comment: 36 pages

Let $p$ be a prime. One formulation of the Polynomial Freiman-Ruzsa conjecture over $\mathbb{F}_p$ can be stated as follows. If $\phi : \mathbb{F}_p^n \rightarrow \mathbb{F}_p^N$ is a function such that $\phi(x+y) - \phi(x) - \phi(y)$ takes values in some set $S$, then there is a linear map $\tilde{\phi} : \mathbb{F}_p^n \rightarrow \mathbb{F}_p^N$ with the property that $\phi - \tilde{\phi}$ takes at most $|S|^{O(1)}$ values. A strong variant of this conjecture states that, in fact, there is a linear map $\tilde{\phi}$ such that $\phi - \tilde{\phi}$ takes values in $tS$ for some constant $t$. In this note, we discuss a counterexample to this conjecture., Comment: 3 pages

In this note, we prove that, among functions $f$ supported on a Hamming Sphere in $\mathbb{F}_2^n$ with fixed $\ell^2$ norm, the additive energy is maximised when $f$ is constant. This answers a question asked by Kirshner and Samorodnitsky., Comment: 3 pages

Given a linear equation of the form $a_1x_1 + a_2x_2 + a_3x_3 = 0$ with integer coefficients $a_i$, we are interested in maximising the number of solutions to this equation in a set $S \subseteq \mathbb{Z}$, for sets $S$ of a given size. We prove that, for any choice of constants $a_1, a_2$ and $a_3$, the maximum number of solutions is at least $\left(\frac{1}{12} + o(1)\right)|S|^2$. Furthermore, we show that this is optimal, in the following sense. For any $\varepsilon > 0,$ there are choices of $a_1, a_2$ and $a_3,$ for which any large set $S$ of integers has at most $\left(\frac{1}{12} + \varepsilon\right)|S|^2$ solutions. For equations in $k \geq 3$ variables, we also show an analogous result. Set $\sigma_k = \int_{-\infty}^{\infty} (\frac{\sin \pi x}{\pi x})^k dx.$ Then, for any choice of constants $a_1, \dots, a_k$, there are sets $S$ with at least $(\frac{\sigma_k}{k^{k-1}} + o(1))|S|^{k-1}$ solutions to $a_1x_1 + \dots + a_kx_k = 0$. Moreover, there are choices of coefficients $a_1, \dots, a_k$ for which any large set $S$ must have no more than $(\frac{\sigma_k}{k^{k-1}} + \varepsilon)|S|^{k-1}$ solutions, for any $\varepsilon > 0$., Comment: 18 pages. Corrections in light of comments from referee

In a finite abelian group $G$, define an additive matching to be a collection of triples $(x_i, y_i, z_i)$ such that $x_i + y_j + z_k = 0$ if and only if $i = j = k$. In the case that $G = \mathbb{F}_2^n$, Kleinberg, building on work of Croot-Lev-Pach and Ellenberg-Gijswijt, proved a polynomial upper bound on the size of an additive matching. Fox and Lov\'{a}sz used this to deduce polynomial bounds on Green's arithmetic removal lemma in $\mathbb{F}_2^n$. If $G$ is taken to be an arbitrary finite abelian group, the questions of bounding the size of an additive matching and giving bounds for Green's arithmetic removal lemma are much less well understood. In this note, we adapt the methods of Fox and Lov\'{a}sz to prove that, provided we can assume a sufficiently strong bound on the size of an additive matching in cyclic groups, a similar bound should hold in the case of removal., Comment: 7 pages