On subsets of the hypercube with prescribed Hamming distances

DOI10.1016/j.jcta.2019.105156zbMath1433.05098arXiv1812.05989OpenAlexW2979503629WikidataQ127091628 ScholiaQ127091628MaRDI QIDQ2299612

Hao Huang, Cosmin Pohoata, Oleksiy Klurman

Publication date: 21 February 2020

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1812.05989

zbMATH Keywords

intersective setsCroot-Lev-Pach lemmaKleitmanpseudo-adjacency matrices

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Distance in graphs (05C12)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Progression-free sets in \(\mathbb{Z}_4^n\) are exponentially small
• On large subsets of \(\mathbb{F}_q^n\) with no three-term arithmetic progression
• The Sperner capacity of linear and nonlinear codes for the cyclic triangle
• Diameter and radius in the Manhattan metric
• On a packing and covering problem
• Intersection theorems with geometric consequences
• Diametric theorems in sequence spaces
• Ergodic behavior of diagonal measures and a theorem of Szemeredi on arithmetic progressions
• Contributions to the geometry of Hamming spaces
• The diametric theorem in Hamming spaces---optimal anticodes
• Maximal sets of given diameter in the grid and the torus
• Perturbed Identity Matrices Have High Rank: Proof and Applications
• On difference sets of sequences of integers. I
• Extremal Problems for Finite Sets
• The Erdös-Ko-Rado Theorem for Integer Sequences
• A lower bound for the k‐multicolored sum‐free problem in Zmn
• Problems and Results on Intersective Sets
• Intersection theorems for systems of finite sets
• A new generalization of the Erdős-Ko-Rado theorem

This page was built for publication: On subsets of the hypercube with prescribed Hamming distances