English
Related papers

Related papers: Lines in higgledy-piggledy position

200 papers

In this paper, we investigate the Andr\'e/Bruck-Bose representation of certain $\mathbb{F}_q$-linear sets contained in a line of $\text{PG}(2,q^t)$. We show that scattered $\mathbb{F}_q$-linear sets of rank $3$ in $\text{PG}(1,q^3)$…

Combinatorics · Mathematics 2023-07-28 Lins Denaux , Jozefien D'haeseleer , Geertrui Van de Voorde

A planar point set of $n$ points is called {\em $\gamma$-dense} if the ratio of the largest and smallest distances among the points is at most $\gamma\sqrt{n}$. We construct a dense set of $n$ points in the plane with…

Combinatorics · Mathematics 2019-04-01 István Kovács , Géza Tóth

In this paper we investigate hyperplanes of the point-line geometry $\mathit{A}_{n,\{1,n\}}(\mathbb{F})$ of point-hyerplane flags of the projective geometry $\mathrm{PG}(n,\mathbb{F})$. Renouncing a complete classification, which is not yet…

Combinatorics · Mathematics 2023-08-29 Antonio Pasini

Let S be a smooth, projective surface of Picard rank 1 and very ample generator embedding S into P^n. Let C be a smooth curve in O(m) for m \geq 5. We prove that any base-point free, complete g^r_d on C for r\in\{1,2\} and d small enough is…

Algebraic Geometry · Mathematics 2015-08-19 Nils Henry Rasmussen

We show that if a collection of lines in a vector space over a finite field has "dimension" at least 2(d-1) + beta, then its union has "dimension" at least d + beta. This is the sharp estimate of its type when no structural assumptions are…

Classical Analysis and ODEs · Mathematics 2016-04-20 Richard Oberlin

For a field $\mathbb{F}$ and integers $d$ and $k$, a set of vectors of $\mathbb{F}^d$ is called $k$-nearly orthogonal if its members are non-self-orthogonal and every $k+1$ of them include an orthogonal pair. We prove that for every prime…

Computational Geometry · Computer Science 2024-05-21 Dror Chawin , Ishay Haviv

A graph is {\em $1$-planar} if it can be drawn in the plane such that every edge crosses at most one other edge. A connected graph $H$ is {\em strongly light} in a family of graphs $\mathfrak{G}$, if there exists a constant $\lambda$, such…

Combinatorics · Mathematics 2018-11-20 Tao Wang

We compute some numerical invariants of the lines on hyperplane sections of a smooth cubic threefold over complex numbers. We also prove that for any smooth hypersurface $X\subset \mathbb P^{n+1}$ of degree $d$ over an algebraically closed…

Algebraic Geometry · Mathematics 2020-07-08 Yiran Cheng

For positive integers $r<d<n$ equip the powerset $2^{\mathbb{G}(r,V)}$ of the $r$-plane Grassmannian of an $n$-dimensional Hilbert space with the closure operator attaching to a set of $r$-planes the smallest superset which along with two…

Metric Geometry · Mathematics 2026-02-03 Alexandru Chirvasitu

A strong blocking set in a finite projective space is a set of points that intersects each hyperplane in a spanning set. We provide a new graph theoretic construction of such sets: combining constant-degree expanders with asymptotically…

Combinatorics · Mathematics 2023-05-25 Noga Alon , Anurag Bishnoi , Shagnik Das , Alessandro Neri

We prove that if a subset of a $d$-dimensional vector space over a finite field with $q$ elements has more than $q^{d-1}$ elements, then it determines all the possible directions. If a set has more than $q^k$ elements, it determines a…

Classical Analysis and ODEs · Mathematics 2015-07-31 Alex Iosevich , Hannah Morgan , Jonathan Pakianathan

Let PG$(r, q)$ be the $r$-dimensional projective space over the finite field ${\rm GF}(q)$. A set $\cal X$ of points of PG$(r, q)$ is a cutting blocking set if for each hyperplane $\Pi$ of PG$(r, q)$ the set $\Pi \cap \cal X$ spans $\Pi$.…

Combinatorics · Mathematics 2020-11-24 Daniele Bartoli , Antonio Cossidente , Giuseppe Marino , Francesco Pavese

Let $P$ be a finite set of points in the plane in general position, that is, no three points of $P$ are on a common line. We say that a set $H$ of five points from $P$ is a $5$-hole in $P$ if $H$ is the vertex set of a convex $5$-gon…

Given positive integers $k\leq d$ and a finite field $\mathbb{F}$, a set $S\subset\mathbb{F}^{d}$ is $(k,c)$-subspace evasive if every $k$-dimensional affine subspace contains at most $c$ elements of $S$. By a simple averaging argument, the…

Combinatorics · Mathematics 2022-07-29 Benny Sudakov , István Tomon

We consider arrangements of n connected codimensional one submanifolds in closed d-dimensional manifold M. Let f be the number of connected components of the complement in M to the union of submanifolds. We prove the sharp lower bound for f…

Geometric Topology · Mathematics 2012-09-18 I. N. Shnurnikov

Using a standard technique sometimes (inaccurately) known as Burnside's Lemma, it is shown that the Veldkamp space of the near hexagon L_3 times GQ(2, 2) features 156 different types of lines. We also give an explicit description of each…

Combinatorics · Mathematics 2017-01-24 R. M. Green , Metod Saniga

We show that if a finite point set $P\subseteq \mathbb{R}^2$ has the fewest congruence classes of triangles possible, up to a constant $M$, then at least one of the following holds. (1) There is a $\sigma>0$ and a line $l$ which contains…

Combinatorics · Mathematics 2023-10-25 Sam Mansfield , Jonathan Passant

A point set $M$ in $m$-dimensional Euclidean space is called an integral point set if all the distances between the elements of $M$ are integers, and $M$ is not situated on an $(m-1)$-dimensional hyperplane. We improve the linear lower…

Combinatorics · Mathematics 2025-12-02 Nikolai Avdeev

The elements of a finite field of prime order canonically correspond to the integers in an interval. This induces an ordering on the elements of the field. Using this ordering, Kiss and Somlai recently proved interesting properties of the…

Combinatorics · Mathematics 2026-01-28 Sam Adriaensen , Zsuzsa Weiner

Guruswami and Xing introduced subspace designs in 2013 to give the first construction of positive rate rank metric codes list-decodable beyond half the distance. In this paper we provide bounds involving the parameters of a subspace design,…

Information Theory · Computer Science 2023-11-15 Paolo Santonastaso , Ferdinando Zullo