The joints problem for matroids

DOI10.1016/J.JCTA.2014.11.003zbMATH Open1305.05037arXiv1308.3773OpenAlexW1991370897MaRDI QIDQ482235FDOQ482235

Authors: Andrew Suk, Larry Guth 

Publication date: 19 December 2014

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

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.

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)

Cites Work

• Title not available (Why is that?)
• Algebraic methods in discrete analogs of the Kakeya problem
• On lines, joints, and incidences in three dimensions
• On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
• Title not available (Why is that?)
• Title not available (Why is that?)
• Graph removal lemmas
• Counting and cutting cycles of lines and rods in space
• The joints problem in \(\mathbb{R}^n\)
• On lines and joints

Cited In (3)

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

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)