Polynomial functions on Young diagrams arising from bipartite graphs
Combinatorics
2011-07-01 v1
Abstract
We study the class of functions on the set of (generalized) Young diagrams arising as the number of embeddings of bipartite graphs. We give a criterion for checking when such a function is a polynomial function on Young diagrams (in the sense of Kerov and Olshanski) in terms of combinatorial properties of the corresponding bipartite graphs. Our method involves development of a differential calculus of functions on the set of generalized Young diagrams.
Cite
@article{arxiv.1105.2703,
title = {Polynomial functions on Young diagrams arising from bipartite graphs},
author = {Maciej Dołega and Piotr Śniady},
journal= {arXiv preprint arXiv:1105.2703},
year = {2011}
}
Comments
To appear in DMTCS proc