Regularity in Weighted Graphs a Symmetric Function Approach

Authors

DOI:

https://doi.org/10.11575/cdm.v13i2.62459

Keywords:

regular graphs, symmetric functions, D-finite, generating functions

Abstract

This work describes how the class of k-regular multigraphs with edge multiplicities from a finite set can be expressed using symmetric species results of Mendez. Consequently, the generating functions can be computed systematically using the scalar product of symmetric functions. This gives conditions on when the classes are D-finite using criteria of Gessel, and a potential route to asymptotic enumeration formulas.

Author Biography

Marni Mishna, Simon Fraser University

Dept. Mathematics Associate Professor

References

1. F. Bergeron, Une combinatoire du pléthysme, J. Combin. Theory Ser. A 46 (1987), no. 2, 291-305. MR 914661 (89b:05017)

2. F. Bergeron, G. Labelle, and P. Leroux, Combinatorial species and tree-like structures, Encyclopedia of Mathematics and its Applications, vol. 67, Cambridge University Press, Cambridge, 1998, Translated from the 1994 French original by Margaret Readdy, With a foreword by Gian-Carlo Rota. MR 1629341 (2000a:05008)

3. M. Bousquet-Mélou, Rational and algebraic series in combinatorial enumeration, International Congress of Mathematicians. Vol. III, Eur. Math. Soc., Zürich, 2006, pp. 789-826. MR 2275707 (2007k:05008)

4. F. Chyzak, M. Mishna, and B. Salvy, Effective scalar products of D-finite symmetric functions, J. Combin. Theory Ser. A 112 (2005), no. 1, 1-43. MR 2167474 (2006d:05181)

5. É. de Panafieu and L. Ramon, Graphs with degree constraints, arXiv:1506.03061v1, 2015.

6. P. Flajolet, S. Gerhold, and B. Salvy, On the non-holonomic character of logarithms, powers, and the nth prime function, Electron. J. Combin. 11 (2004/06), no. 2, Article 2, 16. MR 2195433

7. P. Flajolet, S. Gerhold, and B. Salvy, On the non-holonomic character of logarithms, powers, and the nth prime function, Electron. J. Combin. 11 (2004/06), no. 2, Article 2, 16. MR 2195433 (2006h:05013)

8. A. Gainer-Dewar and I. M. Gessel, Enumeration of bipartite graphs and bipartite blocks, Electron. J. Combin. 21 (2014), no. 2, Paper 2.40, 20. MR 3244806

9. I. M. Gessel, Symmetric functions and P-recursiveness, J. Combin. Theory Ser. A 53 (1990), no. 2, 257-285. MR 1041448 (91c:05190)

10. I. P. Goulden, D. M. Jackson, and J. W. Reilly, The Hammond series of a symmetric function and its application to P-recursiveness, SIAM J. Algebraic Discrete Methods 4 (1983), no. 2, 179-193. MR 699770 (84g:05011)

11. C. Greenhill and B. D. McKay, Asymptotic enumeration of sparse nonnegative integer matrices with specified row and column sums, Adv. in Appl. Math. 41 (2008), no. 4,459-481. MR 2459445 (2009i:05021)

12. A. Henderson, Species over a finite field, J. Algebraic Combin. 21 (2005), no. 2, 147-161. MR 2142405 (2006c:05017)

13. A. Joyal, Une théorie combinatoire des séries formelles, Adv. in Math. 42 (1981), no. 1, 1-82. MR 633783 (84d:05025)

14. G. Labelle, Sur la symétrie et l'asymétrie des structures combinatoires, Theoret. Comput. Sci. 117 (1993), no. 1-2, 3-22, Conference on Formal Power Series and Algebraic Combinatorics (Bordeaux, 1991). MR 1235165 (94j:05006)

15. L. Lipshitz, The diagonal of a D-finite power series is D-finite, J. Algebra 113 (1988), no. 2, 373-378. MR 929767 (89c:13027)

16. B. D. McKay, Enumeration of sparse symmetric matrices without 1., Mathematisches Forschungsinstitut Oberwolfach Report No. 12/2014 (2014), 367-377, DOI: 10.4171/OWR/2014/12.

17. M. Méndez, Multisets and the combinatorics of symmetric functions, Adv. Math. 102 (1993), no. 1, 95-125. MR 1250467 (95g:05103)

18. M. Mishna, Automatic enumeration of regular objects, J. Integer Seq. 10 (2007), no. 5, Article 07.5.5, 18. MR 2304413 (2008a:05016)

19. R. P. Stanley, Enumerative combinatorics. Vol. 2, Cambridge Studies in Advanced Mathematics, vol. 62, Cambridge University Press, Cambridge, 1999, With a foreword

Downloads

Published

2018-12-31

Issue

Vol. 13 No. 2 (2018)

Section

Articles

License

 

This copyright statement was adapted from the statement for the University of Calgary Repository and from the statement for the Electronic Journal of Combinatorics (with permission).

The copyright policy for Contributions to Discrete Mathematics (CDM) is changed for all articles appearing in issues of the journal starting from Volume 15 Number 3.

Author(s) retain copyright over submissions published starting from  Volume 15 number 3.   When the author(s) indicate approval of the finalized version of the article provided by the technical editors of the journal and indicate approval, they grant to Contributions to Discrete Mathematics (CDM)  a world-wide, irrevocable, royalty free,  non-exclusive license as described below:

The author(s) grant to CDM the right to reproduce, translate (as defined below), and/or distribute the material, including the abstract, in print and electronic format, including but not limited to audio or video.

The author(s) agree that the journal may translate, without changing the content the material, to any medium or format for the purposes of preservation. 

The author(s) also agree that the journal may keep more than one copy of the article for the purposes of security, back-up, and preservation.

In granting the journal this license the author(s) warrant that the work is their original work and that they have the right to grant the rights contained in this license.

The authors represent that the work does not, to the best of their knowledge, infringe upon anyone’s copyright.

If the work contains material for which the author(s) do not hold copyright, the author(s) represent that the unrestricted permission of the copyright holder(s) to grant CDM the rights required by this license has been obtained, and that such third-party owned material is clearly identified and acknowledged within the text or content of the work.

The author(s) agree to ensure, to the extent reasonably possible, that further publication of the Work, with the same or substantially the same content, will acknowledge prior publication in CDM.

The journal highly recommends that the work be published with a Creative Commons license.   Unless otherwise arranged at the time the finalized version is approved and the licence granted with CDM,  the work will appear with the CC-BY-ND logo.  Here is the site to get more detail, and an excerpt from the site about the CC-BY-ND.  https://creativecommons.org/licenses/

Attribution-NoDerivs
CC BY-ND

This license lets others reuse the work for any purpose, including commercially; however, it cannot be shared with others in adapted form, and credit must be provided to you.