Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 68 tok/s
Gemini 2.5 Pro 56 tok/s Pro
GPT-5 Medium 34 tok/s Pro
GPT-5 High 31 tok/s Pro
GPT-4o 84 tok/s Pro
Kimi K2 184 tok/s Pro
GPT OSS 120B 441 tok/s Pro
Claude Sonnet 4.5 33 tok/s Pro
2000 character limit reached

Intersecting families of vector spaces with maximum covering number (2002.05859v1)

Published 14 Feb 2020 in math.CO

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.

Summary

We haven't generated a summary for this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.