Shifted set families, degree sequences, and plethysm (Q1010720): Difference between revisions

Summary: We study, in three parts, degree sequences of \(k\)-families (or \(k\)-uniform hypergraphs) and shifted \(k\)-families. {\parindent=6mm \begin{itemize}\item[{\(\bullet\)}]The first part collects for the first time in one place, various implications such as \newline Threshold \(\Rightarrow\) Uniquely realizable \(\Rightarrow\) Degree-Maximal \(\Rightarrow\) Shifted\newline which are equivalent concepts for 2-families (= simple graphs), but strict implications for \(k\)-families with \(k \geq 3\). The implication that uniquely realizable implies degree-maximal seems to be new. \item[{\(\bullet\)}]The second part recalls \textit{R. Merris} and \textit{T. Roby}'s [JIPAM, J. Inequal. Pure Appl. Math. 6, No. 1, Paper No. 2, 21 p., electronic only (2005; Zbl 1076.05008)] reformulation of the characterization due to \textit{E. Ruch} and \textit{I. Gutman} [J. Comb. Inf. Syst. Sci. 4, 285--295 (1980; Zbl 0461.05057)] for graphical degree sequences and shifted 2-families. If then introduces two generalizations which are charachterizations of shifted \(k\)-families \item[{\(\bullet\)}]The third part recalls the connection between degree sequences of \(k\)-families of size \(m\) and the plethysm of elementary symmetric functions \(e_m[e_k]\). It then uses highest weight theory to explain how stifted \(k\)-families provide the ``top part'' of these plethysm expansions, along with offering a conjecture about a further relation. \end{itemize}}