On combinatorial cubes
From MaRDI portal
Given \(k\geq 1\), a set \(H\subset \mathbb{N}\) is called a cube of size \(k\) if there exist \(a>0\) and \(x_1,\dots,x_k\) such that \(H=\left\{a+\sum_{i=1}^k\varepsilon_ia_i:\varepsilon=0\text{ or }1\right\}\) and we write \(\dim H=k\). Let \(r_3(n)\) be the maximal number of integers that can be selected from the interval \([1,n]\) without including a three--term arithmetic progression. The author proves that there exists a \(A\subset[1,n]\) for which \(| A| \geq r_3(n)/3\) and \(\max_{H\subset[1,n]}\dim H\leq (1/\log 2)\log\log 2\).
Recommendations
Cited in
(14)- Cubic pisot unit combinatorial games
- On the dimension of the Hilbert cubes
- Derangements on the \(n\)-cube
- The largest projective cube-free subsets of \(\mathbb{Z}_{2^n}\)
- A metrical lower bound on the star discrepancy of digital sequences
- On additive and multiplicative Hilbert cubes
- Non-degenerate Hilbert cubes in random sets
- scientific article; zbMATH DE number 5177808 (Why is no real title available?)
- Extremal Problems for Affine Cubes of Integers
- scientific article; zbMATH DE number 6963562 (Why is no real title available?)
- Cubes in \(\{0,1,\dots ,n\}^3\)
- A geometric extremal result for cubic arrays
- On dissections of the n-cube
- Cubes and orientability
This page was built for publication: On combinatorial cubes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1770959)