Related papers: Lines in higgledy-piggledy position

In this paper we prove that a set of points $B$ of PG(n,2) is a minimal blocking set if and only if $<B>=PG(d,2)$ with $d$ odd and $B$ is a set of $d+2$ points of $PG(d,2)$ no $d+1$ of them in the same hyperplane. As a corollary to the…

For a field $\mathbb{F}$ and integers $d, k$ and $\ell$, a set $A \subseteq \mathbb{F}^d$ is called $(k,\ell)$-nearly orthogonal if all vectors in $A$ are non-self-orthogonal and every $k+1$ vectors in $A$ contain $\ell + 1$ pairwise…

We study 4D systems in which parameters of the theory have position dependence in one spatial direction. In the limit where these parameters jump, this can lead to 3D interfaces supporting localized degrees of freedom. A priori, this sort…

We classify six-dimensional F-theory compactifications in terms of simple features of the divisor structure of the base surface of the elliptic fibration. This structure controls the minimal spectrum of the theory. We determine all…

Let $F$ be a non-singular homogeneous polynomial of degree $d$ in $n$ variables. We give an asymptotic formula of the pairs of integer points $(\mathbf x, \mathbf y)$ with $|\mathbf x| \le X$ and $|\mathbf y| \le Y$ which generate a line…

A generalization of highly symmetric frames is presented by considering also projective stabilizers of frame vectors. This allows construction of highly symmetric line systems and study of highly symmetric frames in a more unified manner.…

An $\mathbb{F}_q$-linear set of rank $k$ on a projective line $\mathrm{PG}(1,q^h)$, containing at least one point of weight one, has size at least $q^{k-1}+1$ (see [J. De Beule and G. Van De Voorde, The minimum size of a linear set, J.…

We prove a new upper bound on the number of $r$-rich lines (lines with at least $r$ points) in a `truly' $d$-dimensional configuration of points $v_1,\ldots,v_n \in \mathbb{C}^d$. More formally, we show that, if the number of $r$-rich lines…

Linear error-correcting codes can be used for constructing secret sharing schemes; however finding in general the access structures of these secret sharing schemes and, in particular, determining efficient access structures is difficult.…

Given S_1, a finite set of points in the plane, we define a sequence of point sets S_i as follows: With S_i already determined, let L_i be the set of all the line segments connecting pairs of points of the union of S_1,...,S_i, and let…

A bar-joint framework $(G,p)$ is the combination of a finite simple graph $G=(V,E)$ and a placement $p:V\rightarrow \mathbb{R}^d$. The framework is rigid if the only edge-length preserving continuous motions of the vertices arise from…

Fix positive integers $n,r,d$. We show that if $n,r,d$ satisfy a suitable inequality, then any smooth hypersurface $X\subset \mathbb{P}^n$ defined over a finite field of characteristic $p$ sufficiently large contains a rational $r$-plane.…

A graph is called 1-planar if it can be drawn on the plane so that each edge is crossed by at most one other edge. In this paper, we establish a local property of 1-planar graphs which describes the structure in the neighborhood of small…

Let $(P,E)$ be a $(d+1)$-uniform geometric hypergraph, where $P$ is an $n$-point set in general position in $\mathbb{R}^d$ and $E\subseteq {P\choose d+1}$ is a collection of $\epsilon{n\choose d+1}$ $d$-dimensional simplices with vertices…

By a curve in R^d we mean a continuous map gamma:I -> R^d, where I is a closed interval. We call a curve gamma in R^d at most k crossing if it intersects every hyperplane at most k times (counted with multiplicity). The at most d crossing…

We construct a topology on a given algebraically closed field with a distinguished subfield which is also algebraically closed. This topology is finer than Zariski topology and it captures the sets definable in the pair of algebraically…

We study finite systems of subspaces of a complex Hilbert space such that each pair of subspaces satisfies a certain condition as described in the following. For each subspace excepting the first one an angle between this subspace and the…

We say that a finite set S of points in R^d is in "strong general position" if for any collection {F_1,..., F_r} of r pairwise disjoint subsets of S (1 <= r <= |S|) we have: d-dim (the intersection of aff F_1,aff F_2,...,aff F_r) = min{d+1,…

In this work we describe an explicit, simple, construction of large subsets of F^n, where F is a finite field, that have small intersection with every k-dimensional affine subspace. Interest in the explicit construction of such sets, termed…

Subspace designs are a (large) collection of high-dimensional subspaces $\{H_i\}$ of $\F_q^m$ such that for any low-dimensional subspace $W$, only a small number of subspaces from the collection have non-trivial intersection with $W$; more…