Seminaire Lotharingien de Combinatoire Article B58c

Description

Niveau: Supérieur, Doctorat, Bac+8
Seminaire Lotharingien de Combinatoire 58 (2008), Article B58c OPERADS AND ALGEBRAIC COMBINATORICS OF TREES F. CHAPOTON Abstract. This text is an introduction to operads from a combinatorial point of view. We give the definition, several examples of operads and the construction of a group from each operad. 1. Introduction Combinatorics is concerned with finite objects, and considers problems such as enumerating some finite sets or finding bijections between different sets. Algebraic combinatorics could be defined as the reciprocal application of methods and ideas of algebra to combinatorics or the other way round. Since the pioneering work of Rota “on the foundations of combinatorial theory”, these subjects have become an active and central piece of mathematics. Up to now, most of the algebraic structures used in algebraic combinatorics have been well-established and classical notions of algebra. One of the main streams is the use of associative algebras and their representation theory, where combina- torial objects appear typically as labelling sets for some basis, or in a description of some modules. For instance, partitions, as considered in number theory, play an important role in representation theory of symmetric groups, general linear groups and many related algebras. Similarly, there has been recently a lot of activity on relations between Hopf algebras and combinatorial objects. One salient point of these works is the ap- pearance of new kinds of combinatorial entities, such as different kinds of trees, in an algebraic context.

• algebras


• symmetric operad


• r's then composing


• top compositions


• algebras up


• associative algebras


• permutations ?? associative


• composition maps


• trees

Sujets

• Algebra
• Associative algebra

Informations

• Publié par: mijec
• Nombre de lectures: 32
• Langue: English

Extrait

Se´minaireLotharingiendeCombinatoire58(2008),ArticleB58c OPERADSANDALGEBRAICCOMBINATORICSOFTREES F.CHAPOTON Abstract. Thistextisanintroductiontooperadsfromacombinatorialpoint ofview.Wegivethedefinition,severalexamplesofoperadsandtheconstruction ofagroupfromeachoperad. 1. Introduction Combinatoricsisconcernedwithfiniteobjects,andconsidersproblemssuchas enumeratingsomefinitesetsorfindingbijectionsbetweendifferentsets.Algebraic combinatoricscouldbedefinedasthereciprocalapplicationofmethodsandideas ofalgebratocombinatoricsortheotherwayround.Sincethepioneeringworkof Rota“onthefoundationsofcombinatorialtheory”,thesesubjectshavebecome anactiveandcentralpieceofmathematics. Uptonow,mostofthealgebraicstructuresusedinalgebraiccombinatoricshave beenwell-establishedandclassicalnotionsofalgebra.Oneofthemainstreams istheuseofassociativealgebrasandtheirrepresentationtheory,wherecombina- torialobjectsappeartypicallyaslabellingsetsforsomebasis,orinadescription ofsomemodules.Forinstance,partitions,asconsideredinnumbertheory,play animportantroleinrepresentationtheoryofsymmetricgroups,generallinear groupsandmanyrelatedalgebras. Similarly,therehasbeenrecentlyalotofactivityonrelationsbetweenHopf algebrasandcombinatorialobjects.Onesalientpointoftheseworksistheap- pearanceofnewkindsofcombinatorialentities,suchasdifferentkindsoftrees, inanalgebraiccontext. Thepresenttextwouldliketoadvocateforthepotentialuseincombinatorics ofamorerecentalgebraicnotion,whichiscalledanoperad.Thisnotionhasfirst beenintroducedinalgebraictopologyintheearly1970’s(Boardman–Vogt,May [BV73,May72])forthestudyofloopspaces.Therewasa“renaissance”,arenewed interestinoperads,inthe1990’s,withtheKoszuldualitytheoryintroducedby GinzburgandKapranov[GK94]andalsoinrelationwithmodulispacesofcurves [LSV97].Morerecently,thetheoryofoperadshasseenfurtherdevelopmentsin manydirections.Operadsareusefultodescribeandworkwithcomplicatednew kindsofalgebrasandalgebrasuptohomotopy.

2F.CHAPOTON Theideaofanoperadiscloselyrelatedtotrees,inasimilarsensethatthe ideaofanassociativealgebraisrelatedtothenotionofwords.Operadscould beusefulincombinatoricsinseveralways.First,theycanshedlightonsome classicalcombinatorialobjects,byendowingthemwithnewalgebraicstructures, muchlikeassociativealgebrasdoforpartitions.Next,theycanprovidethesetting forveryrefinedversionsofgeneratingseries,wheretheindicesarenolongerthe setofintegers,butsomesetofcombinatorialobjects,suchastreesofvarious sorts. Wehavetriedtopresentthetheoryofoperadstoacombinatorialaudience,by aspecificchoiceofillustrativeexamples.Thecombinatorialistwhoalreadyknows somethingaboutthecombinatorialtheoryofspeciesofstructuresofJoyal[Joy86] (whichaimsatprovidingawaytodealwithgeneratingseriesinsomeuniversal way)willseeitappearfromanotherpointofview. Letusgivesomefurthergeneralreferencesonoperads:ageneralpresentation [Lod96]andtwomonographs[MSS02,Smi01]. Thistextisthewrittenversionoflecturesgivenatthe58thSe´minaireLotha- ringiendeCombinatoireinMarch2007.Wegiveseveralequivalentdefinitionsof operads,examplesofoperadsbasedoncombinatorialobjects,andexplainhow onecanbuildagroupof“invertibleformalpowerseries”startingfromanoperad. 2. Motivation Thissectionexplainsbrieflysomepossiblemotivationsforoperadsincombina- torics. 2.1.Wordsandpermutations.Letusrecalltheclassicalrelationbetween wordsandassociativity. AnalphabetAisasetofletters { a,b,c,... } .AwordwinthealphabetAis asequenceoflettersw=(w 1 ,w 2 ,...,w k ).Thereisabasicoperationonwords givenbyconcatenation,whichisassociative.Infact,thesetofwordsisexactly thefreeassociativemonoidonthesetA.Sothestudyofwordsnaturallytakes placeinthesettingofassociativealgebras. Considernowthealphabet { a 1 ,...,a n } .Thenthesetofwordswhereeachletter a i appearsexactlyoncecanbeseenasthesetofpermutationsof { 1,...,n } . Inanaturalsense,permutationsencodeallpossibleoperationsthatcanbemade withndistinctelementsinanassociativealgebra. Onecanfindasimilarrelationbetweensomekindsoftreesandsomenewkinds ofalgebraicstructures.Thereisaparallelbetween • wordsorpermutations ←→ associativealgebras, • rootedtrees ←→ pre-Liealgebras, • planarbinarytrees ←→ dendriformalgebras.