Almost Affinely Disjoint Subspaces

07/03/2020
by   Hedongliang Liu, et al.
0

In this work, we introduce a natural notion concerning vector finite spaces. A family of k-dimensional subspaces of 𝔽_q^n is called almost affinely disjoint if any (k+1)-dimensional subspace containing a subspace from the family non-trivially intersects with only a few subspaces from the family. The central question discussed in the paper is the polynomial growth (in q) of the maximal cardinality of these families given the parameters k and n. For the cases k=1 and k=2, optimal families are constructed. For other settings, we find lower and upper bounds on the polynomial growth. Additionally, some connections with problems in coding theory are shown.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/13/2019

Subspace Packings – Constructions and Bounds

The Grassmannian G_q(n,k) is the set of all k-dimensional subspaces of t...
research
11/12/2018

Subspace Packings

The Grassmannian G_q(n,k) is the set of all k-dimensional subspaces of ...
research
04/10/2020

Modular and fractional L-intersecting families of vector spaces

In the first part of this paper, we prove a theorem which is the q-analo...
research
11/30/2020

On minimal subspace Zp-null designs

Let q be a power of a prime p, and let V be an n-dimensional space over ...
research
01/19/2021

Subspace exploration: Bounds on Projected Frequency Estimation

Given an n × d dimensional dataset A, a projection query specifies a sub...
research
03/29/2019

Ham-Sandwich cuts and center transversals in subspaces

The Ham-Sandwich theorem is a well-known result in geometry. It states t...
research
05/05/2023

On MSR Subspace Families of Lines

A minimum storage regenerating (MSR) subspace family of 𝔽_q^2m is a set ...

Please sign up or login with your details

Forgot password? Click here to reset