On the joints problem with multiplicities
M\'arton Hablicsek

TL;DR
This paper applies Kollár's theorem on the arithmetic genus of curves to establish bounds on the number of joints with multiplicities, confirming a conjecture of Carbery in generic cases.
Contribution
It introduces a novel application of Kollár's theorem to the joints problem, providing bounds in the context of multiplicities and resolving a conjecture in the generic case.
Findings
Bound on the number of joints with multiplicities
Affirmative answer to Carbery's conjecture in the generic case
Application of algebraic geometry to combinatorial geometry
Abstract
In this short note we apply a recent theorem of Koll\'ar about the arithmetic genus of curves to give a bound on the number of joints weighted by the multiplicities. This gives an affirmative answer to a conjecture of Carbery in the generic case.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Algebraic Geometry and Number Theory · Graph Labeling and Dimension Problems
