On the shortest sequences of elementary transformations in the partition lattice

zbMATH Open1394.05007MaRDI QIDQ1669945FDOQ1669945

Authors: V. A. Baranskii, Tat'yana Aleksandrovna Sen'chonok 

Publication date: 4 September 2018

Published in: Sibirskie Elektronnye Matematicheskie Izvestiya (Search for Journal in Brave)

Recommendations

• Lattice paths and order-preserving partial transformations
• Elementary equivalence of partition lattices
• Smallest set-transversals of \(k\)-partitions
• The lattice of finite subspace partitions
• The lattice theory of \(r\)-ordered partitions
• scientific article; zbMATH DE number 3861169
• scientific article; zbMATH DE number 4068271
• The restricted partition lattices
• scientific article; zbMATH DE number 802723
• A CONVERGENCE CRITERION FOR RECURRENT SEQUENCES WITH APPLICATION TO THE PARTITION LATTICE

zbMATH Keywords

latticeinteger partitionFerrer's diagram

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17)

Cites Work

• Title not available (Why is that?)
• The lattice of integer partitions
• The lattice of partitions of a positive integer
• On the partition lattice of all integers

Cited In (5)

• Algorithms for computing lengths of chains in integral partition lattices.
• On sequences of elementary transformations in the integer partitions lattice
• Longest chains in the lattice of integer partitions ordered by majorization
• AROUND THE ERDÖS–GALLAI CRITERION
• On maximal graphical partitions that are the nearest to a given graphical partition

This page was built for publication: On the shortest sequences of elementary transformations in the partition lattice

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