The lattice of partitions of a positive integer
From MaRDI portal
Publication:960662
DOI10.1134/S1064562408010183zbMATH Open1170.11035MaRDI QIDQ960662FDOQ960662
Authors: V. A. Baranskii, Tatyana A. Koroleva
Publication date: 5 January 2009
Published in: Doklady Mathematics (Search for Journal in Brave)
Recommendations
Cites Work
Cited In (16)
- Algorithms for computing lengths of chains in integral partition lattices.
- Chop vectors and the lattice of integer partitions
- Symbolic computation on the partition lattice of an \(n\)-set
- Lattices of partial sums.
- Title not available (Why is that?)
- The lattice of integer partitions and its infinite extension
- Longest chains in the lattice of integer partitions ordered by majorization
- AROUND THE ERDÖS–GALLAI CRITERION
- On the partition lattice of all integers
- Dominance order on signed integer partitions
- Chromatic uniqueness of elements of height \(\leq 3\) in lattices of complete multipartite graphs
- Title not available (Why is that?)
- On the shortest sequences of elementary transformations in the partition lattice
- Title not available (Why is that?)
- On maximal graphical partitions that are the nearest to a given graphical partition
- Title not available (Why is that?)
This page was built for publication: The lattice of partitions of a positive integer
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q960662)