Partitions and their lattices
Combinatorics
2007-05-23 v1
Abstract
Ferrers graphs and tables of partitions are treated as vectors. Matrix operations are used for simple proofs of identities concerning partitions. Interpreting partitions as vectors gives a possibility to generalize partitions on negative numbers. Partitions are then tabulated into lattices and some properties of these lattices are studied. There appears a new identity counting Ferrers graphs packed consecutively into isoscele form. The lattices form the base for tabulating combinatorial identities.
Keywords
Cite
@article{arxiv.math/0604203,
title = {Partitions and their lattices},
author = {Milan kunz},
journal= {arXiv preprint arXiv:math/0604203},
year = {2007}
}