Skip to main content
SpringerLink
Log in

Distributed computation of ribbon tableaux and spin polynomials

  • Posters
  • Conference paper
  • First Online:
Parallel Virtual Machine — EuroPVM '96 (EuroPVM 1996)

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

Included in the following conference series:

  • 156 Accesses

Abstract

Recent works in algebraic combinatorics have brought up to date the importance of certain planar structures, called ribbon tableaux, which are generalizations of Young tableaux. This paper gives an algorithm to efficiently distribute, using PVM, the computation of the set of all ribbon tableaux of given shape and weight. It also provides a way to compute the spin polynomials associated to those sets of ribbon tableaux, these polynomials leading to generalizations of Hall-Littlewood functions.

Supported by Procope.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Betten, A., Veigneau, S., Wassermann, A.: Parallel Computation in Combinatorics using PVM, preprint, Université de Marne-la-Vallée, 1996.

    Google Scholar 

  2. Carré, C., Leclerc, B.: Splitting the square of a Schur function into its symmetric and antisymmetric parts. J. Alg. Comb. 4 (1995), 201–231.

    Google Scholar 

  3. Désarménien, J., Leclerc, B., Thibon J.-Y.: Hall-Littlewood functions and Kostka-Foulkes polynomials in representation theory. Séminaire Lotharingien de Combinatoire, Université de Strasbourg, 1993 (URL: http://cartan.ustrasbg.fr:80/∼slc/opapers/s32leclerc.html).

    Google Scholar 

  4. Geist, A., Beguelin, A., Dongarra, J., Jiang, W., Manchek, R., Sunderam, V.: PVM: Parallel Virtual Machine, A users guide and tutorial for networked parallel computing. MIT Press, 1994.

    Google Scholar 

  5. Kirillov, A. N., Lascoux, A., Leclerc, B., Thibon, J.-Y.: Séries génératrices pour les tableaux de dominos. C.R. Acad. Sci. Paris 318 (1994), 395–400.

    Google Scholar 

  6. Knuth, D.: The art of computer programming. Vol. 3, Addison-Wesley, 1981.

    Google Scholar 

  7. Lascoux, A., Leclerc, B., Thibon J.-Y.: Ribbon tableaux, Hall-Littlewood functions, Quantum affine algebras and unipotent varieties. preprint IGM 96.2, qalg/9512031.

    Google Scholar 

  8. Leclerc, B., Thibon J.-Y.: Canonical Bases of q-Deformed Fock Spaces. International Math. Research Notices, to appear.

    Google Scholar 

  9. Stanton, D., White, D.: A Schensted algorithm for rim-hook tableaux. J. Comb. Theory A 40 (1985), 211–247.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut Gaspard Monge, Université de Marne-la-Vallée, 2, rue de la Butte Verte, 93166, Noisy-le-Grand Cedex, France

    Sébastien Veigneau

Authors
  1. Sébastien Veigneau
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Arndt Bode Jack Dongarra Thomas Ludwig Vaidy Sunderam

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Veigneau, S. (1996). Distributed computation of ribbon tableaux and spin polynomials. In: Bode, A., Dongarra, J., Ludwig, T., Sunderam, V. (eds) Parallel Virtual Machine — EuroPVM '96. EuroPVM 1996. Lecture Notes in Computer Science, vol 1156. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3540617795_44

Download citation

  • DOI: https://doi.org/10.1007/3540617795_44

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61779-2

  • Online ISBN: 978-3-540-70741-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation