Joints tightened

DOI10.1353/AJM.2023.0014MaRDI QIDQ6159562zbMATH OpenOpenAlexFDO

Authors Yufei Zhao

Publication date 8 May 2023

Published in American Journal of Mathematics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Erd?s problems and related topics of discrete geometry (52C10) Projective techniques in algebraic geometry (14N05) Planar arrangements of lines and pseudolines (aspects of discrete geometry) (52C30)

Abstract: In $d$-dimensional space (over any field), given a set of lines, a joint is a point passed through by $d$ lines not all lying in some hyperplane. The joints problem asks to determine the maximum number of joints formed by $L$ lines, and it was one of the successes of the Guth--Katz polynomial method. We prove a new upper bound on the number of joints that matches, up to a $1+o(1)$ factor, the best known construction: place $k$ generic hyperplanes, and use their $(d-1)$-wise intersections to form $$ lines and their $d$-wise intersections to form $$ joints. Guth conjectured that this construction is optimal. Our technique builds on the work on Ruixiang Zhang proving the multijoints conjecture via an extension of the polynomial method. We set up a variational problem to control the high order of vanishing of a polynomial at each joint.

Recommendations

• On lines and joints
• Joints of varieties
• Counting joints with multiplicities
• The joints problem in \(\mathbb{R}^n\)
• On joints in arrangements of lines in space and related problems

Cites work

• scientific article; zbMATH DE number 6603592 (Why is no real title available?)
• scientific article; zbMATH DE number 1303711 (Why is no real title available?)
• A proof of the multijoints conjecture and Carbery's generalization
• Algebraic combinatorial geometry: the polynomial method in arithmetic combinatorics, incidence combinatorics, and number theory
• Algebraic methods in discrete analogs of the Kakeya problem
• An improved lower bound on the size of Kakeya sets over finite fields
• Counting and cutting cycles of lines and rods in space
• Counting multijoints
• Extensions to the method of multiplicities, with applications to Kakeya sets and mergers
• Extremal problems in discrete geometry
• Incidence bounds on multijoints and generic joints
• Incidence theorems and their applications
• Joints formed by lines and a \(k\)-plane, and a discrete estimate of Kakeya type
• Joints of varieties
• On lines and joints
• On sets defining few ordinary lines
• On the Erdős distinct distances problem in the plane
• On the multilinear restriction and Kakeya conjectures
• On the size of Kakeya sets in finite fields
• Sharp density bounds on the finite field Kakeya problem
• The endpoint case of the Bennett-Carbery-Tao multilinear Kakeya conjecture
• The joints problem in \(\mathbb{R}^n\)

Cited in

(8)

• Multijoints and factorisation
• Joints of varieties
• Kruskal-Katona-type problems via the entropy method
• Counting joints with multiplicities
• On lines and joints
• A proof of the multijoints conjecture and Carbery's generalization
• Non-transversal multilinear duality and joints
• The constant of point-line incidence constructions

This page was built for publication: Joints tightened

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