Inverse problems of the Erdős-Ko-Rado type theorems for families of vector spaces and permutations

DOI10.1007/S11425-020-1829-6MaRDI QIDQ2133641zbMATHOpenAlexWikidataFDO

Authors Xiangliang Kong, Yuanxiao Xi, Bingchen Qian, Gennian Ge

Publication date 4 May 2022

Published in Science China. Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

permutationsvector spacestotal intersection number

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Linear programming (90C05) Association schemes, strongly regular graphs (05E30) Extremal set theory (05D05)

Abstract: Ever since the famous ErdH{o}s-Ko-Rado theorem initiated the study of intersecting families of subsets, extremal problems regarding intersecting properties of families of various combinatorial objects have been extensively investigated. Among them, studies about families of subsets, vector spaces and permutations are of particular concerns. Recently, the authors proposed a new quantitative intersection problem for families of subsets: For $mathcalFsubseteq[n]choosek$, define its emph{total intersection number} as $mathcalI(mathcalF)=su{m}_{F_1,F_{2}inmathcalF}|F_{1}cap{F}_2|$. Then, what is the structure of $mathcalF$ when it has the maximal total intersection number among all families in $[n]choosek$ with the same family size? In cite{KG2020}, the authors studied this problem and characterized extremal structures of families maximizing the total intersection number of given sizes. In this paper, we consider the analogues of this problem for families of vector spaces and permutations. For certain ranges of family size, we provide structural characterizations for both families of subspaces and families of permutations having maximal total intersection numbers. To some extent, these results determine the unique structure of the optimal family for some certain values of $|mathcalF|$ and characterize the relation between having maximal total intersection number and being intersecting. Besides, we also show several upper bounds on the total intersection numbers for both families of subspaces and families of permutations of given sizes.

Recommendations

• Intersection theorems for \(\{0,\pm1\}\)-vectors and \(s\)-cross-intersecting families
• The Erdős-Ko-Rado theorem for vector spaces
• Intersecting families of discrete structures are typically trivial
• The number of \(k\)-intersections of an intersecting family of \(r\)-sets
• An Erdős--Ko--Rado theorem for partial permutations

Cites work

• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 3341050 (Why is no real title available?)
• scientific article; zbMATH DE number 2232233 (Why is no real title available?)
• A Hilton-Milner theorem for vector spaces
• A note on supersaturated set systems
• A quasi-stability result for dictatorships in \(S_n\)
• Algebraic Graph Theory
• Cayley graph on symmetric group generated by elements fixing \(k\) points
• Classification of subsets with minimal width and dual width in Grassmann, bilinear forms and dual polar graphs
• Compressions and probably intersecting families
• Disjoint pairs in set systems with restricted intersection
• Erdős-Ko-Rado theorems. Algebraic approaches
• Intersecting families of discrete structures are typically trivial
• Intersecting families of permutations
• Intersecting families of permutations
• LOW-DEGREE BOOLEAN FUNCTIONS ON , WITH AN APPLICATION TO ISOPERIMETRY
• Lower bound on the dimensions or irreducible representations of symmetric groups and on the exponents of varieties of Lie algebras
• Most probably intersecting families of subsets
• On the maximum number of permutations with given maximal or minimal distance
• On the partition associated to the smallest eigenvalues of the \(k\)-point fixing graph
• Removal and stability for Erdős-Ko-Rado
• Shadows and intersections in vector spaces
• Stability for \(t\)-intersecting families of permutations
• Stable sets of maximal size in Kneser-type graphs
• Structure and supersaturation for intersecting families
• The Erdős-Ko-Rado theorem for vector spaces
• The Hook Graphs of the Symmetric Group
• The minimum number of disjoint pairs in set systems and related problems
• The representation theory of the symmetric groups

Cited in

(1)

• \(r\)-cross \(t\)-intersecting families for vector spaces

This page was built for publication: Inverse problems of the Erdős-Ko-Rado type theorems for families of vector spaces and permutations

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