English
Related papers

Related papers: Real Zeuthen numbers for two lines

200 papers

For any number field $K$ and integer $0\leq r \leq 4$, we prove that there are infinitely many elliptic curves over $K$ of rank $r$. Our elliptic curves are obtained by specializing well-chosen nonisotrivial elliptic curves over the…

Number Theory · Mathematics 2026-02-12 David Zywina

Suppose that 2d-2 tangent lines to the rational normal curve z\mapsto (1 : z : ... : z^d) in d-dimensional complex projective space are given. It was known that the number of codimension 2 subspaces intersecting all these lines is always…

Algebraic Geometry · Mathematics 2007-05-23 A. Eremenko , A. Gabrielov

We prove the following theorem, which is related to McMullen's problem on projective transformations of polytopes; let $2\leq k\leq \lfloor{\frac{d}{2}}\rfloor$ and $\nu{(d, k)}$ be the largest number such that any set of $\nu{(d,k)}$…

Combinatorics · Mathematics 2013-03-18 Natalia Garcia-Colin , David Larman

Let $\mathcal{F}$ be a family of $r$-graphs. The Tur\'an number $ex_r(n;\mathcal{F})$ is defined to be the maximum number of edges in an $r$-graph of order $n$ that is $\mathcal{F}$-free. The famous Erd\H{o}s Matching Conjecture shows that…

Combinatorics · Mathematics 2018-12-11 Jian Wang , Weihua Yang

Zykov's theorem shows that $r$-partite Tur\'{a}n graph uniquely has the maximum number of $K_t$ among all $n$-vertex $K_{r+1}$-free graphs for $2\le t\le r$. The clique tensor is a high-order extension of the adjacency matrix of a graph. Yu…

Combinatorics · Mathematics 2026-03-31 Changjiang Bu , Jueru Liu , Haotian Zeng

The celebrated upper bound theorem of McMullen determines the maximal number of extreme points of a polyhedron in terms of its dimension and the number of constraints which define it, showing that the maximum is attained by the polar of the…

Combinatorics · Mathematics 2010-11-04 Xavier Allamigeon , Stephane Gaubert , Ricardo D. Katz

In arXiv:1505.04338(4), G. Mikhalkin introduced a refined count for the real rational curves in a toric surface which pass through certain conjugation invariant set of points on the toric boundary of the surface. Such a set consists of real…

Algebraic Geometry · Mathematics 2020-02-04 Thomas Blomme

We consider coverings of real algebraic curves to real rational algebraic curves. We show the existence of such coverings having prescribed topological degree on the real locus. From those existence results we prove some results on…

Algebraic Geometry · Mathematics 2011-07-26 Marc Coppens , Johannes Huisman

The planar Tur\'an number of a graph $H$, denoted $ex_{_\mathcal{P}}(n,H)$, is the maximum number of edges in a planar graph on $n$ vertices without containing $H$ as a subgraph. This notion was introduced by Dowden in 2016 and has…

Combinatorics · Mathematics 2022-02-25 Yongxin Lan , Yongtang Shi , Zi-Xia Song

A double-normal pair of a finite set $S$ of points from $R^d$ is a pair of points $\{p,q\}$ from $S$ such that $S$ lies in the closed strip bounded by the hyperplanes through $p$ and $q$ perpendicular to $pq$. A double-normal pair $pq$ is…

Metric Geometry · Mathematics 2019-02-20 János Pach , Konrad Swanepoel

We construct algebraic curves in abelian surfaces starting from tropical curves in real tori. We give a necessary and sufficient condition for a tropical curve in a real torus to be realizable by an algebraic curve in an abelian surface.…

Algebraic Geometry · Mathematics 2020-08-03 Takeo Nishinou

There are 42 types of real singular points for irreducible real quintic curves and 49 types of real singular points for reducible real quintic curves. The classification of real singular points for irreducible real quintic curves is…

Algebraic Geometry · Mathematics 2008-07-02 David A. Weinberg , Nicholas J. Willis

A nut graph is a nontrivial simple graph whose adjacency matrix has a simple eigenvalue zero such that the corresponding eigenvector has no zero entries. It is known that the order $n$ and degree $d$ of a vertex-transitive nut graph satisfy…

Combinatorics · Mathematics 2026-01-14 Ivan Damnjanović

Given a rational elliptic surface X over an algebraically closed field, we investigate whether a given natural number k can be the intersection number of two sections of X. If not, we say that k a gap number. We try to answer when gap…

Number Theory · Mathematics 2023-01-10 Renato Dias Costa

We present a computational study of smooth curves of degree six in the real projective plane. In the Rokhlin-Nikulin classification, there are 56 topological types, refined into 64 rigid isotopy classes. We developed software that…

Algebraic Geometry · Mathematics 2018-04-20 Nidhi Kaihnsa , Mario Kummer , Daniel Plaumann , Mahsa Sayyary Namin , Bernd Sturmfels

Let G be a simple graph without isolated vertices. For a vertex i in G, the degree d_i is the number of vertices adjacent to i and the average 2-degree m_i is the mean of the degrees of the vertices which are adjacent to i. The sequence of…

Combinatorics · Mathematics 2018-11-08 Yu-pei Huang , Chia-an Liu , Chih-wen Weng

There are thirteen types of singular points for irreducible real quartic curves and seventeen types of singular points for reducible real quartic curves. This classification is originally due to D.A. Gudkov. There are nine types of singular…

Algebraic Geometry · Mathematics 2007-07-03 David A. Weinberg , Nicholas J. Willis

The odd dimensional projective space $\mathbb{P}^{2n-1}$ admits a contact structure arising from a non integrable distribution of hyperplanes determined by a symplectic form in $\mathbb{C}^{2n}$. Our object of interest is the set of…

Algebraic Geometry · Mathematics 2019-07-10 Eden Amorim

Let $\{U(m)\}_{m\in \N}$ and $\{V(n)\}_{n\in \N}$ be linear recurrence sequences. It is a well-known Diophantine problem to determine the finiteness of the set of natural numbers $n$ such that the ratio $U(n)/V(n)$ is an integer. We study…

Number Theory · Mathematics 2026-05-08 Parvathi S Nair , S. S. Rout

Given a graph H, we call a graph $\textit{H-free}$ if it does not contain H as a subgraph. The planar Tur\'an number of a graph H, denoted by $ex_{\mathcal{P}}(n, H)$, is the maximum number of edges in a planar H-free graph on n vertices. A…

Combinatorics · Mathematics 2025-07-17 Huiqing Liu , Tian Xie , Qin Zhao