2000 character limit reached
Non-trivial $t$-intersecting families for symplectic polar spaces
Published 10 Oct 2020 in math.CO | (2010.05030v1)
Abstract: Let $\mathscr{P}$ be a symplectic polar space over a finite field $\mathbb{F}_q$, and $\mathscr{P}_m$ denote the set of all $m$-dimensional subspaces in $\mathscr{P}$. We say a $t$-intersecting subfamily of $\mathscr{P}_m$ is trivial if there exists a $t$-dimensional subspace contained in each member of this family. In this paper, we determine the structure of maximum sized non-trivial $t$-intersecting subfamilies of $\mathscr{P}_m$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.