English
Related papers

Related papers: The no-three-in-line problem on a torus

200 papers

We study the maximum number of crossing limit cycles in piecewise-smooth vector fields on the two-dimensional torus, where the discontinuity set is the boundary of the fundamental square. Under the assumption of a polynomial first integral…

Dynamical Systems · Mathematics 2025-08-14 Thaylon Souza de Oliveira , Ricardo Miranda Martins

Let P be a set of n points in the plane, not all on a line. We show that if n is large then there are at least n/2 ordinary lines, that is to say lines passing through exactly two points of P. This confirms, for large n, a conjecture of…

Combinatorics · Mathematics 2015-03-20 Ben Green , Terence Tao

For a given genus $g \geq 1$, we give lower bounds for the maximal number of rational points on a smooth projective absolutely irreducible curve of genus $g$ over ${\mathbb F}_q$. As a consequence of Katz-Sarnak theory, we first get for any…

Number Theory · Mathematics 2022-05-03 Jonas Bergström , Everett W. Howe , Elisa Lorenzo García , Christophe Ritzenthaler

We give a fairly elementary and simple proof that shows that the number of incidences between $m$ points and $n$ lines in ${\mathbb R}^3$, so that no plane contains more than $s$ lines, is $$ O\left(m^{1/2}n^{3/4}+ m^{2/3}n^{1/3}s^{1/3} + m…

Combinatorics · Mathematics 2015-01-13 Micha Sharir , Noam Solomon

Let $T(n)$ denote the maximum number of unit distances that a set of $n$ points in the Euclidean plane $\mathbb{R}^2$ can determine with the additional condition that the distinct unit length directions determined by the configuration must…

Metric Geometry · Mathematics 2014-06-26 Mark Herman , Jonathan Pakianathan

The celebrated Szemer\'edi--Trotter theorem states that the maximum number of incidences between $n$ points and $n$ lines in the plane is $O(n^{4/3})$, which is asymptotically tight. Solymosi (2005) conjectured that for any set of points…

Combinatorics · Mathematics 2025-09-29 Martin Balko , Nóra Frankl

We estimate the number of lines on a non-K3 quartic surface. Such a surface with only isolated double point(s) contains at most twenty lines; this bound is attained by a unique configuration of lines and by a surface with a certain limited…

Algebraic Geometry · Mathematics 2025-07-01 Alex Degtyarev , Sławomir Rams

We consider the semi-linear beam equation on the d dimensional irrational torus with smooth nonlinearity of order n -- 1 with n $\ge$ 3 and d $\ge$ 2. If $\epsilon$ $\ll$ 1 is the size of the initial datum, we prove that the lifespan…

Analysis of PDEs · Mathematics 2021-05-13 Joackim Bernier , Roberto Feola , Benoît Grébert , Felice Iandoli

A drawing of a graph in the plane is called a thrackle if every pair of edges meets precisely once, either at a common vertex or at a proper crossing. Let t(n) denote the maximum number of edges that a thrackle of n vertices can have.…

Combinatorics · Mathematics 2010-02-23 Radoslav Fulek , Janos Pach

The problem of determining the maximum number of edges in an $n$-vertex graph that does not contain a 4-cycle has a rich history in extremal graph theory. Using Sidon sets constructed by Bose and Chowla, for each odd prime power $q$ we…

Combinatorics · Mathematics 2014-01-21 Michael Tait , Craig Timmons

We show that any non-minimal bridge decomposition of a torus knot is stabilized and that $n$-bridge decompositions of a torus knot are unique for any integer $n$. This implies that a knot in a bridge position is a torus knot if and only if…

Geometric Topology · Mathematics 2015-05-19 Makoto Ozawa

The Zarankiewicz problem asks for an estimate on $z(m, n; s, t)$, the largest number of $1$'s in an $m \times n$ matrix with all entries $0$ or $1$ containing no $s \times t$ submatrix consisting entirely of $1$'s. We show that a classical…

Combinatorics · Mathematics 2021-07-01 David Conlon

Let $E$ be an elliptic curve defined over $\mathbb Q$. Let $\Gamma$ be a subgroup of $E(\mathbb Q)$ and $P\in E(\mathbb Q)$. In [1], it was proved that if $E$ has no nontrivial rational torsion points, then $P\in\Gamma$ if and only if $P\in…

Number Theory · Mathematics 2016-05-11 Mohammad Sadek

Littlewood asked for the maximum number $N$ of congruent infinite cylinders that can be arranged in $\mathbb{R}^3$ so that every pair touches. We improve upon the proof of the second author that $N \leq 18$ to show that $N \leq 10$.…

Combinatorics · Mathematics 2025-10-07 Travis Dillon , Junnosuke Koizumi , Sammy Luo

Given a right-angled triangle of squares in a grid whose horizontal and vertical sides are $n$ squares long, let N(n) denote the maximum number of dots that can be placed into the cells of the triangle such that each row, each column, and…

Discrete Mathematics · Computer Science 2010-05-19 Simon R. Blackburn , Maura B. Paterson , Douglas R. Stinson

The topological Tur\'an number $\mathrm{ex}_{\hom}(n,X)$ of a 2-dimensional simplicial complex $X$ asks for the maximum number of edges in an $n$-vertex 3-uniform hypergraph containing no triangulation of $X$ as a subgraph. We prove that…

Combinatorics · Mathematics 2026-05-14 Maya Sankar

Planar Tur\'an number, denoted by $ex_{\mathcal{P}}(n,H)$, is the maximum number of edges in an $n$-vertex planar graph which does not contain $H$ as a subgraph. Ghosh, Gy\H{o}ri, Paulos and Xiao initiated the topic of the planar Tur\'an…

Combinatorics · Mathematics 2024-06-11 Xin Xu , Qiang Zhou , Tong Li , Guiying Yan

We consider the structure of rational points on elliptic curves in Weierstrass form. Let x(P)=A_P/B_P^2 denote the $x$-coordinate of the rational point P then we consider when B_P can be a prime power. Using Faltings' Theorem we show that…

Number Theory · Mathematics 2007-05-23 Graham Everest , Jonathan Reynolds , Shaun Stevens

We consider packings of congruent circles on a square flat torus, i.e., periodic (w.r.t. a square lattice) planar circle packings, with the maximal circle radius. This problem is interesting due to a practical reason - the problem of "super…

Metric Geometry · Mathematics 2016-07-21 Oleg R. Musin , Anton V. Nikitenko

The classical Cauchy-Davenport theorem implies the lower bound n+1 for the number of distinct subsums that can be formed from a sequence of n elements of the cyclic group Z_p (when p is prime and n<p). We generalize this theorem to a…

Number Theory · Mathematics 2012-09-03 Greg Martin , Alexis Peilloux , Erick B. Wong
‹ Prev 1 4 5 6 7 8 10 Next ›