English
Related papers

Related papers: On submaximal plane curves

200 papers

We prove a new, tight upper bound on the number of incidences between points and hyperplanes in Euclidean d-space. Given n points, of which k are colored red, there are O_d(m^{2/3}k^{2/3}n^{(d-2)/3} + kn^{d-2} + m) incidences between the k…

Combinatorics · Mathematics 2012-01-10 Ben D. Lund , George B. Purdy , Justin W. Smith

Multipoles are the pieces we obtain by cutting some edges of a cubic graph. As a result of the cut, a multipole $M$ has dangling edges with one free end, which we call semiedges. Then, every 3-edge-coloring of a multipole induces a coloring…

Combinatorics · Mathematics 2013-08-05 M. A. Fiol , J. Vilaltella

Given a smooth projective curve C defined over a number field and given two elliptic surfaces E_1/C and E_2/C along with sections P_i and Q_i of E_i (for i = 1,2), we prove that if there exist infinitely many algebraic points t on C such…

Number Theory · Mathematics 2017-03-07 Dragos Ghioca , Liang-Chung Hsia , Thomas J. Tucker

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 $n$ be a positive integer and let $S$ be a sequence of $n$ integers in the interval $[0,n-1]$. If there is an $r$ such that any nonempty subsequence with sum $\equiv 0$ $\pmod n$ has length $=r,$ then $S$ has at most two distinct…

Number Theory · Mathematics 2009-03-02 Weidong Gao , Y. O. Hamidoune , Guoqing Wang

Let $P$ be a set of $n$ points in the plane, and let $\mathcal C$ be a collection of $n$ simple $k$-intersecting curves, meaning that every two distinct curves of $\mathcal C$ meet in at most $k$ points. A classical theorem of Pach and…

Combinatorics · Mathematics 2026-05-21 Andrew Suk , Su Zhou

Given n general points p_1, p_2,..., p_n \in P^r, it is natural to ask whether there is a curve of given degree d and genus g passing through them; by counting dimensions a natural conjecture is that such a curve exists if and only if \[n…

Algebraic Geometry · Mathematics 2019-04-29 Eric Larson

We apply Murasugi-Tristram inequality to real algebraic curves of odd degree on $RP^2$ with a deep nest, i.e. a nest of the depth $k-1$ where $2k+1$ is the degree. For such curves, the ingredients of the Murasugi-Tristram inequality can be…

Geometric Topology · Mathematics 2007-05-23 Stepan Yu Orevkov

We compute some numerical invariants of the lines on hyperplane sections of a smooth cubic threefold over complex numbers. We also prove that for any smooth hypersurface $X\subset \mathbb P^{n+1}$ of degree $d$ over an algebraically closed…

Algebraic Geometry · Mathematics 2020-07-08 Yiran Cheng

Given a rank 3 real arrangement $\mathcal A$ of $n$ lines in the projective plane, the Dirac-Motzkin conjecture (proved by Green and Tao in 2013) states that for $n$ sufficiently large, the number of simple intersection points of $\mathcal…

Combinatorics · Mathematics 2015-05-12 Benjamin Anzis , Stefan Tohaneanu

A sequence $S$ is potentially $K_{m}-P_{k}$ graphical if it has a realization containing a $K_{m}-P_{k}$ as a subgraph. Let $\sigma(K_{m}-P_{k}, n)$ denote the smallest degree sum such that every $n$-term graphical sequence $S$ with…

Combinatorics · Mathematics 2007-05-23 Chunhui Lai

The Erd\H{o}s-Szekeres conjecture states that any set of more than $2^{n-2}$ points in the plane with no three on a line contains the vertices of a convex $n$-gon. Erd\H{o}s, Tuza, and Valtr strengthened the conjecture by stating that any…

Combinatorics · Mathematics 2022-10-11 Jineon Baek

Using constructions of the Whitham perturbation theory of integrable system we prove a new sharp upper bound of $3g/2-2$ on the dimension of complete subvarieties of $\M_g^{ct}$.

Algebraic Geometry · Mathematics 2013-08-19 I. Krichever

We show that the maximal number of singular moves required to pass between any two regularly homotopic planar or spherical curves with at most n crossings, grows quadratically with respect to n. Furthermore, this can be done with all curves…

Geometric Topology · Mathematics 2008-02-22 Tahl Nowik

We prove that the following problem has the same computational complexity as the existential theory of the reals: Given a generic self-intersecting closed curve $\gamma$ in the plane and an integer $m$, is there a polygon with $m$ vertices…

Computational Geometry · Computer Science 2019-08-28 Jeff Erickson

The Milnor formula $\mu=2\delta-r+1$ relates the Milnor number $\mu$, the double point number $\delta$ and the number $r$ of branches of a plane curve singularity. It holds over the fields of characteristic zero. Melle and Wall based on a…

Algebraic Geometry · Mathematics 2018-12-18 Evelia R. García Barroso , Arkadiusz Płoski

We obtain upper bounds for the multiplicity of an isolated solution of a system of equations $f_1=...= f_M =0$ in $M$ variables, where the set of polynomials $(f_1,..., f_M)$ is a tuple of general position in a subvariety of a given…

Algebraic Geometry · Mathematics 2012-05-10 Aleksandr Pukhlikov

We establish the optimal lower bound $\gtrsim N$ for counting the number of distinct inner products of pairs from any $N$ given vectors in $\R^2$. Essentially, we lift a related incidence structure defined by inner products in the plane to…

Combinatorics · Mathematics 2022-01-13 Zhipeng Lu

Examples of algebraic surfaces of general type with maximal Picard number are not abundant in the literature. Moreover, most known examples either possess low invariants, lie near the Noether line $K^2=2\chi-6$ or are somewhat scattered. A…

Algebraic Geometry · Mathematics 2024-11-20 Nguyen Bin , Vicente Lorenzo

A curve in the plane is $x$-monotone if every vertical line intersects it at most once. A family of curves are called pseudo-segments if every pair of them have at most one point in common. We construct $2^{\Omega(n^{4/3})}$ families, each…

Combinatorics · Mathematics 2026-01-12 Jacob Fox , Janos Pach , Andrew Suk
‹ Prev 1 4 5 6 7 8 10 Next ›