 |
Discrete Mathematics & Theoretical Computer Science |
Maciej Dolęga ; Piotr Sniady - Polynomial functions on Young diagrams arising from bipartite graphs
dmtcs:2908 - Discrete Mathematics & Theoretical Computer Science, January 1, 2011, DMTCS Proceedings vol. AO, 23rd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2011) - https://doi.org/10.46298/dmtcs.2908Polynomial functions on Young diagrams arising from bipartite graphsArticle
- 1 Instytut Matematyczny
- 2 Instytut Matematyczny PAN
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.
Source: HAL:hal-01215109v1
Volume: DMTCS Proceedings vol. AO, 23rd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2011)
Section: Proceedings
Published on: January 1, 2011
Imported on: January 31, 2017
Keywords: Polynomial functions on Young diagrams,coloring of bipartite graphs,differential calculus on Young diagrams,[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO],[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]
Consultation statistics
This page has been seen 243 times.
This article's PDF has been downloaded 258 times.