On forbidden poset problems in the linear lattice

DOI10.37236/8831MaRDI QIDQ2290344zbMATH OpenOpenAlexFDO

Authors Casey Tompkins, Ji Meng Xiao

Publication date 27 January 2020

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/1905.09246, https://www.combinatorics.org/ojs/index.php/eljc/article/view/v27i1p18

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Mathematics Subject Classification ID

Extremal set theory (05D05) Combinatorics of partially ordered sets (06A07) Structure theory of lattices (06B05)

Abstract: In this note, we determine the maximum size of a $V_k,Lambd{a}_l$-free family in the lattice of vector subspaces of a finite vector space both in the non-induced case as well as the induced case, for a large range of parameters $k$ and $l$. These results generalize earlier work by Shahriari and Yu. We also prove a general LYM-type lemma for the linear lattice which resolves a conjecture of Shahriari and Yu.

Review text

Summary: In this note, we determine the maximum size of a \(\{\mathrm{V}_k, \Lambda_l\} \)-free family in the lattice of vector subspaces of a finite vector space both in the non-induced case as well as the induced case, for a large range of parameters \(k\) and \(l\). These results generalize earlier work by \textit{S. Shahriari} and \textit{S. Yu} [``Avoiding brooms, forks, and butterflies in the linear lattices, Preprint, \url{arXiv:1807.06259}]. We also prove a general LYM-type lemma for the linear lattice which resolves a conjecture of Shahriari and Yu [loc. cit.].

Recommendations

• Avoiding brooms, forks, and butterflies in the linear lattices
• Induced and non-induced forbidden subposet problems
• scientific article; zbMATH DE number 1075005
• On the number of containments in \(P\)-free families
• Diamond-free subsets in the linear lattices

Cites work

• A note on the largest size of families of sets with a forbidden poset
• A simple proof for a forbidden subposet problem
• An extremal problem with excluded subposet in the Boolean lattice
• An improvement of the general bound on the largest family of subsets avoiding a subposet
• Avoiding brooms, forks, and butterflies in the linear lattices
• Diamond-free subsets in the linear lattices
• Exact forbidden subposet results using chain decompositions of the cycle
• scientific article; zbMATH DE number 3845613 (Why is no real title available?)
• Largest families without an \(r\)-fork
• Largest family without A B C D
• Shadows and intersections in vector spaces
• The method of double chains for largest families with excluded subposets

Cited in

(9)

• scientific article; zbMATH DE number 4041978 (Why is no real title available?)
• Diamond-free subsets in the linear lattices
• LYM-type inequality for \(t\)-intersecting antichains in linear lattices
• The covering lemma and q-analogues of extremal set theory problems
• Intersecting V-free, -free families
• Addendum to: M. Conforti and M. R. Rao, ``Articulation sets in linear perfect matrices. I: Forbidden configurations and star cutsets, Discrete Mathematics 104 (1992) 23--47
• 3-cluster-free families of subspaces
• Forbidden configurations for distributive, modular and semidistributive posets
• Avoiding brooms, forks, and butterflies in the linear lattices

This page was built for publication: On forbidden poset problems in the linear lattice

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