Non t-intersecting families of linear spaces over GF(q)
Non \(t\)-intersecting families of linear spaces over \(GF(q)\)
Let \(n,s,t\) be nonnegative integers with \(s\leq t<n\) and let \(V\) be an \(n\)-dimensional vector space over some finite field \(GF(q)\). Let \(\mathcal F\) be a family of linear subspaces of \(V\) with the property that the dimension of the intersection \(F_ 1\cap F_ 2\) of each two elements \(F_ 1,F_ 2\) of \(\mathcal F\) is either smaller than \(s\) or larger than \(t\). By a linear algebraic method it is shown that for \(n\geq 9t\) the cardinality of \(\mathcal F\) satisfies \[ | \mathcal F|\leq\begin{cases} \sum\limits _ {i=0} ^ {s-1}{n\choose i}_ q + \sum\limits _ {i=(n + t + 1)/2} ^ {n}{n\choose i}_ q&\text{if }n + t\text{ is odd}\\ \sum\limits _ {i=0} ^ {s-1}{n\choose i}_ q + {n-1\choose (n+t)/2}_ q \sum\limits _ {i=(n + t + 2)/2} ^ {n}{n\choose i}_ q&\text{if }n + t\text{ is even}\end{cases} \] where \({n\choose i}_ q\) denotes the usual \(q\)-binomial coefficient. Moreover, all extremal families \(\mathcal F\) are characterized. This result is an exact \(q\)-analogue of a result of \textit{P. Frankl} and \textit{Z. Fűredi} [J. Comb. Theory, Ser. A 36, 230-236 (1984; Zbl 0529.05045)] who proved a corresponding result for finite sets.
- Publication:3201059
- An intersection problem with 6 extremes
- The Hilton-Milner theorem for the distance-regular graphs of bilinear forms
- Nontrivial t-intersecting families for vector spaces
- An extremal problem with excluded subposet in the Boolean lattice
- Note on the \(f\)-vectors of cutsets in the subspace lattice
- An extremal problem for families of pairs of subspaces
- Bounds on a class of partial partitions of a vector space over gf(2):a graph theoretical approach
- Suboptimal s-union families and s-union antichains for vector spaces
- Intersecting Chains in Finite Vector Spaces
- An intersection problem for finite sets
- scientific article; zbMATH DE number 4177064 (Why is no real title available?)
- scientific article; zbMATH DE number 4063157 (Why is no real title available?)
- scientific article; zbMATH DE number 3523543 (Why is no real title available?)
- Intersection theorems for systems of finite sets
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Intersection theorems for vector spaces
- Linear dependencies among subsets of a finite set
- On hypergraphs without two edges intersecting in a given number of vertices
- On t-designs
- The Erdős-Ko-Rado theorem for vector spaces
- Finite projective spaces and intersecting hypergraphs
- Generalizing Sperner's lemma to a free module over a special principal ideal ring
- Modular and fractional \(L\)-intersecting families of vector spaces
- Non-trivial t-intersecting families for symplectic polar spaces
- scientific article; zbMATH DE number 4177064 (Why is no real title available?)
- The Hilton-Milner theorem for the distance-regular graphs of bilinear forms
- LYM-type inequality for \(t\)-intersecting antichains in linear lattices
- Nontrivial t-intersecting families for vector spaces
- A cross-intersection theorem for vector spaces based on semidefinite programming
- A \(t\)-intersecting Hilton-Milner theorem for vector spaces
- Stability through non-shadows
- Almost intersecting families for vector spaces
- Invitation to intersection problems for finite sets
This page was built for publication: Non \(t\)-intersecting families of linear spaces over \(GF(q)\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1176745)
