Abstract
We study and derive identities for the multi-variate independence polynomials from the perspective of heaps theory. Using the inversion formula and the combinatorics of partially commutative algebras we show how the multi-variate version of Godsil type identity as well as the fundamental identity can be obtained from weight preserving bijections. Finally, we obtain a multi-variate identity involving connected bipartite subgraphs similar to the Christoffel–Darboux type identities obtained by Bencs.
Similar content being viewed by others
References
Arunkumar G, Kus Deniz and Venkatesh R, Root multiplicities for Borcherds algebras and graph coloring, J. Algebra 499 (2018) 538–569
Bencs F, Christoffel–Darboux type identities for the independence polynomial, Combin. Probab. Comput. 27(5) (2018) 716–724
Bencs F, On trees with real-rooted independence polynomial, Discrete Math. 341(12) (2018) 3321–3330
Bousquet-Mélou M and Viennot X G, Empilements de segments et \(q\)-énumération de polyominos convexes dirigés, J. Combin. Theory Ser. A 60(2) (1992) 196–224
Cartier P and Foata D, Problèmes combinatoires de commutation et réarrangements, Lecture Notes in Mathematics, No. 85 (1969) (Berlin–New York: Springer-Verlag)
Chudnovsky M and Seymour P, The roots of the independence polynomial of a clawfree graph. J. Combin. Theory Ser. B, 97(3) (2007) 350–357
Godsil C D, Matchings and walks in graphs, J. Graph Theory 5(3) (1981) 285–297
Godsil C D, Algebraic combinatorics, Chapman and Hall Mathematics Series (1993) (New York: Chapman & Hall)
Gutman I, An identity for the independence polynomials of trees, Publ. Inst. Math. (Beograd) (N.S.) 50(64) (1991) 19–23
Hoede C and Li X-L, Clique polynomials and independent set polynomials of graphs, Discrete Math. 125(1–3) (1994) 219–228 13th British Combinatorial Conference (1991) (Guildford)
Leake J D and Ryder N R, Generalizations of the matching polynomial to the multivariate independence polynomial, Algebr. Comb. 2(5) (2019) 781–802
Marcus A W, Spielman D A and Srivastava N, Interlacing families I: Bipartite Ramanujan graphs of all degrees, Ann. Math. (2) 182(1) (2015) 307–325
Viennot G X, Heaps of pieces. I. Basic definitions and combinatorial lemmas, in Combinatoire énumérative (Montreal, Que., 1985/Quebec, Que., 1985) volume 1234 of Lecture Notes in Math., pages 321–350 (1986) (Berlin: Springer)
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicating Editor: C S Rajan
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Kus, D., Singh, K. & Venkatesh, R. Identities of the multi-variate independence polynomials from heaps theory. Proc Math Sci 134, 16 (2024). https://doi.org/10.1007/s12044-024-00786-2
Received:
Accepted:
Published:
DOI: https://doi.org/10.1007/s12044-024-00786-2