The joints problem for matroids

DOI10.1016/J.JCTA.2014.11.003MaRDI QIDQ482235zbMATH OpenOpenAlexFDO

Authors Andrew Suk, Larry Guth

Publication date 19 December 2014

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

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

zbMATH Keywords

arithmetic progressionmatroidsjoints problem

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Abstract: We prove that in a simple matroid, the maximal number of joints that can be formed by L lines is o(L^2) and Omega(L^{2 - epsilon}) for any epsilon > 0.

Cites work

• scientific article; zbMATH DE number 3473781 (Why is no real title available?)
• scientific article; zbMATH DE number 3609704 (Why is no real title available?)
• scientific article; zbMATH DE number 5047784 (Why is no real title available?)
• Algebraic methods in discrete analogs of the Kakeya problem
• Counting and cutting cycles of lines and rods in space
• Graph removal lemmas
• On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
• On lines and joints
• On lines, joints, and incidences in three dimensions
• The joints problem in \(\mathbb{R}^n\)

Cited in

(3)

• Jump number problem: The role of matroids
• The Lazy Matroid Problem
• On realizations of a joint degree matrix

This page was built for publication: The joints problem for matroids

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