English
Related papers

Related papers: Real Zeuthen numbers for two lines

200 papers

We study the Tur\'{a}n problem for highly symmetric bipartite graphs arising from geometric shapes and periodic tilings commonly found in nature. 1. The prism $C_{2\ell}^{\square}:=C_{2\ell}\square K_{2}$ is the graph consisting of two…

Combinatorics · Mathematics 2023-08-29 Jun Gao , Oliver Janzer , Hong Liu , Zixiang Xu

For each pair $(Q_i,Q_j)$ of reference points and each real number $r$ there is a unique hyperplane $h \perp Q_iQ_j$ such that $d(P,Q_i)^2 - d(P,Q_j)^2 = r$ for points $P$ in $h$. Take $n$ reference points in $d$-space and for each pair…

Combinatorics · Mathematics 2010-01-26 Thomas Zaslavsky

The classical Chung-Feller theorem [2] tells us that the number of Dyck paths of length $n$ with $m$ flaws is the $n$-th Catalan number and independent on $m$. In this paper, we consider the refinements of Dyck paths with flaws by four…

Combinatorics · Mathematics 2008-12-16 Jun Ma , Yeong-Nan Yeh

The Tur\'an number of a graph $H$, denoted by $ex(n, H)$, is the maximum number of edges in any graph on $n$ vertices containing no $H$ as a subgraph. Let $P_k$ denote the path on $k$ vertices, $S_k$ denote the star on $k+1$ vertices and…

Combinatorics · Mathematics 2022-10-26 Tao Fang , Xiying Yuan

A long standing conjecture of Richter and Thomassen states that the total number of intersection points between any $n$ simple closed Jordan curves in the plane, so that any pair of them intersect and no three curves pass through the same…

Combinatorics · Mathematics 2014-12-23 János Pach , Natan Rubin , Gábor Tardos

We discuss, following Mikhalkin, Brugall\'e, and many others, the counting of curves on toric surfaces with prescribed genus, Newton polygon, and intersection pattern with the toric boundary divisor, both at assigned and unassigned points.…

Algebraic Geometry · Mathematics 2025-11-27 Thomas Dedieu

Tangent Spaces of V^r_d(L), Specific subschemes of C_d arising from various line bundles on C, are described. Then we proceed to prove Martense Theorem for these schemes, by which we determine curves C, which for some very ample line bundle…

Algebraic Geometry · Mathematics 2019-05-07 Ali Bajravani

Given a set $V$ of points in $\mathbb R^d$, two points $p$, $q$ from $V$ form a double-normal pair, if the set $V$ lies between two parallel hyperplanes that pass through $p$ and $q$, respectively, and that are orthogonal to the segment…

Combinatorics · Mathematics 2017-12-01 Andrey Kupavskii

The maximum rectilinear crossing number of a graph $G$ is the maximum number of crossings in a good straight-line drawing of $G$ in the plane. In a good drawing any two edges intersect in at most one point (counting endpoints), no three…

Combinatorics · Mathematics 2021-08-23 Joshua Fallon , Kirsten Hogenson , Lauren Keough , Mario Lomelí , Marcus Schaefer , Pablo Soberón

The famous Szemer\'{e}di-Trotter theorem states that any arrangement of $n$ points and $n$ lines in the plane determines $O(n^{4/3})$ incidences, and this bound is tight. In this paper, we prove the following Tur\'an-type result for…

Combinatorics · Mathematics 2020-06-23 Mozhgan Mirzaei , Andrew Suk

We show that if a set of points in $\mathbb{C}^2$ lies on a family of $m$ concurrent lines, and if one of those lines contains more than $m-2$ points, then there is a line passing through exactly two points of the set. The bound $m-2$ in…

Combinatorics · Mathematics 2020-09-30 Alex Cohen

Let $D$ be a straight-line drawing of a graph. The rectilinear 2-colored crossing number of $D$ is the minimum number of crossings between edges of the same color, taken over all possible 2-colorings of the edges of $D$. First, we show…

For a nonzero integer n, a set of m distinct nonzero integers {a_1,a_2,...,a_m} such that a_i a_j + n is a perfect square for all 1 <= i < j <= m, is called a D(n)-m-tuple. In this paper, by using properties of so-called regular Diophantine…

Number Theory · Mathematics 2020-10-12 Andrej Dujella , Vinko Petričević

In this paper we compute the number of rational curves with one node passing through a given number of points, lines and tangent to a given number of planes in $\mathbb{P}^3$.

Algebraic Geometry · Mathematics 2015-03-17 Dung Nguyen

The problem of Zarankiewicz asks for the maximum number of edges in a bipartite graph on $n$ vertices which does not contain the complete bipartite graph $K_{k,k}$ as a subgraph. A classical theorem due to K\H{o}v\'ari, S\'os, and Tur\'an…

Combinatorics · Mathematics 2021-04-05 Oliver Janzer , Cosmin Pohoata

We investigate the combinatorics of real double Hurwitz numbers with real positive branch points using the symmetric group. Our main focus is twofold. First, we prove correspondence theorems relating these numbers to counts of tropical real…

Algebraic Geometry · Mathematics 2019-10-14 Mathieu Guay-Paquet , Hannah Markwig , Johannes Rau

Using the theory of Diophantine m-tuples, i.e. sets with the property that the product of its any two distinct elements increased by 1 is a perfect square, we construct an elliptic curve over Q(t) of rank at least 4 with three non-trivial…

Number Theory · Mathematics 2021-08-30 Andrej Dujella

We solve a randomized version of the following open question: is there a strictly convex, bounded curve \gamma in the plane such that the number of rational points on \gamma, with denominator $n$, approaches infinity with $n$? Although this…

Metric Geometry · Mathematics 2019-02-20 Nick Gravin , Fedor Petrov , Sinai Robins , Dmitry Shiryaev

The generalized Tur\'an number for $H$ of $G$, denoted by $\ex(n,H,G)$, is the maximum number of copies of $H$ in an $n$-vertex $G$-free graph. When $H$ is an edge, $\ex(n,H,G)$ is the classical Tur\'an number $\ex(n,G)$. Let $P_k$ be the…

Combinatorics · Mathematics 2026-01-15 Yichen Wang , Ervin Győri

We obtain a formula for the number of genus two curves with a fixed complex structure of a given degree on a del-Pezzo surface that pass through an appropriate number of generic points of the surface. This is done by extending the…

Algebraic Geometry · Mathematics 2025-02-21 Indranil Biswas , Ritwik Mukherjee , Varun Thakre