Skip to Main content Skip to Navigation
Conference papers

Polynomial functions on Young diagrams arising from bipartite graphs

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.
Complete list of metadata

Cited literature [13 references]  Display  Hide  Download
Contributor : Coordination Episciences Iam Connect in order to contact the contributor
Submitted on : Tuesday, October 13, 2015 - 3:07:00 PM
Last modification on : Monday, November 23, 2020 - 12:52:03 PM
Long-term archiving on: : Thursday, April 27, 2017 - 12:23:33 AM


Publisher files allowed on an open archive




Maciej Dolęga, Piotr Sniady. Polynomial functions on Young diagrams arising from bipartite graphs. 23rd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2011), 2011, Reykjavik, Iceland. pp.257-268, ⟨10.46298/dmtcs.2908⟩. ⟨hal-01215109⟩



Record views


Files downloads