Suboptimal s-union families and s-union antichains for vector spaces

DOI10.1016/J.DISC.2023.113505zbMATH Open1515.05015arXiv2207.06727OpenAlexW4377017904MaRDI QIDQ6041580FDOQ6041580

Authors: Yunjing Shan, Junling Zhou 

Publication date: 31 May 2023

Published in: Discrete Mathematics (Search for Journal in Brave)

Abstract: Let $V$ be an $n$-dimensional vector space over the finite field $mathbb{F}_q$, and let $$ be the set of all subspaces of $V$. A family of subspaces $mathcalFsubseteqmathcalL(V)$ is $s$-union if dim$(F+F^{\prime })leqs$ holds for all $F$, $F^{\prime }inmathcalF$. A family $mathcalFsubseteqmathcalL(V)$ is an antichain if $Fleq{F}^{\prime }$ holds for any two distinct $F,F^{\prime }inmathcalF$. The optimal $s$-union families in $mathcalL(V)$ have been determined by Frankl and Tokushige in $2013$. The upper bound of cardinalities of $s$-union $(s<n)$ antichains in $mathcalL(V)$ has been established by Frankl recently, while the structures of optimal ones have not been displayed. The present paper determines all suboptimal $s$-union families for vector spaces and then investigates $s$-union antichains. For $s=n$ or $s=2d<n$, we determine all optimal and suboptimal $s$-union antichains completely. For $s=2d+1<n$, we prove that an optimal antichain is either $left[Vatopdight]$ or contained in $$ which satisfies an equality related with shadows.

Full work available at URL: https://arxiv.org/abs/2207.06727

Recommendations

• Structure theorems for finite unions of subspaces of special kind
• A family of inequalities for intersecting antichains of subsets of an \(n\)-set
• Union-intersection-bounded families and their applications
• Nontrivial \(t\)-intersecting families for vector spaces
• On the \(f\)-vectors of \(r\)-multichain subdivisions
• An extremal problem for families of pairs of subspaces
• An extremal problem for antichains of subsets of a multiset
• Unions and Common Complements of Subspaces
• scientific article; zbMATH DE number 6536391

zbMATH Keywords

shadowantichainvector spacecross-intersecting\(s\)-union

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Extremal set theory (05D05)

Cites Work

• Classification of subsets with minimal width and dual width in Grassmann, bilinear forms and dual polar graphs
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Title not available (Why is that?)
• Intersection theorems for systems of finite sets
• Nontrivial independent sets of bipartite graphs and cross-intersecting families
• A stability result for the Katona theorem
• The Erdős-Ko-Rado theorem for vector spaces
• Shadows and intersections in vector spaces
• \(q\)-analogs of the inclusion-exclusion principle and permutations with restricted position
• Sufficient Conditions for a Symmetric Chain Order
• A Hilton-Milner theorem for vector spaces
• Analogues of Milner's theorem for families without long chains and of vector spaces
• The Katona theorem for vector spaces

Cited In (1)

• Non \(t\)-intersecting families of linear spaces over \(GF(q)\)

This page was built for publication: Suboptimal \(s\)-union families and \(s\)-union antichains for vector spaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6041580)