Skip to main content
SpringerLink
Log in

Generating Series of the Trace Group

  • Conference paper
  • First Online:
Developments in Language Theory (DLT 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2710))

Included in the following conference series:

Abstract

We prove an analog for trace groups of the Möbius inversion formula for trace monoids (Cartier-Foata, 1969). A by-product is to obtain an explicit and combinatorial formula for the growth series of a trace group. This is used to study the average height of traces.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Bouillard. Rapport de DEA: Le groupe de traces. LIAFA research report 2002-13, Université Paris 7, 2002.

    Google Scholar 

  2. C. Campbell, E. Robertson, N. Ruškuc, and R. Thomas. Automatic semigroups. Theoret. Comput. Sci., 250(1–2):365–391, 2001.

    Article  MATH  MathSciNet  Google Scholar 

  3. P. Cartier and D. Foata. Problèmes combinatoires de commutation et réarrangements. Number 85 in Lecture Notes in Mathematics. Springer, 1969.

    Google Scholar 

  4. C. Choffrut and M. Goldwurm. Determinants and Möbius functions in trace monoids. Discrete Math., 194(1–3):239–247, 1999.

    Article  MATH  MathSciNet  Google Scholar 

  5. V. Diekert. Combinatorics on traces. Number 454 in LNCS. Springer Verlag, 1990.

    MATH  Google Scholar 

  6. V. Diekert and A. Muscholl. Solvability of equations in free partially commutative groups is decidable. In ICALP’01, n. 2076 in LNCS, pages 543–554. Springer, 2001.

    Google Scholar 

  7. V. Diekert and G. Rozenberg, editors. The Book of Traces. World Scientific, 1995.

    Google Scholar 

  8. C. Droms, B. Servatius, and H. Servatius. Groups assembled from free and direct products. Discrete Math., 109:69–75, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  9. C. Duboc. Commutations dans les monoïdes libres: un cadre théorique pour l’étude du parallélisme. PhD thesis, Univ. Rouen, 1986.

    Google Scholar 

  10. G. Duchamp and D. Krob. Partially commutative Magnus transformations. Internat. J. Algebra Comput., 3:15–41, 1993.

    Article  MATH  MathSciNet  Google Scholar 

  11. D. Epstein, J. Cannon, D. Holt, S. Levy, M. Paterson, and W. Thurston. Word processing in groups. Jones and Bartlett, Boston, 1992.

    MATH  Google Scholar 

  12. M. Goldwurm and M. Santini. Clique polynomials have a unique root of smallest modulus. Information Processing Letters, 75(3):127–132, 2000.

    Article  MathSciNet  Google Scholar 

  13. G. Hardy and E. Wright. An introduction to the theory of numbers. Oxford at the Clarendon Press, 1979. 5-th edition.

    Google Scholar 

  14. D. Krob, J. Mairesse, and I. Michos. Computing the average parallelism in trace monoids. Discrete Math., 2002. Accepted for publication. An abridged version appears in STACS’02, LNCS 2285, p. 477–488, Springer.

    Google Scholar 

  15. G. Lallement. Semigroups and Combinatorial Applications. Wiley, New-York, 1979.

    MATH  Google Scholar 

  16. G.-C. Rota. On the foundations of combinatorial theory. I. Theory of Möbius functions. Z. Wahrscheinlichkeitstheor. Verw. Geb., 2:340–368, 1964.

    Article  MATH  MathSciNet  Google Scholar 

  17. A. Vershik, S. Nechaev, and R. Bikbov. Statistical properties of locally free groups with applications to braid groups and growth of random heaps. Commun. Math. Phys., 212(2):469–501, 2000.

    Article  MATH  MathSciNet  Google Scholar 

  18. G.X. Viennot. Heaps of pieces, I: Basic definitions and combinatorial lemmas. In Labelle and Leroux, editors, Combinatoire Énumérative, number 1234 in Lect. Notes in Math., pages 321–350. Springer, 1986.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Liafa, Cnrs, Université Paris 7, Case 7014 - 2, place Jussieu, 75251, Paris Cedex 5, France

    Anne Bouillard & Jean Mairesse

Authors
  1. Anne Bouillard
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jean Mairesse
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Informatics, University of Szeged, Árpád tér 2, 6720, Szeged, Hungary

    Zoltán Ésik  & Zoltán Fülöp  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bouillard, A., Mairesse, J. (2003). Generating Series of the Trace Group. In: Ésik, Z., Fülöp, Z. (eds) Developments in Language Theory. DLT 2003. Lecture Notes in Computer Science, vol 2710. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45007-6_12

Download citation

  • DOI: https://doi.org/10.1007/3-540-45007-6_12

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40434-7

  • Online ISBN: 978-3-540-45007-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation