Skip to main content
×
×
Home

On the Zeros of Some Genus Polynomials

  • Saul Stahl (a1)
  • Please note a correction has been issued for this article.
Abstract

In the genus polynomial of the graph G, the coefficient of xk is the number of distinct embeddings of the graph G on the oriented surface of genus k. It is shown that for several infinite families of graphs all the zeros of the genus polynomial are real and negative. This implies that their coefficients, which constitute the genus distribution of the graph, are log concave and therefore also unimodal. The geometric distribution of the zeros of some of these polynomials is also investigated and some new genus polynomials are presented.

    • Send article to Kindle

      To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about sending to your Kindle.

      Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

      Find out more about the Kindle Personal Document Service.

      On the Zeros of Some Genus Polynomials
      Available formats
      ×
      Send article to Dropbox

      To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Dropbox.

      On the Zeros of Some Genus Polynomials
      Available formats
      ×
      Send article to Google Drive

      To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Google Drive.

      On the Zeros of Some Genus Polynomials
      Available formats
      ×
Copyright
References
Hide All
1. Archdeacon, D., Calculations on the average genus and genus distribution of graphs, Congr. Numer. 67(1988), 114124.
2. Archdeacon, D., The orientable genus is nonadditive, J. Graph Theory 10(1986), 385402.
3. Archdeacon, D., The nonorientable genus is additive, J. Graph Theory 10(1986), 363384.
4. Brenti, F., Royle, G.F. and Wagner, D.G., Location of zeros of chromatic and related polynomials of graphs, Canad. J. Math. 46(1994), 55-80.
5. Comtet, L., Advanced combinatorics, Reidel Publ. Co. Boston, 1974.
6. Cori, R., Machi, A., Penaud, J.G. and Vauquelin, B., On the automorphism group of a planar hypermap, European J. Combin. 2(1981), 331334.
7. Duke, R.A., The genus, regional number, and Betti number of a graph, Canad. J.Math. 134(1966), 817822.
8. Furst, M.L., Gross, J.L. and Statman, R., Genus distributions of two classes of graphs, J. Combinatorial Theory (B) 46(1989), 2236.
9. Gross, J.L., Robbins, D.P. and Tucker, T., Genus distributions for bouquets of circles, J. Combin. Theory Ser. B 47(1989), 292306.
10. Gross, J.L. and Tucker, T., Topological graph theory, Wiley-Interscience, New York, 1987.
11. Gross, J.L. and Furst, M., Hierarchy for imbedding distribution invariants of a graph, J. Graph Theory, 11(1987), 205220.
12. Harer, J. and Zagier, D., The Euler characteristics of the moduli space of curves, Invent. Math. 85(1986), 457485.
13. Heilman, O.J. and Lieb, E.H., Theory of monomer-dimer systems, Commun. Math. Phys. 25(1972), 190– 232.
14. Jackson, D.M., Counting cycles in permutations by group characters, with applications to a topological problem, Trans.Amer.Math. Soc. 299(1987), 785801.
15. Keilson, J. and Gerber, H., Some results for discrete unimodality, J. Amer. Statist. Assoc. 66(1971), 386389.
16. McGeoch, L.A., Genus distributions for circular and Möbius ladders, manuscript.
17. Rieper, R.G., Doctoral dissertation, Western Mischigan University, August 1987.
18. Stahl, S., Permutation-partition pairs: A combinatorial generalization of graph embeddings, Trans. Amer. Math. Soc. 259(1980), 129145.
19. Stahl, S., Permuttion-partition pairs III: Embedding distributions of linear families of graphs, J. Combin. Theory Ser. B 52(1991), 191218.
20. Stahl, S., On the number of maximum genus embeddings of almost all graphs, European J. Combin. 13(1992), 119126.
21. Stahl, S., Region distributions of some small diameter graphs, Discrete Math. 89(1991), 281299.
22. Stahl, S., A combinatorial analog of the Jordan Curve Theorem, J. Combin. Theory Ser. B 35(1983), 2838.
23. Stahl, S., A duality for permutations, Discrete Math. 71(1988), 257271.
24. Stanley, R.P., Log-concave and unimodal sequences in algebra, combinatorics, and geometry, In: Graph Theory and its Applications: East and West, Ann. New York Acad. Sci. 576(1986), 500535.
25. Wagner, D.G., The partition polynomial of a finite set system, J. Combin. Theory Ser.A 56(1991), 138159.
26. Wagner, D.G., Total positivity of Hadamard products, J. Math. Anal. Appl. 163(1992), 459483.
27. Walkup, D.W., How many ways can a permutation be factored into two n-cycles, ? DiscreteMath. 28(1979), 315319.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Canadian Journal of Mathematics
  • ISSN: 0008-414X
  • EISSN: 1496-4279
  • URL: /core/journals/canadian-journal-of-mathematics
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×
MathJax

Keywords

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed

Corrections have been issued for this article: