English
Related papers

Related papers: Incidences between points and lines on a two-dimen…

200 papers

We solve a problem conjectured by Cheriyan, giving sharp bounds for incidence of certain edge partitions of the connected graph on $n$-vertices. We briefly discuss the history of the problem and relation to node connectivity of strongly…

Combinatorics · Mathematics 2020-10-06 Andean E. Medjedovic

We collect some results in combinatorial geometry that follow from an inequality of Langer in algebraic geometry. Langer's inequality gives a lower bound on the number of incidences between a point set and its spanned lines, and was…

Combinatorics · Mathematics 2018-02-23 Frank de Zeeuw

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

Consider the $(2+1)$D Discrete Gaussian (ZGFF, integer-valued Gaussian free field) model in an $L\times L$ box above a hard floor. Bricmont, El-Mellouki and Fr\"ohlich (1986) established that, at low enough temperature, this random surface…

Probability · Mathematics 2025-09-05 Joseph Chen , Eyal Lubetzky

On a hyperbolic Riemann surface, given two simple closed geodesics that intersect $n$ times, we address the question of a sharp lower bound $L_n$ on the length attained by the longest of the two geodesics. We show the existence of a surface…

Differential Geometry · Mathematics 2007-05-23 Thomas Gauglhofer , Hugo Parlier

A nonsingular surface of degree $d \geq 2$ in $\mathbb{P}^3$ over $\mathbb{F}_q$ has at most $((d-1)q+1)d$ $\mathbb{F}_q$-lines, and this bound is optimal for $d = 2, \sqrt{q}+1, q+1$.

Algebraic Geometry · Mathematics 2016-08-10 Masaaki Homma , Seon Jeong Kim

A configuration of the triple $(\mathcal{P}, \mathcal{L}, \mathcal{I})$ on the incidence relation which holds the properties of "Any two points are incident with at most one line" and "Any two lines are incident with at most one point". In…

Combinatorics · Mathematics 2023-03-28 Sezer Sorgun , Ali Gökhan Ertaş , İbrahim Gunaltili

For several embedded surfaces with zero self-intersection number in 4-manifolds, we show that an adjunction-type genus bound holds for at least one of the surfaces under certain conditions. For example, we derive certain adjunction…

Geometric Topology · Mathematics 2017-04-14 Hokuto Konno

We consider incidences among colored sets of lines in $\mathbb{R}^d$ and examine whether the existence of certain concurrences between lines of $k$ colors force the existence of at least one concurrence between lines of $k+1$ colors. This…

Computational Geometry · Computer Science 2018-03-19 Boris Bukh , Xavier Goaoc , Alfredo Hubard , Matthew Trager

We provide general formulae for the configurational exponents of an arbitrary polymer network connected to the surface of an arbitrary wedge of the two-dimensional plane, where the surface is allowed to assume a general mixture of boundary…

Statistical Mechanics · Physics 2009-10-31 M. T. Batchelor , D. Bennett-Wood , A. L. Owczarek

A point set $M$ in $m$-dimensional Euclidean space is called an integral point set if all the distances between the elements of $M$ are integers, and $M$ is not situated on an $(m-1)$-dimensional hyperplane. We improve the linear lower…

Combinatorics · Mathematics 2025-12-02 Nikolai Avdeev

We list up to M\"obius equivalence all possible degrees and embedding dimensions of real surfaces that are covered by at least two pencils of circles, together with the number of such pencils. In addition, we classify incidences between the…

Algebraic Geometry · Mathematics 2024-09-16 Niels Lubbes

A bipartite graph $G$ is semi-algebraic in $\mathbb{R}^d$ if its vertices are represented by point sets $P,Q \subset \mathbb{R}^d$ and its edges are defined as pairs of points $(p,q) \in P\times Q$ that satisfy a Boolean combination of a…

Combinatorics · Mathematics 2015-11-24 Jacob Fox , János Pach , Adam Sheffer , Andrew Suk , Joshua Zahl

We show that for $m$ points and $n$ lines in the real plane, the number of distinct distances between the points and the lines is $\Omega(m^{1/5}n^{3/5})$, as long as $m^{1/2}\le n\le m^2$. We also prove that for any $m$ points in the…

Metric Geometry · Mathematics 2015-12-31 Micha Sharir , Shakhar Smorodinsky , Claudiu Valculescu , Frank de Zeeuw

We improve the well-known Szemer\'edi-Trotter incidence bound for proper 3--dimensional point sets (defined appropriately)

Combinatorics · Mathematics 2011-09-06 György Elekes

We provide an estimate for the number of nontrivial integer points on the Pellian surface $t^2 - du^2 = 1$ in a bounded region. We give a lower bound on the size of fundamental solutions for almost all $d$ in a certain class, based on a…

Number Theory · Mathematics 2024-08-08 Yijie Diao

A classic theorem of Euclidean geometry asserts that any noncollinear set of $n$ points in the plane determines at least $n$ distinct lines. Chen and Chv\'atal conjectured that this holds for an arbitrary finite metric space, with a certain…

Combinatorics · Mathematics 2014-12-30 Pierre Aboulker , Xiaomin Chen , Guangda Huzhang , Rohan Kapadia , Cathryn Supko

We carry out in full generality and without fixing specific boundary conditions, the symmetry and charge analysis near a generic null surface for two and three dimensional (2d and 3d) gravity theories. In 2d and 3d there are respectively…

High Energy Physics - Theory · Physics 2020-12-02 H. Adami , M. M. Sheikh-Jabbari , V. Taghiloo , H. Yavartanoo , C. Zwikel

We prove a point-wise and average bound for the number of incidences between points and hyper-planes in vector spaces over finite fields. While our estimates are, in general, sharp, we observe an improvement for product sets and sets…

Classical Analysis and ODEs · Mathematics 2007-07-31 Derrick Hart , Alex Iosevich , Doowon Koh , Misha Rudnev

According to a classical result of Spencer, Szemer\'edi, and Trotter (1984), the maximum number of times the unit distance can occur among $n$ points in the plane is $O(n^{4/3})$. This is far from Erd\H{o}s's lower bound, $n^{1+O(1/\log\log…

Combinatorics · Mathematics 2025-07-22 János Pach , Orit E. Raz , József Solymosi
‹ Prev 1 4 5 6 7 8 10 Next ›