Order-preserving representations of the partitions on the finite set

DOI10.1016/0097-3165(81)90010-8zbMath0474.06002OpenAlexW2012384808MaRDI QIDQ1159220

Tony T. Lee

Publication date: 1981

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(81)90010-8

zbMATH Keywords

partition lattice

Mathematics Subject Classification ID

Partial orders, general (06A06) Combinatorial aspects of partitions of integers (05A17) Representation theory of lattices (06B15) Elementary theory of partitions (11P81)

Related Items (3)

An algebraic theory of functional and multivalued dependencies in relational databases ⋮ A state space approach to the finite automata ⋮ Representations of a sublattice of the partition lattice on a lattice

Cites Work

• Unnamed Item
• Partioning algorithms for finite sets
• Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations

This page was built for publication: Order-preserving representations of the partitions on the finite set