English
Related papers

Related papers: An arithmetic count of osculating lines

200 papers

Let $P$ be a set of $n$ points in general position in the plane. Let $R$ be a set of $n$ points disjoint from $P$ such that for every $x,y \in P$ the line through $x$ and $y$ contains a point in $R$ outside of the segment delimited by $x$…

Combinatorics · Mathematics 2019-08-20 Chaya Keller , Rom Pinchasi

Planar point sets with many triple lines (which contain at least three distinct points of the set) have been studied for 180 years, started with Jackson and followed by Sylvester. Green and Tao has shown recently that the maximum possible…

Combinatorics · Mathematics 2013-02-26 György Elekes , Endre Szabó

A positive definite quadratic form is called perfect, if it is uniquely determined by its arithmetical minimum and the integral vectors attaining it. In this self-contained survey we explain how to enumerate perfect forms in $d$ variables…

Number Theory · Mathematics 2011-10-20 Achill Schuermann

This is a detailed study of the infinitesimal variation of the variety of lines through a point of a low degree hypersurface in pro jective space. The motion is governed by a system of partial differential equations which we describe…

Algebraic Geometry · Mathematics 2008-10-09 J. M. Landsberg , C. Robles

A set $P = H \cup \{w\}$ of $n+1$ points in general position in the plane is called a wheel set if all points but $w$ are extreme. We show that for the purpose of counting crossing-free geometric graphs on such a set $P$, it suffices to…

Computational Geometry · Computer Science 2019-09-02 Alexander Pilz , Emo Welzl , Manuel Wettstein

Let $P$ be a set of $n$ points in the plane. A crossing-free structure on $P$ is a plane graph with vertex set $P$. Examples of crossing-free structures include triangulations of $P$, spanning cycles of $P$, also known as polygonalizations…

Computational Geometry · Computer Science 2013-12-18 Victor Alvarez , Karl Bringmann , Radu Curticapean , Saurabh Ray

We count by height the number of elliptic curves over the rationals that possess an isogeny of degree three.

Number Theory · Mathematics 2019-06-20 Maggie Pizzo , Carl Pomerance , John Voight

The combinatorics of certain osculating lattice paths is studied, and a relationship with oscillating tableaux is obtained. More specifically, the paths being considered have fixed start and end points on respectively the lower and right…

Combinatorics · Mathematics 2011-11-29 Roger E. Behrend

We estimate, in a number field, the number of elements and the maximal number of linearly independent elements, with prescribed bounds on their valuations. As a by-product, we obtain new bounds for the successive minima of ideal lattices.…

Number Theory · Mathematics 2024-11-18 Mikołaj Frączyk , Gergely Harcos , Péter Maga

The cycles are the only $2$-connected graphs in which any two nonadjacent vertices form a vertex cut. We generalize this fact by proving that for every integer $k\ge 3$ there exists a unique graph $G$ satisfying the following conditions:…

Combinatorics · Mathematics 2022-10-28 Yanan Hu , Xingzhi Zhan , Leilei Zhang

Let $F$ be a field with positive odd characteristic $p$. We prove a variety of new sum-product type estimates over $F$. They are derived from the theorem that the number of incidences between $m$ points and $n$ planes in the projective…

Combinatorics · Mathematics 2016-09-06 Oliver Roche-Newton , Misha Rudnev , Ilya D. Shkredov

Over the complex numbers, Pl\"ucker's formula computes the number of inflection points of a linear series of projective dimension $r$ and degree $d$ on a curve of genus $g$. Here we explore the geometric meaning of a natural analogue of…

Algebraic Geometry · Mathematics 2026-02-24 Ethan Cotterill , Ignacio Darago , Changho Han

Let $H$ be a set of $n$ halfplanes in $\mathbb{R}^2$ in general position, and let $k<n$ be a given parameter. We show that the number of vertices of the arrangement of $H$ that lie at depth exactly $k$ (i.e., that are contained in the…

Computational Geometry · Computer Science 2016-09-29 Sariel Har-Peled , Micha Sharir

We give formulas for the number of polynomials over a finite field with given root multiplicities, in particular in cases when the formula is surprisingly simple (a power of q). Besides this concrete interpretation, we also prove an…

Number Theory · Mathematics 2012-10-03 Ayah Almousa , Melanie Matchett Wood

Let $\mathcal A\subset\mathbb P^{k-1}$ be a rank $k$ arrangement of $n$ hyperplanes, with the property that any $k$ of the defining linear forms are linearly independent (i.e., $\mathcal A$ is called $k-$generic). We show that for any…

Algebraic Geometry · Mathematics 2016-01-27 Stefan Tohaneanu

Let $Y$ be the complement of a plane quartic curve $D$ defined over a number field. Our main theorem confirms the Lang-Vojta conjecture for $Y$ when $D$ is a generic smooth quartic curve, by showing that its integral points are confined in…

Number Theory · Mathematics 2017-02-14 Dohyeong Kim

Let $S$ be a finite set of points in the plane and let $\mathcal{T}(S)$ be the set of intersection points between pairs of lines passing through any two points in $S$. We characterize all configurations of points $S$ such that iteration of…

Metric Geometry · Mathematics 2007-05-23 Christopher J. Hillar , Darren L. Rhea

Let K be a finite field. We know that a half of elements of K* is a square. So it is natural to ask how many of them appear as x-coordinate of points on an elliptic curve over K. We consider a specific class of elliptic curves over finite…

Number Theory · Mathematics 2010-01-05 Yu Tsumura

A $3$-dimensional polytope $P$ is $k$-equiprojective when the projection of $P$ along any line that is not parallel to a facet of $P$ is a polygon with $k$ vertices. In 1968, Geoffrey Shephard asked for a description of all equiprojective…

Metric Geometry · Mathematics 2025-10-06 Théophile Buffière , Lionel Pournin

Suppose $G$ is a $k$-uniform hypergraph on $n$ vertices such that every $(k-1)$-subset $S$ of $V(G)$ belongs to at least $\delta n$ edges, where $\delta> 1/2$. Let $\Psi(G)$ denote the number of tight Hamilton cycles in $G$, that is, cyclic…

Combinatorics · Mathematics 2026-04-17 Felix Joos , Xinyue Xie
‹ Prev 1 8 9 10 Next ›