The reviewed record of science sign in
Pith

arxiv: 2002.05859 · v1 · pith:HWFDRPW7 · submitted 2020-02-14 · math.CO

Intersecting families of vector spaces with maximum covering number

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:HWFDRPW7record.jsonopen to challenge →

classification math.CO
keywords mathscrcoveringnumberintersectingmaximumbounddimensionalfamily
0
0 comments X
read the original abstract

Let $V$ be an $n$-dimensional vector space over the finite field $\mathbb{F}_q$. Suppose that $\mathscr{F}$ is an intersecting family of $m$-dimensional subspaces of $V$. The covering number of $\mathscr{F}$ is the minimum dimension of a subspace of $V$ which intersects all elements of $\mathscr{F}$. In this paper, we give the tight upper bound for the size of $\mathscr{F}$ whose covering number is $m$, and describe the structure of $\mathscr{F}$ which reaches the upper bound. Moreover, we determine the structure of an maximum intersecting family of singular linear space with the maximum covering number.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.