Related papers: Subspaces intersecting in at most a point

Baader, J\"org, and Parlier recently established an upper bound for the crossing number of curve systems of size $m\asymp g^{1+\alpha}$ on a genus $g$ surface, obtaining a leading coefficient of $9/4=2.25$. Their construction relies on…

A graph drawn in the plane is called k-quasi-planar if it does not contain k pairwise crossing edges. It has been conjectured for a long time that for every fixed k, the maximum number of edges of a k-quasi-planar graph with n vertices is…

The intersection problem for additive (extended and non-extended) perfect codes, i.e. which are the possibilities for the number of codewords in the intersection of two additive codes C1 and C2 of the same length, is investigated. Lower and…

Subspace codes are the $q$-analog of binary block codes in the Hamming metric. Here the codewords are vector spaces over a finite field. They have e.g. applications in random linear network coding, distributed storage, and cryptography. In…

Let $C_{n-1}(n,q)$ be the code arising from the incidence of points and hyperplanes in the Desarguesian projective space PG($n,q$). Recently, Polverino and Zullo proved that within this code, all non-zero code words of weight at most…

Let $P$ be a collection of $n$ points moving along pseudo-algebraic trajectories in the plane. One of the hardest open problems in combinatorial and computational geometry is to obtain a nearly quadratic upper bound, or at least a subcubic…

In this work, we introduce a natural notion concerning finite vector spaces. A family of $k$-dimensional subspaces of $\mathbb{F}_q^n$, which forms a partial spread, is called almost affinely disjoint if any $(k+1)$-dimensional subspace…

In a projective plane $\Pi_{q}$ (not necessarily Desarguesian) of order $q$, a point subset $\mathcal{S}$ is saturating (or dense) if any point of $\Pi_{q}\setminus \mathcal{S}$ is collinear with two points in $\mathcal{S}$. Modifying an…

We present a simple randomized scheme for triangulating a set $P$ of $n$ points in the plane, and construct a kinetic data structure which maintains the triangulation as the points of $P$ move continuously along piecewise algebraic…

Codes in finite projective spaces equipped with the subspace distance have been proposed for error control in random linear network coding. Here we collect the present knowledge on lower and upper bounds for binary subspace codes for…

Let V be a vector space of dimension n over the finite field F_q, where q is odd, and let Symm(V) denote the space of symmetric bilinear forms defined on V x V. We investigate constant rank r subspaces of Symm(V) in this paper. We have…

We prove an incidence theorem for points and planes in the projective space $\mathbb P^3$ over any field $\mathbb F$, whose characteristic $p\neq 2.$ An incidence is viewed as an intersection along a line of a pair of two-planes from two…

The $q$-ary block codes with two distances $d$ and $d+1$ are considered. Several constructions of such codes are given, as in the linear case all codes can be obtained by a simple modification of linear equidistant codes. Upper bounds for…

An ordinary plane of a finite set of points in real 3-space with no three collinear is a plane intersecting the set in exactly three points. We prove a structure theorem for sets of points spanning few ordinary planes. Our proof relies on…

We consider a non-degenerate conic in $\PG(2,q^2)$, $q$ odd, that is tangent to $\ell_\infty$ and look at its structure in the Bruck-Bose representation in $\PG(4,q)$. We determine which combinatorial properties of this set of points in…

We prove that the number of unit distances among $n$ planar points is at most $1.94\cdot n^{4/3}$, improving on the previous best bound of $8n^{4/3}$. We also give better upper and lower bounds for several small values of $n$. We also prove…

Erd\H{o}s asked what is the maximum number $\alpha(n)$ such that every set of $n$ points in the plane with no four on a line contains $\alpha(n)$ points in general position. We consider variants of this question for $d$-dimensional point…

A simple counting argument is used to show that for all $q$, an Andr\'e hyper-regulus $\mathbb X$ in $PG(5,q)$ has exactly two switching sets. Moreover, there are exactly $2(q^2+q+1)$ planes in $PG(5,q)$ that meet every plane of $\mathbb X$…

The numbers of $\mathbb{F}_q$-points of nonsingular hypersurfaces of a fixed degree in an odd-dimensional projective space are investigated, and an upper bound for them is given. Also we give the complete list of nonsingular hypersurfaces…

Let $\mathbb{F}$ be a field, let $P \subseteq \mathbb{F}^d$ be a finite set of points, and let $\alpha,\beta \in \mathbb{F} \setminus \{0\}$. We study the quantity \[|\Pi_{\alpha, \beta}| = \{(p,q,r) \in P \times P \times P \mid p \cdot q =…