scholarly journals Filters in the partition lattice

2017 ◽  
Vol 47 (3) ◽  
pp. 403-439
Author(s):  
Richard Ehrenborg ◽  
Dustin Hedmark
Keyword(s):  
10.37236/5940 ◽  
2016 ◽  
Vol 23 (3) ◽  
Author(s):  
Melody Bruce ◽  
Michael Dougherty ◽  
Max Hlavacek ◽  
Ryo Kudo ◽  
Ian Nicolas

There is a well-known bijection between parking functions of a fixed length and maximal chains of the noncrossing partition lattice which we can use to associate to each set of parking functions a poset whose Hasse diagram is the union of the corresponding maximal chains. We introduce a decomposition of parking functions based on the largest number omitted and prove several theorems about the corresponding posets. In particular, they share properties with the noncrossing partition lattice such as local self-duality, a nice characterization of intervals, a readily computable Möbius function, and a symmetric chain decomposition. We also explore connections with order complexes, labeled Dyck paths, and rooted forests.


1962 ◽  
Vol 14 ◽  
pp. 451-460 ◽  
Author(s):  
David Sachs

It is well known (1, p. 162) that the lattice of subalgebras of a finite Boolean algebra is dually isomorphic to a finite partition lattice. In this paper we study the lattice of subalgebras of an arbitrary Boolean algebra. One of our main results is that the lattice of subalgebras characterizes the Boolean algebra. In order to prove this result we introduce some notions which enable us to give a characterization and representation of the lattices of subalgebras of a Boolean algebra in terms of a closure operator on the lattice of partitions of the Boolean space associated with the Boolean algebra. Our theory then has some analogy to that of the lattice theory of topological vector spaces. Of some interest is the problem of classification of Boolean algebras in terms of the properties of their lattice of subalgebras, and we obtain some results in this direction.


2010 ◽  
Vol 53 (2) ◽  
pp. 299-310 ◽  
Author(s):  
Thomas Brady ◽  
Colum Watt

AbstractFor each finite real reflection group W, we identify a copy of the type-W simplicial generalized associahedron inside the corresponding simplicial permutahedron. This defines a bijection between the facets of the generalized associahedron and the elements of the type-W non-crossing partition lattice that is more tractable than previous such bijections. We show that the simplicial fan determined by this associahedron coincides with the Cambrian fan for W.


1980 ◽  
Vol 10 (1) ◽  
pp. 74-95 ◽  
Author(s):  
Pavel Pudlák ◽  
Jiří T⫲ma

10.37236/83 ◽  
2009 ◽  
Vol 16 (2) ◽  
Author(s):  
Russ Woodroofe

We consider the problem of constructing a convex ear decomposition for a poset. The usual technique, introduced by Nyman and Swartz, starts with a $CL$-labeling and uses this to shell the 'ears' of the decomposition. We axiomatize the necessary conditions for this technique as a "$CL$-ced" or "$EL$-ced". We find an $EL$-ced of the $d$-divisible partition lattice, and a closely related convex ear decomposition of the coset lattice of a relatively complemented finite group. Along the way, we construct new $EL$-labelings of both lattices. The convex ear decompositions so constructed are formed by face lattices of hypercubes. We then proceed to show that if two posets $P_{1}$ and $P_{2}$ have convex ear decompositions ($CL$-ceds), then their products $P_{1}\times P_{2}$, $P_{1}\check{\times} P_{2}$, and $P_{1}\hat{\times} P_{2}$ also have convex ear decompositions ($CL$-ceds). An interesting special case is: if $P_{1}$ and $P_{2}$ have polytopal order complexes, then so do their products.


Sign in / Sign up

Export Citation Format

Share Document