Related papers: Intersection numbers for subspace designs
A well known class of objects in combinatorial design theory are {group divisible designs}. Here, we introduce the $q$-analogs of group divisible designs. It turns out that there are interesting connections to scattered subspaces,…
We improve on the lower bound of the maximum number of planes in $\operatorname{PG}(8,q)\cong\F_q^{9}$ pairwise intersecting in at most a point. In terms of constant dimension codes this leads to $A_q(9,4;3)\ge q^{12}+…
Arguably, the most important open problem in the theory of $q$-analogs of designs is the question for the existence of a $q$-analog $D$ of the Fano plane. It is undecided for every single prime power value $q \geq 2$. A point $P$ is called…
One of the most intriguing problems, in $q$-analogs of designs, is the existence question of an infinite family of $q$-analog of Steiner systems, known also as $q$-Steiner systems, (spreads not included) in general, and the existence…
A set $\mathcal{F}_q$ of $3$-dimensional subspaces of $\mathbb{F}_q^7$, the $7$-dimensional vector space over the finite field $\mathbb{F}_q$, is said to form a $q$-analogue of the Fano plane if every $2$-dimensional subspace of…
The $q$-Fano plane is the $q$-analog of the Steiner system $S(2,3,7)$. For any given prime power $q$ it is not known whether the $q$-Fano plane exists or not. We consider the structure of the $q$-Fano plane for any given $q$ and conclude…
We improve on the lower bound of the maximum number of planes of ${\rm PG}(8,q)$ mutually intersecting in at most one point leading to the following lower bound: ${\cal A}_q(9, 4; 3) \ge q^{12}+2q^8+2q^7+q^6+q^5+q^4+1$ for constant…
A $q$-analogue of a $t$-design is a set $S$ of subspaces (of dimension $k$) of a finite vector space $V$ over a field of order $q$ such that each $t$ subspace is contained in a constant $\lambda$ number of elements of $S$. The smallest…
The goal of this paper is to explore the genus and degree of the Fano scheme of linear subspaces on a complete intersection in a complex projective space. Firstly, suppose that the expected dimension of the Fano scheme is one, we prove a…
One of the most intriguing problems, in $q$-analogs of designs and codes, is the existence question of an infinite family of $q$-analog of Steiner systems (spreads not included) in general, and the existence question for the $q$-analog of…
We provide enumerative formulas for the degrees of varieties parameterizing hypersurfaces and complete intersections which contain pro-jective subspaces and conics. Besides, we find all cases where the Fano scheme of the general complete…
We prove the existence of subspace designs with any given parameters, provided that the dimension of the underlying space is sufficiently large in terms of the other parameters of the design and satisfies the obvious necessary divisibility…
The $q$-analogs of basic designs are discussed. It is proved that the existence of any unknown Steiner structures, the $q$-analogs of Steiner systems, implies the existence of unknown Steiner systems. Optimal $q$-analogs covering designs…
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.…
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…
We propose conjectural semiorthogonal decompositions for Fano schemes of linear subspaces on intersections of two quadrics, in terms of symmetric powers of the associated hyperelliptic (resp. stacky) curve. When the intersection is…
We study the intersection ring of the space $\M(\alpha_1,...,\alpha_m)$ of polygons in $\R^3$. We find homology cycles dual to generators of this ring and prove a recursion relation in $m$ (the number of steps) for their intersection…
Intersecting codes are a classical object in coding theory whose rank-metric analogue has recently been introduced. Although the definition formally parallels the Hamming-metric case, the structure and parameter constraints of rank-metric…
Let $F$ be a field. A $2$-$(7, 3, 1)_F$-subspace design, or $q$-Fano plane, over $F$, is a $7$-dimensional vector space $V$ over $F$ together with a collection $\mathfrak{B}$ of three-dimensional subspaces of $V$ such that every…
We investigate Fano schemes of conditionally generic intersections, i.e. of hypersurfaces in projective space chosen generically up to additional conditions. Via a correspondence between generic properties of algebraic varieties and events…