Pith. sign in

REVIEW

Non-trivial $t$-intersecting families for the distance-regular graphs of bilinear forms

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 2103.11117 v1 pith:PAOPWYZ4 submitted 2021-03-20 math.CO

classification math.CO
keywords brackintersectingmathcalnon-trivialdimensionalfamiliesfamilysize
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
abstract

Let $V$ be an $(n+\ell)$-dimensional vector space over a finite field, and $W$ a fixed $\ell$-dimensional subspace of $V$. Write ${V\brack n,0}$ to be the set of all $n$-dimensional subspaces $U$ of $V$ satisfying $\dim(U\cap W)=0$. A family $\mathcal{F}\subseteq{V\brack n,0}$ is $t$-intersecting if $\dim(A\cap B)\geq t$ for all $A,B\in\mathcal{F}$. A $t$-intersecting family $\mathcal{F}\subseteq{V\brack n,0}$ is called non-trivial if $\dim(\cap_{F\in\mathcal{F}}F)<t$. In this paper, we describe the structure of non-trivial $t$-intersecting families of ${V\brack n,0}$ with large size. In particular, we show the structure of the non-trivial $t$-intersecting families with maximum size, which extends the Hilton-Milner Theorem for ${V\brack n,0}$.

Discussion (0). Continue with ORCID to comment.

Pith tools