Extremal Problems for Affine Cubes of Integers
A collection \(H\) of integers is called an affine \(d\)-cube if there exist \(d+1\) positive integers \(x_0,x_1, \dots, x_d\) so that \[ H= \Bigl\{x_0+ \sum_{i\in I}x_i: I\subseteq \{1, \dots, d\}\Bigr\}. \] The following theorem is proved: Let \(d\geq 3\) and \(A\subseteq \{1,\dots,n\}\) be given. Then there exists \(n_0\leq 2^{d2^{d-1}/(2^{d-1} -1)-1}\) so that, for every \(n\geq n_0\), \(A\) contains an affine \(n\)-cube, if \[ | A| \geq 2^{1-1/2^{d-1}} (\sqrt n+1)^{2 -1/2^{d-2}}. \] Let \(h(d,r)\) be the least number so that, for any \(r\)-colouring of \(\{1, \dots,n\}\), there is a monochromatic affine \(d\)-cube. It is shown that for \(d\geq 3\) and \(r\geq 2\) \[ r^{\bigl(1-o(1) \bigr) (2^d-1)/d} \leq h(d,r) \leq(2r)^{2^{d-1}}, \] where \(o(1)\to 0\) as \(r\to\infty\).
- Threshold functions and Poisson convergence for systems of equations in random sets
- On combinatorial cubes
- Extremal problems for sets forming Boolean algebras and complete partite hypergraphs
- The Namer-Claimer game
- The largest projective cube-free subsets of \(\mathbb{Z}_{2^n}\)
- On additive and multiplicative Hilbert cubes
- An upper bound for Hilbert cubes
- Non-degenerate Hilbert cubes in random sets
- Hilbert’s Proof of His Irreducibility Theorem
- Boolean algebras and Lubell functions
- The largest (k,\ell )-sum-free subsets
- Extremal problems in hypergraph colourings
- Lower bounds for the Turán densities of daisies
This page was built for publication: Extremal Problems for Affine Cubes of Integers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4383738)
