Skip to main content
SpringerLink
Log in

Enriched Collections

  • Chapter
  • First Online:
Nonsymmetric Operads in Combinatorics

  • 249 Accesses

Abstract

This preliminary chapter contains general notions about combinatorics used in the rest of the book. We introduce the notion of collections of combinatorial objects and then the notions of posets and rewrite systems, which are seen as collections endowed with some extra structure.

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

Access this chapter

Log in via an institution
eBook
USD 16.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 54.99
Price excludes VAT (USA)
  • Durable hardcover 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

References

  1. G.M. Adelson-Velsky, E.M. Landis, An algorithm for the organization of information. Sov. Math. Dokl. 3, 1259–1263 (1962)

    Google Scholar 

  2. A Björner, Orderings of coxeter groups, in Combinatorics and Algebra. Contemporary Mathematics, vol. 34 (American Mathematical Society, Providence, 1984), pp. 175–195

    Google Scholar 

  3. F. Bergeron, G. Labelle, P. Leroux, Combinatorial Species and Tree-Like Structures. Encyclopedia of Mathematics and Its Applications, vol. 67 (Cambridge University Press, Cambridge, 1998)

    Google Scholar 

  4. F. Bergeron, G. Labelle, P. Leroux, Introduction to the Theory of Species of Structures (Université du Québec à Montréal, Montreal, 2013)

    Google Scholar 

  5. M. Bousquet-Mélou, É. Fusy, L.-F. Préville-Ratelle, The number of intervals in the m-Tamari lattices. Electron. J. Comb. 18(2) (2011); Paper 31

    Google Scholar 

  6. F. Baader, T. Nipkow, Term Rewriting and All That (Cambridge University Press, Cambridge, 1998), pp. xii+301

    Google Scholar 

  7. F. Bergeron, L.-F. Préville-Ratelle, Higher trivariate diagonal harmonics via generalized Tamari posets. J. Comb. 3(3), 317–341 (2012)

    MathSciNet  MATH  Google Scholar 

  8. B. Buchberger, A theoretical basis for the reduction of polynomials to canonical forms. ACM SIGSAM Bull. 10(3), 19–29 (1976)

    Article  MathSciNet  Google Scholar 

  9. F. Chapoton, Sur le nombre d’intervalles dans les treillis de Tamari. Sém. Lothar. Combin. B55f, 18 (2006)

    Google Scholar 

  10. H.S.M. Coxeter, Discrete groups generated by reflections. Ann. Math. 35(3), 588–621 (1934)

    Article  MathSciNet  Google Scholar 

  11. P. Flajolet, R. Sedgewick, Analytic Combinatorics (Cambridge University Press, Cambridge, 2009)

    Book  Google Scholar 

  12. G.Th. Guilbaud, P. Rosenstiehl, Analyse algébrique d’un scrutin. Math. Sci. Hum. 4, 9–33 (1963)

    Google Scholar 

  13. F. Hivert, J.-C. Novelli, J.-Y. Thibon, The algebra of binary search trees. Theor. Comput. Sci. 339(1), 129–165 (2005)

    Article  MathSciNet  Google Scholar 

  14. S. Huang, D. Tamari, Problems of associativity: a simple proof for the lattice property of systems ordered by a semi-associative law. J. Comb. Theory A 13, 7–13 (1972)

    Article  MathSciNet  Google Scholar 

  15. A. Joyal, Une théorie combinatoire des séries formelles. Adv. Math. 42(1), 1–82 (1981)

    Article  MathSciNet  Google Scholar 

  16. D. Knuth, P. Bendix, Simple word problems in universal algebras, in Computational Problems in Abstract Algebra (Pergamon, Oxford, 1970), pp. 263–297

    MATH  Google Scholar 

  17. D. Knuth, The Art of Computer Programming. Sorting and Searching, vol. 3 (Addison Wesley Longman, Boston, 1998), pp. xiv+780

    Google Scholar 

  18. J. Kock, Notes on Polynomial Functors. Unpublished (2009). http://mat.uab.es/~kock/cat/notes-on-polynomial-functors.html

  19. J.-L. Loday, M. Ronco, Hopf algebra of the planar binary trees. Adv. Math. 139, 293–309 (1998)

    Article  MathSciNet  Google Scholar 

  20. J.-L. Loday, M. Ronco, Order structure on the algebra of permutations and of planar binary trees. J. Algebra Comb. 15(3), 253–270 (2002)

    Article  MathSciNet  Google Scholar 

  21. M.A. Méndez, Set Operads in Combinatorics and Computer Science. SpringerBriefs in Mathematics (Springer, Cham, 2015), pp. xvi+129

    Google Scholar 

  22. M.H.A. Newman, On theories with a combinatorial definition of “equivalence”. Ann. Math. 43(2), 223–243 (1942)

    Article  MathSciNet  Google Scholar 

  23. N.J.A. Sloane, The on-line encyclopedia of integer sequences (1996). https://oeis.org/

  24. D. Tamari, The algebra of bracketings and their enumeration. Nieuw Arch. Wisk. 10(3), 131–146 (1962)

    MathSciNet  MATH  Google Scholar 

  25. T. Yanagimoto, M. Okamoto, Partial orderings of permutations and monotonicity of a rank correlation statistic. Ann. I. Stat. Math. 21, 489–506 (1969)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Paris-Est, Marne-la-Vallee, France

    Samuele Giraudo

Authors
  1. Samuele Giraudo
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Giraudo, S. (2018). Enriched Collections. In: Nonsymmetric Operads in Combinatorics. Springer, Cham. https://doi.org/10.1007/978-3-030-02074-3_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-02074-3_2

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-02073-6

  • Online ISBN: 978-3-030-02074-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation