Pith. sign in

REVIEW

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

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

Intersecting families of vector spaces with maximum covering number

classification math.CO
keywords mathscrcoveringnumberintersectingmaximumbounddimensionalfamily
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
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.

discussion (0)

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