English
Related papers

Related papers: On four-rich points defined by pencils

200 papers

According to a conjecture of Pach, there are $O(n)$ tangent pairs among any family of $n$ Jordan arcs in which every pair of arcs has precisely one common point and no three arcs share a common point. This conjecture was proved for two…

Combinatorics · Mathematics 2026-03-13 Eyal Ackerman , Balázs Keszegh

let f be an endomorphism of a complex projective space, of degree bigger than one. Let us call an algebraic subset exceptional for f, if its inverse image is set-theoretically equal to itself. J.-Y. Briend, S. Cantat and M. Shishikura…

Algebraic Geometry · Mathematics 2007-05-23 E. Amerik , F. Campana

Let $\mathcal{F}$ be a plane singular curve defined over a finite field $\mathbb{F}_q$. The linear system of plane curves of a given degree passing through the singularities of $\cF$ provides potentially good bounds for the number of points…

Number Theory · Mathematics 2017-05-12 Nazar Arakelian

We prove the sharp bound of at most 64 lines on complex projective quartic surfaces (resp. affine quartics) that are not ruled by lines. We study configurations of lines on certain non-K3 surfaces of degree four and give various examples of…

Algebraic Geometry · Mathematics 2017-05-23 Víctor González-Alonso , Sławomir Rams

We give explicit bounds on sums of $d(n)^2$ and $d_4(n)$, where $d(n)$ is the number of divisors of $n$ and $d_4(n)$ is the number of ways of writing $n$ as a product of four numbers. In doing so we make a slight improvement on the upper…

Number Theory · Mathematics 2021-02-02 Michaela Cully-Hugill , Timothy Trudgian

The program of understanding Shape Theory layer by layer topologically and geometrically -- proposed in Part I -- is now addressed for 4 points in 1-$d$. Topological shape space graphs are far more complex here, whereas metric shape spaces…

General Relativity and Quantum Cosmology · Physics 2018-02-15 Edward Anderson

It is known for a long time that a nonsingular real algebraic curve of degree 2k in the projective plane cannot have more than 7/2*k^2-9/4*k+3/2$ even ovals. We show here that this upper bound is asymptotically sharp, that is to say we…

Algebraic Geometry · Mathematics 2007-05-23 Erwan brugalle

The Thue-Siegel method is used to obtain an upper bound for the number of primitive integral solutions to a family of quartic Thue's inequalities. This will provide an upper bound for the number of integer points on a family of elliptic…

Number Theory · Mathematics 2015-06-12 Shabnam Akhtari

We introduce an invariant of umbilic points on surfaces in the Euclidean or Minkowski 3-space that counts the maximum number of stable umbilic points they can split up under deformations of the surfaces. We call that number the multiplicity…

Differential Geometry · Mathematics 2022-08-31 Marco Antonio do Couto Fernandes , Farid Tari

A set of n non-collinear points in the Euclidean plane defines at least n different lines. Chen and Chv\'atal in 2008 conjectured that the same results is true in metric spaces for an adequate definition of line. More recently, this…

Metric Geometry · Mathematics 2022-09-22 Gabriela Araujo-Pardo , Martín Matamala , José Zamora

The desmic pencil of quartic surfaces is part of a beautiful, but mostly forgotten chapter of the classical theory of algebraic surfaces: it is the only non-degenerate pencil of surfaces in P3 containing at least three completely reducible…

Algebraic Geometry · Mathematics 2025-08-25 Laurent Manivel

A non-empty word $w$ is a \emph{border} of a word $u$ if $\vert w\vert<\vert u\vert$ and $w$ is both a prefix and a suffix of $u$. A word $u$ is \emph{privileged} if $\vert u\vert\leq 1$ or if $u$ has a privileged border $w$ that appears…

Combinatorics · Mathematics 2022-09-13 Josef Rukavicka

In this paper we study combinatorial invariants of the equivalence classes of pencils of cubics on $\mathrm{PG}(1,q)$, for $q$ odd and $q$ not divisible by 3. These equivalence classes are considered as orbits of lines in…

Combinatorics · Mathematics 2021-04-13 Gülizar Günay , Michel Lavrauw

We consider circular version of the famous Nelson-Hadwiger problem. It is know that 4 colors are necessary and 7 colors suffice to color the euclidean plane in such a way that points at distance one get different colors. In $r$-circular…

Combinatorics · Mathematics 2015-06-08 Konstanty Junosza-Szaniawski

A \emph{square} is a word of the form $uu$, where $u$ is a nonempty finite word. Given a finite word $w$ of length $n$, let $[w]$ denote the corresponding \emph{circular word}, i.e., the set of all cyclic rotations of $w$. We study the…

Combinatorics · Mathematics 2026-05-13 Shuo Li , Yuan Song

We prove that $n$ plane algebraic curves determine $O(n^{(k+2)/(k+1)})$ points of $k$-th order tangency. This generalizes an earlier result of Ellenberg, Solymosi, and Zahl on the number of (first order) tangencies determined by $n$ plane…

Combinatorics · Mathematics 2020-04-01 Joshua Zahl

Let $G\subset SO(4)$ denote a finite subgroup containing the Heisenberg group. In these notes we classify all these groups, we find the dimension of the spaces of $G$-invariant polynomials and we give equations for the generators whenever…

Algebraic Geometry · Mathematics 2007-05-23 Alessandra Sarti

For a positive integer $k$ and an ordered set of $n$ points in the plane, define its k-sector ordered Yao graphs as follows. Divide the plane around each point into $k$ equal sectors and draw an edge from each point to its closest…

Combinatorics · Mathematics 2025-04-29 Péter Ágoston , Adrian Dumitrescu , Arsenii Sagdeev , Karamjeet Singh , Ji Zeng

For various triple systems $F$, we give tight lower bounds on the number of copies of $F$ in a triple system with a prescribed number of vertices and edges. These are the first such results for hypergraphs, and extend earlier theorems of…

Combinatorics · Mathematics 2009-05-14 Dhruv Mubayi

Let $P$ be a collection of $n$ points moving along pseudo-algebraic trajectories in the plane. One of the hardest open problems in combinatorial and computational geometry is to obtain a nearly quadratic upper bound, or at least a subcubic…

Computational Geometry · Computer Science 2013-04-15 Natan Rubin
‹ Prev 1 8 9 10 Next ›