English
Related papers

Related papers: A Problem Concerning Nonincident Points and Lines …

200 papers

Say that a subset S of the plane is a "circle-center set" if S is not a subset of a line, and whenever we choose three noncollinear points from S, the center of the unique circle through those three points is also an element of S. A problem…

Metric Geometry · Mathematics 2007-05-23 Greg Martin

The Largest Empty Circle problem seeks the largest circle centered within the convex hull of a set $P$ of $n$ points in $\mathbb{R}^2$ and devoid of points from $P$. In this paper, we introduce a query version of this well-studied problem.…

Computational Geometry · Computer Science 2010-04-15 John Augustine , Brian Putnam , Sasanka Roy

Let $Z$ be a quadratic hypersurface of $\mathbb{P}^n(\mathbb{R})$ defined over $\mathbb{Q}$ containing points whose coordinates are linearly independent over $\mathbb{Q}$. We show that, among these points, the largest exponent of uniform…

Number Theory · Mathematics 2022-02-02 Anthony Poëls , Damien Roy

Let $K$ be a number field and $O_K$ the ring of integers of $K$. In the spirit of Siegel's theorem on integral points on affine algebraic curves, the plane Jacobian conjecture over $K$ is equivalent to the following statement: if $P,Q\in…

Algebraic Geometry · Mathematics 2017-09-26 Nguyen Van Chau

We prove that a set $A$ of at most $q$ non-collinear points in the finite plane $\mathbb{F}_{q}^{2}$ spans at least $\approx\frac{|A|}{\sqrt{q}}$ directions: this is based on a lower bound contained in [FST13], which we prove again together…

Combinatorics · Mathematics 2022-12-13 Daniele Dona

Let $ES_{\ell}(n)$ be the minimum $N$ such that every $N$-element point set in the plane contains either $\ell$ collinear members or $n$ points in convex position. We prove that there is a constant $C>0$ such that, for each $\ell, n \ge 3$,…

Combinatorics · Mathematics 2024-05-07 David Conlon , Jacob Fox , Xiaoyu He , Dhruv Mubayi , Andrew Suk , Jacques Verstraete

We give uniform upper bounds for the number of rational points of height at most $B$ on non-singular complete intersections of two quadrics in $\mathbb{P}^3$ defined over $\mathbb{Q}$. To do this, we combine determinant methods with descent…

Number Theory · Mathematics 2018-11-29 Manh Hung Tran

The classical problem of whether $m$th-powers with or without zero in a finite field $\mathbb{F}_q$ form a difference set has been extensively studied, and is related to many topics, such as flag transitive finite projective planes. In this…

Combinatorics · Mathematics 2017-07-05 Binzhou Xia

We study biplane graphs drawn on a finite planar point set $S$ in general position. This is the family of geometric graphs whose vertex set is $S$ and can be decomposed into two plane graphs. We show that two maximal biplane graphs---in the…

Computational Geometry · Computer Science 2017-08-10 Alfredo García , Ferran Hurtado , Matias Korman , Inês Matos , Maria Saumell , Rodrigo I. Silveira , Javier Tejel , Csaba D. Tóth

This paper attacks the following problem. We are given a large number $N$ of rectangles in the plane, each with horizontal and vertical sides, and also a number $r<N$. The given list of $N$ rectangles may contain duplicates. The problem is…

Data Structures and Algorithms · Computer Science 2017-03-28 David B. A. Epstein , Mike Paterson

We give upper bounds on the number of exceptional radial projections of arbitrary subsets of vector spaces over finite fields. Our bounds do not depend on the dimension of the ambient space. Let $\mathbb{F}_q^d$ be the $d$-dimensional…

Combinatorics · Mathematics 2025-12-01 Paige Bright , Ben Lund , Thang Pham

For any two configurations of ordered points $p=(p_{1},...,\p_{N})$ and $q=(q_{1},...,q_{N})$ in Euclidean space $E^d$ such that $q$ is an expansion of $p$, there exists a continuous expansion from $p$ to $q$ in dimension 2d; Bezdek and…

Metric Geometry · Mathematics 2011-07-04 Holun Cheng , Ser Peow Tan , Yidan Zheng

We show that the maximum number of pairwise non-overlapping $k$-rich lenses (lenses formed by at least $k$ circles) in an arrangement of $n$ circles in the plane is $O\left(\frac{n^{3/2}\log{(n/k^3)}}{k^{5/2}} + \frac{n}{k} \right)$, and…

Combinatorics · Mathematics 2020-12-09 Esther Ezra , Orit E. Raz , Micha Sharir , Joshua Zahl

An irreducible smooth projective curve over $\mathbb{F}\_q$ is called \textit{pointless} if it has no $\mathbb{F}\_q$-rational points. In this paper we study the lower existence bound on the genus of such a curve over a fixed finite field…

Algebraic Geometry · Mathematics 2017-03-27 Ivan Pogildiakov

Let $X\subseteq \mathbb{P}^3$ be a smooth projective surface of degree $d\ge 4$ defined over a number field $K$, and let $N_{X^{\prime}}(B)$ be the number of rational points of $X$ of height at most $B$ that do not lie on lines contained in…

Number Theory · Mathematics 2026-01-09 Lorenzo Andreaus

We investigate $k$-nets with $k\geq 4$ embedded in the projective plane $PG(2,\mathbb{K})$ defined over a field $\mathbb{K}$; they are line configurations in $PG(2,\mathbb{K})$ consisting of $k$ pairwise disjoint line-sets, called…

Algebraic Geometry · Mathematics 2013-06-26 G. Korchmaros , G. P. Nagy , N. Pace

Some new families of small complete caps in $PG(N,q)$, $q$ even, are described. By using inductive arguments, the problem of the construction of small complete caps in projective spaces of arbitrary dimensions is reduced to the same problem…

Combinatorics · Mathematics 2009-01-06 Alexander A. Davydov , Massimo Giulietti , Stefano Marcugini , Fernanda Pambianco

We consider the question of determining the maximum number of $\mathbb{F}_q$-rational points that can lie on a hypersurface of a given degree in a weighted projective space over the finite field $\mathbb{F}_q$, or in other words, the…

Algebraic Geometry · Mathematics 2018-01-30 Yves Aubry , Wouter Castryck , Sudhir R. Ghorpade , Gilles Lachaud , Michael E. O'Sullivan , Samrith Ram

We apply an improvement of the Delsarte LP-bound to give a new proof of the non-existence of finite projective planes of order 6, and uniqueness of finite projective planes of order 7. The proof is computer aided, and it is also feasible to…

Combinatorics · Mathematics 2018-01-30 Mate Matolcsi , Mihaly Weiner

We introduce space-efficient plane-sweep algorithms for basic planar geometric problems. It is assumed that the input is in a read-only array of $n$ items and that the available workspace is $\Theta(s)$ bits, where $\lg n \leq s \leq n…

Data Structures and Algorithms · Computer Science 2016-04-25 Amr Elmasry , Frank Kammer
‹ Prev 1 8 9 10 Next ›