Skip to main content

Une combinatoire non-commutative pour l'etude des nombres secants

  • 839 Accesses

Part of the Lecture Notes in Mathematics book series (LNM,volume 1234)

Abstract

There is a non-commutative combinatorial setting in which the up-down structure of permutations can most naturally be studied. In this setting the definition of various differential and integral operators and different types of substitution operations provides us with the tools and language needed to derive and express many of the laws governing these combinatorial structures.

Keywords

  • Nous Avons
  • Permutation Classees
  • Nous Obtenons
  • Nous Devon
  • Grand Element

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   44.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   59.95
Price excludes VAT (Canada)
  • 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Références bibliographiques

  1. Carlitz L.-Permutations with prescribed pattern I., Math. Nachr. (58), 1973, pp 31–53.

    Google Scholar 

  2. -Permutations with prescribed pattern II. Applications, Math. Nachr. (83), 1978, pp 101–126.

    Google Scholar 

  3. Foata D., Schutzenberger M.-P., Théorie géométrique des polynômes eulériens, Lecture Notes in Mathematics #138, Springer-Verlag, 1970.

    Google Scholar 

  4. Goulden I.P., Jackson D.M., Combinatorial enumeration, John Wiley & Sons, 1983, pp 230–260.

    Google Scholar 

  5. Joyal A., Une théorie combinatoire des séries formelles, Advances in mathematics, vol. 42 no. 1, oct. 81.

    Google Scholar 

  6. MacMahon P.A., Combinatory analysis, Vol. I, II, Chelsea Publishing company, N.Y., 1960, Vol. I, pp 187–196.

    MATH  Google Scholar 

  7. Rawlings D., The ABC's of classical enumeration, 1985, (soumis pour publication).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 1986 Springer-Verlag

About this paper

Cite this paper

Longtin, A. (1986). Une combinatoire non-commutative pour l'etude des nombres secants. In: Labelle, G., Leroux, P. (eds) Combinatoire énumérative. Lecture Notes in Mathematics, vol 1234. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0072519

Download citation

  • DOI: https://doi.org/10.1007/BFb0072519

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-17207-9

  • Online ISBN: 978-3-540-47402-9

  • eBook Packages: Springer Book Archive