The reviewed record of science sign in
Pith

arxiv: 2103.11117 · v1 · pith:PAOPWYZ4 · submitted 2021-03-20 · math.CO

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

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

classification math.CO
keywords brackintersectingmathcalnon-trivialdimensionalfamiliesfamilysize
0
0 comments X
read the original 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}$.

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.