Frankl's Conjecture for a subclass of semimodular lattices
نویسندگان
چکیده مقاله:
In this paper, we prove Frankl's Conjecture for an upper semimodular lattice $L$ such that $|J(L)setminus A(L)| leq 3$, where $J(L)$ and $A(L)$ are the set of join-irreducible elements and the set of atoms respectively. It is known that the class of planar lattices is contained in the class of dismantlable lattices and the class of dismantlable lattices is contained in the class of lattices having breadth at most two. We provide a very short proof of the Conjecture for the class of lattices having breadth at most two. This generalizes the results of Joshi, Waphare and Kavishwar as well as Czédli and Schmidt.
منابع مشابه
Frankl’s Conjecture for Large Semimodular and Planar Semimodular Lattices
A lattice L is said to satisfy (the lattice theoretic version of) Frankl’s conjecture if there is a join-irreducible element f ∈ L such that at most half of the elements x of L satisfy f ≤ x. Frankl’s conjecture, also called as union-closed sets conjecture, is well-known in combinatorics, and it is equivalent to the statement that every finite lattice satisfies Frankl’s conjecture. Let m denote...
متن کاملA Construction of Semimodular Lattices
In this paper we prove that if !.l' is a finite lattice. and r is an integral valued function on !.l' satisfying some very natural then there exists a finite geometric (that is.• semimodular and atomistic) lattice containing asa sublatticesuch that r !.l'restricted to Sf. Moreover. we show that if, for all intervals of. semimodular lattices of length at most r(e) are given. then can be chosen t...
متن کاملCongruence Lattices of Finite Semimodular Lattices
We prove that every finite distributive lattice can be represented as the congruence lattice of a finite (planar) semimodular lattice.
متن کاملSemimodular Lattices and Semibuildings
In a ranked lattice, we consider two maximal chains, or “flags” to be i-adjacent if they are equal except possibly on rank i . Thus, a finite rank lattice is a chamber system. If the lattice is semimodular, as noted in [9], there is a “Jordan-Hölder permutation” between any two flags. This permutation has the properties of an Sn-distance function on the chamber system of flags. Using these noti...
متن کاملGraph Automorphisms of Semimodular Lattices
This paper deals with the relations between graph automorphisms and direct factors of a semimodular lattice of locally finite length.
متن کاملA Generalization of Semimodular Supersolvable Lattices
Stanley [18] introduced the notion of a supersolvable lattice, L, in part to combinatorially explain the factorization of its characteristic polynomial over the integers when L is also semimodular. He did this by showing that the roots of the polynomial count certain sets of atoms of the lattice. In the present work we define an object called an atom decision tree. The class of semimodular latt...
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ذخیره در منابع من قبلا به منابع من ذحیره شده{@ msg_add @}
عنوان ژورنال
دوره 11 شماره Special Issue Dedicated to Prof. George A. Grätzer
صفحات 197- 206
تاریخ انتشار 2019-07-01
با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023