✦ LIBER ✦

Multiplicity of the trivial representation in rank-selected homology of the partition lattice

✍ Scribed by Phil Hanlon; Patricia Hersh

Publisher: Elsevier Science
Year: 2003
Tongue: English
Weight: 196 KB
Volume: 266
Category: Article
ISSN: 0021-8693
DOI: 10.1016/s0021-8693(03)00372-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Basis for the Homology of thed-Divisib

A Basis for the Homology of thed-Divisible Partition Lattice

✍ Michelle L. Wachs 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 764 KB

Representations of a sublattice of the p

Representations of a sublattice of the partition lattice on a lattice

✍ Ronny Rousseau 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 529 KB

A partial ordering is defined for monotone projections on a lattice, such that the set of these mappings is a lattice which is isomorphic to a sublattice of the partition lattice.

On the average rank of an element in a f

On the average rank of an element in a filter of the partition lattice

✍ Konrad Engel 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 399 KB

On the multiplicity of parts in a random

On the multiplicity of parts in a random partition

✍ Sylvie Corteel; Boris Pittel; Carla D. Savage; Herbert S. Wilf 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 200 KB 👁 2 views

Let be a partition of an integer n chosen uniformly at random among all Ž . such partitions. Let s be a part size chosen uniformly at random from the set of all part Ž . sizes that occur in . We prove that, for every fixed m G 1, the probability that s has Ž Ž .. multiplicity m in approaches 1r m mq

Chains in the lattice of noncrossing par

Chains in the lattice of noncrossing partitions

✍ Paul H. Edelman; Rodica Simion 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 735 KB

The lattice of noncrossing set partitions is known to admit an R-labeling. Under this labeling, maximal chains give rise to permutations. We discuss structural and enumerative properties of the lattice of noncrossing partitions, which pertain to a new permutation statistic, m(a), defined as the num

The Size of the Largest Antichain in the

The Size of the Largest Antichain in the Partition Lattice

✍ E.Rodney Canfield 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 268 KB

Consider the poset 6 n of partitions of an n-element set, ordered by refinement. The sizes of the various ranks within this poset are the Stirling numbers of the second kind. Let a= 1 2 &e log(2)Â4. We prove the following upper bound for the ratio of the size of the largest antichain to the size of