English
Related papers

Related papers: A note on the no-three-in-line problem on a torus

200 papers

We show that the minimal number of singular fibers $N(g,1)$ in a genus-$g$ Lefschetz fibration over the torus is at least $3$. As an application, we show that $N(g, 1) \in \{ 3, 4\}$ for $g\ge 5$, $N(g, 1) \in \{3, 4,5 \}$ for $g= 3, 4$ and…

Geometric Topology · Mathematics 2016-06-07 András I. Stipsicz , Ki-Heon Yun

We consider the following feasibility problem: given an integer $n \geq 1$ and an integer $m$ such that $0 \leq m \leq \binom{n}{2}$, does there exist a line graph $L = L(G)$ with exactly $n$ vertices and $m$ edges ? We say that a pair…

Combinatorics · Mathematics 2022-05-20 Yair Caro , Josef Lauri , Christina Zarb

Let $1 \le m \le n$. We prove various results about the chessboard complex $M_{m,n}$, which is the simplicial complex of matchings in the complete bipartite graph $K_{m,n}$. First, we demonstrate that there is nonvanishing 3-torsion in…

Combinatorics · Mathematics 2012-03-27 Jakob Jonsson

Let $P$ be a set of $n$ points in the real plane contained in an algebraic curve $C$ of degree $d$. We prove that the number of distinct distances determined by $P$ is at least $c_d n^{4/3}$, unless $C$ contains a line or a circle. We also…

Metric Geometry · Mathematics 2016-07-20 János Pach , Frank de Zeeuw

Given points in Euclidean space of arbitrary dimension, we prove that there exists a spanning tree having no vertices of degree greater than 3 with weight at most 1.559 times the weight of the minimum spanning tree. We also prove that there…

Computational Geometry · Computer Science 2014-07-18 Samuel Zbarsky

The number of solutions to $a^2+b^2=c^2+d^2 \le x$ in integers is a well-known result, while if one restricts all the variables to primes Erdos showed that only the diagonal solutions, namely, the ones with $\{a,b\}=\{c,d\}$ contribute to…

Number Theory · Mathematics 2023-10-25 Alisa Sedunova

Let $L$ be a set of $n$ lines in $\reals^d$, for $d\ge 3$. A {\em joint} of $L$ is a point incident to at least $d$ lines of $L$, not all in a common hyperplane. Using a very simple algebraic proof technique, we show that the maximum…

Computational Geometry · Computer Science 2009-06-03 Haim Kaplan , Micha Sharir , Eugenii Shustin

We study supersolvable line arrangements in ${\mathbb P}^2$ over the reals and over the complex numbers, as the first step toward a combinatorial classification. Our main results show that a nontrivial (i.e., not a pencil or near pencil)…

Algebraic Geometry · Mathematics 2019-07-19 Krishna Hanumanthu , Brian Harbourne

Let $M^{2n}$ be a unitary torus $(2n)$-manifold, i.e., a $(2n)$-dimensional oriented stable complex connected closed $T^n$-manifold having a nonempty fixed set. In this paper we show that $M$ bounds equivariantly if and only if the…

Algebraic Topology · Mathematics 2012-05-31 Zhi Lü , Qiangbo Tan

In this paper, we study the problem of finding the largest possible set of s points and s lines in a projective plane of order q, such that that none of the s points lie on any of the s lines. We prove that s <= 1+(q+1)(\sqrt{q}-1). We also…

Combinatorics · Mathematics 2011-09-20 Douglas R. Stinson

Let V be a finite set of points in the plane, not contained in a line. Assume |V| = n is an odd number, and |L \cap V| \leq 3 for every line L which is spanned by V. We prove that every simple line L_{a,b} in V creates a simple wedge (i.e.,…

Combinatorics · Mathematics 2012-09-10 Shimon Garti

Guth and Katz proved that, as conjectured by Elekes and Sharir, $m$ lines in 3-space have at most constant times $ m^{3/2}$ intersection points, aside from some obvious counter examples. We give an explicit bound for the constant, using the…

Algebraic Geometry · Mathematics 2014-05-09 János Kollár

In Martin Gardner's October, 1976 Mathematical Games column in Scientific American, he posed the following problem: "What is the smallest number of [queens] you can put on a board of side n such that no [queen] can be added without creating…

Combinatorics · Mathematics 2014-03-10 Alec S. Cooper , Oleg Pikhurko , John R. Schmitt , Gregory S. Warrington

We prove that an additive form of degree $d=2m$, $m$ odd, $m\ge3$, over the unramified quadratic extension $\mathbb{Q}_2(\sqrt{5})$ has a nontrivial zero if the number of variables $s$ satisifies $s \ge 4d+1$. If $3 \nmid d$, then there…

Number Theory · Mathematics 2022-07-21 Drew Duncan , David B. Leep

We consider the problem of identifying n points in the plane using disks, i.e., minimizing the number of disks so that each point is contained in a disk and no two points are in exactly the same set of disks. This problem can be seen as an…

Discrete Mathematics · Computer Science 2017-06-01 Valentin Gledel , Aline Parreau

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

Let $d$ and $k$ be positive integers. Let $\mu$ be a positive Borel measure on $\mathbb{R}^2$ possessing finite moments up to degree $2d-1$. If the support of $\mu$ is contained in an algebraic curve of degree $k$, then we show that there…

Numerical Analysis · Mathematics 2017-10-31 Cordian Riener , Markus Schweighofer

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

Here is a square problem: in a unit square, is there a point with four rational distances to the vertices? A probability argument suggests a negative answer. This paper proves several special cases of the square problem: if the point sits…

General Mathematics · Mathematics 2021-05-14 Yang Ji

We develop a new approach to the representation theory of quantum algebras supporting a torus action via methods from the theory of finite-state automata and algebraic combinatorics. We show that for a fixed number $m$, the torus-invariant…

Combinatorics · Mathematics 2009-01-30 J. Bell , S. Launois , J. Lutley