Forbidden vector-valued intersections

DOI10.1112/PLMS.12338MaRDI QIDQ3295911zbMATH OpenOpenAlexFDO

Authors Peter Keevash, Eoin Long

Publication date 3 July 2020

Published in Proceedings of the London Mathematical Society (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

Borsuk's problemKalai's conjecture

Mathematics Subject Classification ID

Erd?s problems and related topics of discrete geometry (52C10) Extremal set theory (05D05) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Abstract: We solve a generalised form of a conjecture of Kalai motivated by attempts to improve the bounds for Borsuk's problem. The conjecture can be roughly understood as asking for an analogue of the Frankl-R"odl forbidden intersection theorem in which set intersections are vector-valued. We discover that the vector world is richer in surprising ways: in particular, Kalai's conjecture is false, but we prove a corrected statement that is essentially best possible, and applies to a considerably more general setting. Our methods include the use of maximum entropy measures, VC-dimension, Dependent Random Choice and a new correlation inequality for product measures.

Recommendations

• Forbidden Intersections
• The Borsuk and Hadwiger problems and systems of vectors with restrictions on scalar products
• Shadows and intersections in vector spaces
• scientific article; zbMATH DE number 718861
• On a bound in Borsuk's problem

Cited in

(3)

• Unavoidable hypergraphs
• Forbidden sparse intersections
• Turán numbers of sunflowers

This page was built for publication: Forbidden vector-valued intersections

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3295911)