English
Related papers

Related papers: Joints of varieties

200 papers

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…

Combinatorics · Mathematics 2024-11-22 Hung-Hsun Hans Yu , Yufei Zhao

We generalize the joints problem to sets of varieties and prove almost sharp bound on the number of joints. As a special case, given a set of $N$ $2$-planes in $\mathbb{R}^6$, the number of points at which three $2$-planes intersect and…

Combinatorics · Mathematics 2016-06-29 Ben Yang

We establish new bounds on the number of tangencies and orthogonal intersections determined by an arrangement of curves. First, given a set of $n$ algebraic plane curves, we show that there are $O(n^{3/2})$ points where two or more curves…

Combinatorics · Mathematics 2018-07-10 Jordan S. Ellenberg , Jozsef Solymosi , Joshua Zahl

A joint of a set of lines $\mathcal{L}$ in $\mathbb{F}^d$ is a point that is contained in $d$ lines with linearly independent directions. The joints problem asks for the maximum number of joints that are formed by $L$ lines. Guth and Katz…

Combinatorics · Mathematics 2023-12-25 Ting-Wei Chao , Hung-Hsun Hans Yu

We extend (and somewhat simplify) the algebraic proof technique of Guth and Katz \cite{GK}, to obtain several sharp bounds on the number of incidences between lines and points in three dimensions. Specifically, we show: (i) The maximum…

Computational Geometry · Computer Science 2009-05-12 György Elekes , Haim Kaplan , Micha Sharir

Let $L$ be a set of $n$ lines in $\reals^d$, for $d\ge 3$. A {\em joint} of $L$ is a point incident to at least $d$ lines of $L$, not all in a common hyperplane. Using a very simple algebraic proof technique, we show that the maximum…

Computational Geometry · Computer Science 2009-06-03 Haim Kaplan , Micha Sharir , Eugenii Shustin

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…

Combinatorics · Mathematics 2014-08-26 Márton Hablicsek

Let $\mathcal{L}$ be a family of lines and let $\mathcal{P}$ be a family of $k$-planes in $\mathbb{F}^n$ where $\mathbb{F}$ is a field. In our first result we show that the number of joints formed by a $k$-plane in $\mathcal{P}$ together…

Combinatorics · Mathematics 2020-12-29 Anthony Carbery , Marina Iliopoulou

As a variant of the celebrated Szemer\'edi--Trotter theorem, Guth and Katz proved that $m$ points and $n$ lines in $\mathbb{R}^3$ with at most $\sqrt{n}$ lines in a common plane must determine at most $O(m^{1/2}n^{3/4})$ incidences for…

Combinatorics · Mathematics 2024-08-30 Andrew Suk , Ji Zeng

We prove the joints conjecture, showing that for any $N$ lines in ${\Bbb R}^3$, there are at most $O(N^{{3 \over 2}})$ points at which 3 lines intersect non-coplanarly. We also prove a conjecture of Bourgain showing that given $N^2$ lines…

Combinatorics · Mathematics 2008-12-08 Larry Guth , Nets Hawk Katz

Let $\mathfrak{L}$ be a collection of $L$ lines in $\R^3$ and $J$ the set of joints formed by $\mathfrak{L}$, i.e. the set of points each of which lies in at least 3 non-coplanar lines of $\mathfrak{L}$. It is known that $|J| \lesssim…

Combinatorics · Mathematics 2014-02-26 Marina Iliopoulou

We first describe a reduction from the problem of lower-bounding the number of distinct distances determined by a set $S$ of $s$ points in the plane to an incidence problem between points and a certain class of helices (or parabolas) in…

Computational Geometry · Computer Science 2010-05-07 György Elekes , Micha Sharir

We prove bounds on intersections of algebraic varieties in $\mathbb{C}^4$ with Cartesian products of finite sets from $\mathbb{C}^2$, and we point out connections with several classic theorems from combinatorial geometry. Consider an…

Combinatorics · Mathematics 2017-12-21 Hossein Nassajian Mojarrad , Thang Pham , Claudiu Valculescu , Frank de Zeeuw

Suppose that each proper subset of a set $S$ of points in a vector space is contained in the union of planes of specified dimensions, but $S$ itself is not contained in any such union. How large can $|S|$ be? We prove a general upper bound…

Combinatorics · Mathematics 2025-02-14 Hailong Dao , Manik Dhar , Izabella Łaba , Ben Lund

Let $P$ be a set of $m$ points and $L$ a set of $n$ lines in $\mathbb R^4$, such that the points of $P$ lie on an algebraic three-dimensional surface of degree $D$ that does not contain hyperplane or quadric components, and no 2-flat…

Combinatorics · Mathematics 2016-09-29 Micha Sharir , Noam Solomon

We prove an incidence theorem for points and planes in the projective space $\mathbb P^3$ over any field $\mathbb F$, whose characteristic $p\neq 2.$ An incidence is viewed as an intersection along a line of a pair of two-planes from two…

Combinatorics · Mathematics 2015-12-07 Misha Rudnev

It is shown that the number of distinct types of three-point hinges, defined by a real plane set of $n$ points is $\gg n^2\log^{-3} n$, where a hinge is identified by fixing two pair-wise distances in a point triple. This is achieved via…

Combinatorics · Mathematics 2020-03-12 Misha Rudnev

We present a universal knot polynomials for 2- and 3-strand torus knots in adjoint representation, by universalization of appropriate Rosso-Jones formula. According to universality, these polynomials coincide with adjoined colored HOMFLY…

High Energy Physics - Theory · Physics 2018-01-09 A. Mironov , R. Mkrtchyan , A. Morozov

We prove a new upper bound on the number of $r$-rich lines (lines with at least $r$ points) in a `truly' $d$-dimensional configuration of points $v_1,\ldots,v_n \in \mathbb{C}^d$. More formally, we show that, if the number of $r$-rich lines…

Combinatorics · Mathematics 2014-12-03 Zeev Dvir , Sivakanth Gopi

For a finite point set $E\subset \mathbb{R}^d$ and a connected graph $G$ on $k+1$ vertices, we define a $G$-framework to be a collection of $k + 1$ points in E such that the distance between a pair of points is specified if the…

Combinatorics · Mathematics 2018-05-22 A. Iosevich , J. Passant
‹ Prev 1 2 3 10 Next ›