English
Related papers

Related papers: Semiarcs with long secants

200 papers

Given a smooth projective curve C defined over a number field and given two elliptic surfaces E_1/C and E_2/C along with sections P_i and Q_i of E_i (for i = 1,2), we prove that if there exist infinitely many algebraic points t on C such…

Number Theory · Mathematics 2017-03-07 Dragos Ghioca , Liang-Chung Hsia , Thomas J. Tucker

Starting from the results of Charles Fefferman and Janos Koll\`ar in Continuous Solutions of Linear Equations [1], we adopt a new approach based on Fefferman's techniques of Glaeser refinement to show a more general result than the one…

Algebraic Geometry · Mathematics 2022-09-13 Marcello Malagutti

Let $E/\mathbb{Q}(T)$ be a non-isotrivial elliptic curve of rank $r$. A theorem due to Silverman implies that the rank $r_t$ of the specialization $E_t/\mathbb{Q}$ is at least $r$ for all but finitely many $t \in \mathbb{Q}$. Moreover, it…

Number Theory · Mathematics 2024-08-06 Mentzelos Melistas

Semi-algebraic set is a subset of the real space defined by polynomial equations and inequalities. In this paper, we consider the problem of deciding whether two given points in a semi-algebraic set are connected. We restrict to the case…

Symbolic Computation · Computer Science 2024-06-13 Cordian Riener , Robin Schabert , Thi Xuan Vu

The existence of a partial quadrangle ${\mathsf{PQ}}(s, t, \mu)$ is equivalent to the existence of a diamond-free strongly regular graph ${\mathsf{SRG}}(1+s(t+1)+s^2t(t+1)/\mu, s(t+1), s-1, \mu)$. Recently, it is shown that there exists a…

Combinatorics · Mathematics 2013-03-05 A. Mohammadian , B. Tayfeh-Rezaie

We prove that, for $q$ odd, a set of $q+2$ points in the projective plane over the field with $q$ elements has at least $2q-c$ odd secants, where $c$ is a constant and an odd secant is a line incident with an odd number of points of the…

Combinatorics · Mathematics 2020-02-19 Simeon Ball , Bence Csajbók

We use polynomial techniques to derive structural results on R\'edei type blocking sets from information on their bisecants. We apply our results to point sets of $PG(2,q)$ with few odd-secants. In particular, we improve the lower bound of…

Combinatorics · Mathematics 2016-07-26 Bence Csajbók

The subject of this paper are partial geometries $pg(s,t,\alpha)$ with parameters $s=d(d'-1), \ t=d'(d-1), \ \alpha=(d-1)(d'-1)$, $d, d' \ge 2$. In all known examples, $q=dd'$ is a power of 2 and the partial geometry arises from a maximal…

Combinatorics · Mathematics 2020-09-01 Mustafa Gezek , Vladimir D. Tonchev

$\newcommand{\Arr}{\mathcal{A}} \newcommand{\numS}{k} \newcommand{\ArrX}[1]{\Arr(#1)} \newcommand{\eps}{\varepsilon} \newcommand{\opt}{\mathsf{o}}$ For point sets $P_1, \ldots, P_\numS$, a set of lines $L$ is halving if any face of the…

Computational Geometry · Computer Science 2022-08-25 Sariel Har-Peled , Da Wei Zheng

Let $S$ be a smooth projective surface on a smooth threefold $X$ such that $X$ has Picard rank 1 and NS$(S)$ is generated by the restriction of divisors from X. We show that if $X$ satisfies the Bogomolov-Gieseker type inequality for tilt…

Algebraic Geometry · Mathematics 2019-09-17 Geoffrey Smith

A partial linear space is a point--line incidence structure such that each line is incident with at least two points and each pair of points is incident with at most one line. It is said to be proper if there exists at least one…

Group Theory · Mathematics 2025-09-04 Anton A. Baykalov , Alice Devillers , Cheryl E. Praeger

A subset of Q^n is called semilinear (or piecewise linear) if it is Boolean combination of linear half-spaces. We study the computational complexity of the constraint satisfaction problem (CSP) over the rationals when all the constraints…

Computational Complexity · Computer Science 2018-10-30 Manuel Bodirsky , Marcello Mamino

In $\mathrm{PG}(3, q)$, $q = 2^n$, $n \ge 3$, let ${\cal A} = \{(1,t,t^{2^h},t^{2^h+1}) \mid t \in \mathbb{F}_q\} \cup \{(0,0,0,1)\}$, with $\mathrm{gcd}(n,h) = 1$, be a $(q+1)$-arc and let $G_h \simeq \mathrm{PGL}(2, q)$ be the stabilizer…

Combinatorics · Mathematics 2022-08-02 Michela Ceria , Francesco Pavese

New upper bounds on the smallest size t_{2}(2,q) of a complete arc in the projective plane PG(2,q) are obtained for q <= 9109. From these new bounds it follows that for q <= 2621 and q = 2659,2663,2683,2693,2753,2801, the relation…

A locally compact stable plane of positive topological dimension will be called semiaffine if for every line $L$ and every point $p$ not in $L$ there is at most one line passing through $p$ and disjoint from $L$. We show that then the plane…

Geometric Topology · Mathematics 2024-10-15 Rainer Löwen , Markus Johannes Stroppel

It is shown that every 2-planar graph is quasiplanar, that is, if a simple graph admits a drawing in the plane such that every edge is crossed at most twice, then it also admits a drawing in which no three edges pairwise cross. We further…

Computational Geometry · Computer Science 2019-09-05 Michael Hoffmann , Csaba D. Tóth

Let $\mathcal{T}$ be a set of $n$ flat (planar) semi-algebraic regions in $\mathbb{R}^3$ of constant complexity (e.g., triangles, disks), which we call plates. We wish to preprocess $\mathcal{T}$ into a data structure so that for a query…

Computational Geometry · Computer Science 2025-03-18 Pankaj K. Agarwal , Boris Aronov , Esther Ezra , Matthew J. Katz , Micha Sharir

In this paper, we study KM-arcs in $PG(2, q)$, the Desarguesian projective plane of order $q$. A KM-arc A of type $t$ is a natural generalisation of a hyperoval: it is a set of $q + t$ points in $PG(2, q)$ such that every line of $PG(2,q)$…

Combinatorics · Mathematics 2017-05-19 Maarten De Boeck , Geertrui Van de Voorde

In this paper we study some Erdos type problems in discrete geometry. Our main result is that we show that there is a planar point set of n points such that no four are collinear but no matter how we choose a subset of size $n^{5/6+o(1)} $…

Combinatorics · Mathematics 2018-10-15 Jozsef Balogh , Jozsef Solymosi

This paper discusses Tverberg-type theorems with coordinate constraints (i.e., versions of these theorems where all points lie within a subset $S \subset \mathbb{R}^d$ and the intersection of convex hulls is required to have a non-empty…

Metric Geometry · Mathematics 2019-01-30 Jesús A. De Loera , Thomas A. Hogan , Frédéric Meunier , Nabil Mustafa