English
Related papers

Related papers: On Dirac and Motzkin problem in discrete geometry

200 papers

The topology of the intersection of three quadrics in Euclidean 6-space is studied using Kollar results. This needs an existence of a line without real points in the complex projectivisation of quadrics. We establish the existence of such a…

Algebraic Geometry · Mathematics 2012-05-01 I. Shnurnikov

Let $P$ be a set of $n$ points in the real plane contained in an algebraic curve $C$ of degree $d$. We prove that the number of distinct distances determined by $P$ is at least $c_d n^{4/3}$, unless $C$ contains a line or a circle. We also…

Metric Geometry · Mathematics 2016-07-20 János Pach , Frank de Zeeuw

Let $\mathcal{K}$ denote a nonsingular conic in the complex projective plane. Pascal's theorem says that, given six distinct points $A,B,C,D,E,F$ on $\mathcal{K}$, the three intersection points $AE \cap BF, AD \cap CF, BD \cap CE$ are…

Algebraic Geometry · Mathematics 2022-07-26 Jaydeep Chipalkatti , Sergio Da Silva

The study of extremal problems on triangle areas was initiated in a series of papers by Erd\H{o}s and Purdy in the early 1970s. In this paper we present new results on such problems, concerning the number of triangles of the same area that…

Combinatorics · Mathematics 2013-12-17 Adrian Dumitrescu , Micha Sharir , Csaba D. Toth

Present article deals with trajectorial intersections in linear fractional systems ('systems'). We propose a classification of intersections of trajectories in three classes viz. trajectories intersecting at same time(EIST), trajectories…

Dynamical Systems · Mathematics 2018-08-08 Amey Deshpande , Varsha Daftardar-Gejji , Palaniappan Vellaisamy

The symmetric case of the Szemer\'edi-Trotter theorem says that any configuration of $N$ lines and $N$ points in the plane has at most $O(N^{4/3})$ incidences. We describe a recipe involving just $O(N^{1/3})$ parameters which sometimes…

Combinatorics · Mathematics 2023-03-31 Nets Katz , Olivine Silier

Poncelet's theorem states that if there exists an n-sided polygon which is inscribed in a given conic C and circumscribed about another conic D, then there are infinitely many such n-gons. Proofs of this theorem that we are aware of,…

Algebraic Geometry · Mathematics 2023-03-07 Shin-Yao Jow , Chia-Tz Liang

We consider the optical and transport properties in a model two-dimensional Hamiltonian which describes the merging of two Dirac points. At low energy, in the presence of an energy gap parameter $\Delta$, there are two distinct Dirac points…

Mesoscale and Nanoscale Physics · Physics 2019-08-09 J. P. Carbotte , E. J. Nicol

We study supersolvable line arrangements in ${\mathbb P}^2$ over the reals and over the complex numbers, as the first step toward a combinatorial classification. Our main results show that a nontrivial (i.e., not a pencil or near pencil)…

Algebraic Geometry · Mathematics 2019-07-19 Krishna Hanumanthu , Brian Harbourne

Let $\mathcal{Q}_1$ and $\mathcal{Q}_2$ be two arbitrary quadrics with no common hyperplane in ${\mathbb{P}}^n(\mathbb{F}_q)$. We give the best upper bound for the number of points in the intersection of these two quadrics. Our result…

Combinatorics · Mathematics 2009-07-28 Frédéric A. B. Edoukou , San Ling , Chaoping Xing

We consider a class of discontinuous piecewise linear differential systems in $\mathbb{R}^3$ with two pieces separated by a plane. In this class we show that there exist differential systems having: a unique limit cycle, a unique…

Dynamical Systems · Mathematics 2017-08-25 Bruno Rodrigues de Freitas , João Carlos Medrado

We consider the problem of testing, for a given set of planar regions $\cal R$ and an integer $k$, whether there exists a convex shape whose boundary intersects at least $k$ regions of $\cal R$. We provide a polynomial time algorithm for…

Solutions to the collinear three-body problem which do not end in triple collision pass through an infinite number of binary collisions. Given three masses, we show that four geometric quantities generate a finite description of itineraries…

Dynamical Systems · Mathematics 2007-05-23 Samuel R. Kaplan

Let $L$ be a set of $n$ axis-parallel lines in $\mathbb{R}^3$. We are are interested in partitions of $\mathbb{R}^3$ by a set $H$ of three planes such that each open cell in the arrangement $\mathcal{A}(H)$ is intersected by as few lines…

Computational Geometry · Computer Science 2023-12-25 Boris Aronov , Abdul Basit , Mark de Berg , Joachim Gudmundsson

We examine the behavior of $n$ Brownian particles diffusing on the real line with bounded, measurable drift and bounded, piecewise continuous diffusion coefficients that depend on the current configuration of particles. Sufficient…

Probability · Mathematics 2010-10-19 Tomoyuki Ichiba , Ioannis Karatzas

The present work considers the properties of classes of generally convex sets in the plane known as $1$-semiconvex and weakly $1$-semiconvex. More specifically, the examples of open and closed weakly $1$-semiconvex but non $1$-semiconvex…

Metric Geometry · Mathematics 2020-02-11 T. M. Osipchuk

The paper is concerned with families of plane algebraic curves that contain a given and quite special finite set X of points in the projective plane. We focus on the case in which the set X is formed by transversally intersecting pairs of…

Algebraic Geometry · Mathematics 2007-05-23 Gabriel Katz

We show that any set of $n$ points in general position in the plane determines $n^{1-o(1)}$ pairwise crossing segments. The best previously known lower bound, $\Omega\left(\sqrt n\right)$, was proved more than 25 years ago by Aronov, Erd\H…

Combinatorics · Mathematics 2023-05-02 János Pach , Natan Rubin , Gábor Tardos

In 2008, Chen and Chv\'atal conjectured that in every finite metric space of $n$ points, there are at least $n$ distinct lines, or the whole set of points is a line. This is a generalization of a classical result in the Euclidean plane. The…

Combinatorics · Mathematics 2025-12-16 Martín Matamala , Luciano Villarroel-Sepúlveda

If two closed Jordan curves in the plane have precisely one point in common, then it is called a {\em touching point}. All other intersection points are called {\em crossing points}. The main result of this paper is a Crossing Lemma for…

Combinatorics · Mathematics 2015-07-08 János Pach , Natan Rubin , Gábor Tardos
‹ Prev 1 8 9 10 Next ›