%Version 3 : prise en compte des remarques du mél de GHED reproduit ci-dessous.
%Cher Laurent,

%Je viens de lire en détail ton envoi (on pourrait peut-être se
%tutoyer si cela ne te gêne pas). Cette fois-ci, je ne te fais que des
%remarques générales sur les choses telles que je les sens/vois
%réservant une "feuille à la polonaise" pour une version ultérieure à
%notre prochaine discussion sur le sujet.

%Amitiés
%Gérard
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%R1) Section  2 : "Terminology and logical foundations"

%Cette section semble maintenant devenue inutile, sa trop grande
%généralité cache le "joyau" de la formule exponentielle qui est sa
%multiplicativité. Même en théorie des cardinaux où l'on considère
%TOUS les ensembles, on finit par prendre un axe de modèles qui
%sont les ordinaux minimaux.
%Ce que je suggère c'est de prendre des classes localement finies
%dont les supports sont les parties finies de $\N^+$. C'est suffisant,
%et sans perte de généralité, puisque si l'on a une famille
%renommable plus générale on peut toujours la restreindre à cet
%axe. Du coup, à cause de LF, ces classes sont des ensembles.
%D'ailleurs tu t'es placé toi-même dans ce cadre avec les monoides
%partiels.

%R2) Section  3 : "Partial monoids"

%Plus je gagne en expérience, plus je pense que le bon cadre pour
%les irréductibles est la srtucture de semi-groupe (d'ailleurs la
%formulation avec les monoides n'est pas naturelle et revient au
%semigroupes).

%---> fin de la preuve, bravo pour avoir fini cette preuve. Je pense
%que cette nouvelle condition d'équivariance est la bonne (nous
%verrons si elle est équivalente à la mienne).

%R3) Marche des idées.

%Ce que je suggère est l'enchaînement suivant :
%- on definit une "classe étiquetée" d'objects comme un couple
%$(\C,\sigma)$ ($\C$ étant un ensemble et $\sigma$ vers
%$2^{(\N^+)}$, les parties finies de $\N^+$)  avec les conditions
%(DS, LP, LF) et les statistiques avec (Eq, Mu)
%- on definit la $SGE(N;z)$ pour les sous-ensembles comme tu l'as
%fait

%\begin{equation}
%EGF(N;z)=1+\sum_{n=1}^\infty c(N_{[1..n]}) \frac{z^n}{n!}\ .
%\end{equation}

%mais cette fois-ci, comme on a un semigroupe, je pars de $n=1$.
%Ceci a l'avantage de mieux "voir" le lemme suivant.

%\begin{lemma} For each $X\subset atoms(S)$ let $S_X$ be the
%sets of elements of $S$ with their atoms in $X$. Then, if
%$(X_i)_{i\in I}$ is a partition of $atoms(S)$, the family

%\begin{equation}
%(EGF(S_{X_i};z))_{i\in I}
%\end{equation}

%is multipliable in $R[[z]]$ and one has

%\begin{equation}
%\prod_{i\in I} (EGF(S_{X_i};z))=EGF(S;z)
%\end{equation}
%\end{lemma}

%ce qui permet de définir la fameuse partition $(X_n)_{n>0}$ des
%atomes qui sont "isotypiques" (c'est à dire qui ont un support de
%cardinal $n$, le terme n'est pas approprié ici, mais c'est "between
%us").
%On finit comme tu l'as fait en montrant la formule exponentielle
%sur les classes isotypiques.

%CQFD !
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%Version 4 : 
%-> Je reprends tout ce qui concerne les monoïdes partiels (car c'est plus simple pour (LP);
%-> Les supports sont restreints à vivre dans les parties finies non vides de $\N^+$ (sauf l'epsilon);
%-> J'ajoute la marche à suivre de Gérard.
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%Version 5 : Elagage des preuves des lemmes + mise en page IEEECher co-auteurs,

%Voici une nouvelle version du papier pour ICCA09. 

%Ce qui a été fait (par rapport à l'ancienne version) : 

%* Mise au format IEEE.

%* Abstract + key-words (j'ai utilisé les key-words donnés dans la liste IEEE).

%* J'ai retiré toutes les preuves des lemmes ainsi que ce qui concerne la notion "left Noetherian". 

%* La plupart des corrections suggérées par Gérard ont été effectuées, à savoir (dans les grandes lignes) : 
%-> Définition "récursive" des semi-groupes partiels + utilisation des arbres pour l'associativité (généralisée);
%-> On se restreint aux semi-groupes commutatifs;
%-> Correction des exemples;
%-> Lemmes 3.3 et 3.4 fondus en un seul (lemme 3.3);
%-> Lemme 3.5 retiré;
%-> Lemme 3.6 conservé sans la preuve (devient lemme 3.4);
%-> Lemme 3.8 retiré;
%-> Lemme 3.9 retiré;
%-> Proposition 3.10 conservée (sans preuve);
%-> Terminologie : en premier lieu "proper statistics" est introduit, puis "improper" (p. 2, colonne 2);
%-> Proposition 4.2 devient Theorem 4.2 (exponential formula).
%-> J'ai retiré "Comtet" de la bibliographie (puisque nul part dans le texte nous nous y référions) et corrigé la référence "Touchard";
%-> Ajout de la référence "Eilenberg";
%-> J'ai ajouté en commentaires la référence "One-parameter groups and combinatorial physics".

%* Corrections non effectuées :

%-> Je n'utilise pas la notion de "semi-group locally finite" (par contre j'ajoute la référence à Eilenberg en ce qui concerne les semi-groupes "classiques"). En fait ce qui repose sur la notion de "left Noetherian" ou "locally finite" est caché dans la prop. 3.10 donnée sans preuve. Je ne vois donc pas l'utilité d'introduire l'une ou l'autre de ces notions.
%-> Je conserve la version "série formelle" de la formule exponentielle car d'une part elle introduit des notations et d'autre part, elle est suffisament claire.
%-> J'ai gardé la preuve du thm 4.2 telle qu'elle. Elle n'est pas très compliquée et repose que sur des raisonnements combinatoires de base.
%-> Je n'ai pas ajouté la "formule du produit" de Gérard (basée sur les partitions des atomes). Je souhaiterais que Gérard le fasse, si possible.
%-> Je n'ai pas ajouté de paragraphe sur les groupes à un paramètre et la physique combinatoire.
%-> Je n'ai pas fait de conclusion.

%* Pour finir : 

%-> Gérard, peux-tu ajouter ta formule du produit (avec la preuve, dans une première version mais que l'on pourra retirer au final, afin que nous la vérifions) ainsi qu'un petit paragraphe de conclusion sur les groupes à un paramètre et la physique combinatoire ? En ajoutant la formule du produit, il faut vérifier qu'elle est compatible avec les axiomes (local finitness, equivariance et multiplicativity) et surtout vérifier que la même notion d'équivariance que celle du papier actuel est utilisée.

%-> Je pense qu'il faut qu'on dise un mot sur la signification "gazes of graphs".

%-> A tous mes co-auteurs : pourriez-vous relire ce papier afin de relever les erreurs et éventuellement compléter la bibliographie ?

%Je vous remercie.

%Amicalement,

%Laurent

%PS : Je vous envoie ci-joint les versions 4 et 5 du papier (la version 4 contient les preuves de tous les lemmes). Gérard, vous trouverez aussi le source tex ainsi que la classe IEEEtran.cls à utiliser. 

%PS bis : A l'attention de Sylvia et Karol. Si vous souhaitez que certaines corrections soient faites, je vous prie de me les indiquer afin que je les fasse moi-même (afin de ne pas se perdre dans les versions...).
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%%%%%%%%%%Fin corrections version 5%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

%%%%%%%%%%%%%%%%%%%%%% VERSION 6 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%Les corrections (après entrevue avec Gérard) :
% "Exponential Formula" dans le titre.
% En ce qui concerne les affiliations : "with Laboratoire" devient "affiliated to"
% Dans cette même note de bas de page, ajout de "This work was supported by the French Ministry of Science and Higher Education
% under Grant ANR PhysComb."
% Abstract : "this rather vague definition" <--> "this descriptive statement"
% Index terms : "Combinatorial physics, Exponential generating function, Partial semigroup, Experimental mathematics."
% "its set of nodes" <--> "its set of (labels of its) nodes
% "... to commutative semigroup" <--> "... to commutative semigroup"
% "... indices of variables that occur in a polynomials" <--> "... indices of variables that occur in a polynomial"
% "that $F \mapsto c(X_F)$ should ..." <--> "that $F \mapsto c(X_F)$ would ..."
% "3) $c(\om_1\oplus\om_2)=...$" <--> "3) that $c(\om_1\oplus\om_2)=...$"
%
%%%%%%%%%%%%%%%%%%%%% VERSION 7 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%Les corrections :
%Changement de titre "Gazes of Graphs, Exponential Formula and Combinatorial Physics" => "Statistics on Graphs, Exponential"
%Ajout des parties V "Two examples" et VI "Generalized Stirling numbers in combinatorial physics"
%Ajout de la conclusion.
%Ajout de références sur les structures avec loi partiellement définies et sur les semigroupes de Burnside.
%
%%%%%%%%%%%%%%%%%%%%% VERSION 7 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

\documentclass[journal]{IEEEtran}
%

% *** MISC UTILITY PACKAGES ***
%
%\usepackage{ifpdf}
% Heiko Oberdiek's ifpdf.sty is very useful if you need conditional
% compilation based on whether the output is pdf or dvi.
% usage:
% \ifpdf
%   % pdf code
% \else
%   % dvi code
% \fi
% The latest version of ifpdf.sty can be obtained from:
% http://www.ctan.org/tex-archive/macros/latex/contrib/oberdiek/
% Also, note that IEEEtran.cls V1.7 and later provides a builtin
% \ifCLASSINFOpdf conditional that works the same way.
% When switching from latex to pdflatex and vice-versa, the compiler may
% have to be run twice to clear warning/error messages.






% *** CITATION PACKAGES ***
%
%\usepackage{cite}
% cite.sty was written by Donald Arseneau
% V1.6 and later of IEEEtran pre-defines the format of the cite.sty package
% \cite{} output to follow that of IEEE. Loading the cite package will
% result in citation numbers being automatically sorted and properly
% "compressed/ranged". e.g., [1], [9], [2], [7], [5], [6] without using
% cite.sty will become [1], [2], [5]--[7], [9] using cite.sty. cite.sty's
% \cite will automatically add leading space, if needed. Use cite.sty's
% noadjust option (cite.sty V3.8 and later) if you want to turn this off.
% cite.sty is already installed on most LaTeX systems. Be sure and use
% version 4.0 (2003-05-27) and later if using hyperref.sty. cite.sty does
% not currently provide for hyperlinked citations.
% The latest version can be obtained at:
% http://www.ctan.org/tex-archive/macros/latex/contrib/cite/
% The documentation is contained in the cite.sty file itself.

% *** GRAPHICS RELATED PACKAGES ***
%
\ifCLASSINFOpdf
  % \usepackage[pdftex]{graphicx}
  % declare the path(s) where your graphic files are
  % \graphicspath{{../pdf/}{../jpeg/}}
  % and their extensions so you won't have to specify these with
  % every instance of \includegraphics
  % \DeclareGraphicsExtensions{.pdf,.jpeg,.png}
\else
  % or other class option (dvipsone, dvipdf, if not using dvips). graphicx
  % will default to the driver specified in the system graphics.cfg if no
  % driver is specified.
  % \usepackage[dvips]{graphicx}
  % declare the path(s) where your graphic files are
  % \graphicspath{{../eps/}}
  % and their extensions so you won't have to specify these with
  % every instance of \includegraphics
  % \DeclareGraphicsExtensions{.eps}
\fi
% graphicx was written by David Carlisle and Sebastian Rahtz. It is
% required if you want graphics, photos, etc. graphicx.sty is already
% installed on most LaTeX systems. The latest version and documentation can
% be obtained at:
% http://www.ctan.org/tex-archive/macros/latex/required/graphics/
% Another good source of documentation is "Using Imported Graphics in
% LaTeX2e" by Keith Reckdahl which can be found as epslatex.ps or
% epslatex.pdf at: http://www.ctan.org/tex-archive/info/
%
% latex, and pdflatex in dvi mode, support graphics in encapsulated
% postscript (.eps) format. pdflatex in pdf mode supports graphics
% in .pdf, .jpeg, .png and .mps (metapost) formats. Users should ensure
% that all non-photo figures use a vector format (.eps, .pdf, .mps) and
% not a bitmapped formats (.jpeg, .png). IEEE frowns on bitmapped formats
% which can result in "jaggedy"/blurry rendering of lines and letters as
% well as large increases in file sizes.
%
% You can find documentation about the pdfTeX application at:
% http://www.tug.org/applications/pdftex





% *** MATH PACKAGES ***
%
\usepackage[cmex10]{amsmath}
% A popular package from the American Mathematical Society that provides
% many useful and powerful commands for dealing with mathematics. If using
% it, be sure to load this package with the cmex10 option to ensure that
% only type 1 fonts will utilized at all point sizes. Without this option,
% it is possible that some math symbols, particularly those within
% footnotes, will be rendered in bitmap form which will result in a
% document that can not be IEEE Xplore compliant!
%
% Also, note that the amsmath package sets \interdisplaylinepenalty to 10000
% thus preventing page breaks from occurring within multiline equations. Use:
\interdisplaylinepenalty=2500
% after loading amsmath to restore such page breaks as IEEEtran.cls normally
% does. amsmath.sty is already installed on most LaTeX systems. The latest
% version and documentation can be obtained at:
% http://www.ctan.org/tex-archive/macros/latex/required/amslatex/math/





% *** SPECIALIZED LIST PACKAGES ***
%
%\usepackage{algorithmic}
% algorithmic.sty was written by Peter Williams and Rogerio Brito.
% This package provides an algorithmic environment fo describing algorithms.
% You can use the algorithmic environment in-text or within a figure
% environment to provide for a floating algorithm. Do NOT use the algorithm
% floating environment provided by algorithm.sty (by the same authors) or
% algorithm2e.sty (by Christophe Fiorio) as IEEE does not use dedicated
% algorithm float types and packages that provide these will not provide
% correct IEEE style captions. The latest version and documentation of
% algorithmic.sty can be obtained at:
% http://www.ctan.org/tex-archive/macros/latex/contrib/algorithms/
% There is also a support site at:
% http://algorithms.berlios.de/index.html
% Also of interest may be the (relatively newer and more customizable)
% algorithmicx.sty package by Szasz Janos:
% http://www.ctan.org/tex-archive/macros/latex/contrib/algorithmicx/




% *** ALIGNMENT PACKAGES ***
%
%\usepackage{array}
% Frank Mittelbach's and David Carlisle's array.sty patches and improves
% the standard LaTeX2e array and tabular environments to provide better
% appearance and additional user controls. As the default LaTeX2e table
% generation code is lacking to the point of almost being broken with
% respect to the quality of the end results, all users are strongly
% advised to use an enhanced (at the very least that provided by array.sty)
% set of table tools. array.sty is already installed on most systems. The
% latest version and documentation can be obtained at:
% http://www.ctan.org/tex-archive/macros/latex/required/tools/


%\usepackage{mdwmath}
%\usepackage{mdwtab}
% Also highly recommended is Mark Wooding's extremely powerful MDW tools,
% especially mdwmath.sty and mdwtab.sty which are used to format equations
% and tables, respectively. The MDWtools set is already installed on most
% LaTeX systems. The lastest version and documentation is available at:
% http://www.ctan.org/tex-archive/macros/latex/contrib/mdwtools/


% IEEEtran contains the IEEEeqnarray family of commands that can be used to
% generate multiline equations as well as matrices, tables, etc., of high
% quality.


%\usepackage{eqparbox}
% Also of notable interest is Scott Pakin's eqparbox package for creating
% (automatically sized) equal width boxes - aka "natural width parboxes".
% Available at:
% http://www.ctan.org/tex-archive/macros/latex/contrib/eqparbox/





% *** SUBFIGURE PACKAGES ***
%\usepackage[tight,footnotesize]{subfigure}
% subfigure.sty was written by Steven Douglas Cochran. This package makes it
% easy to put subfigures in your figures. e.g., "Figure 1a and 1b". For IEEE
% work, it is a good idea to load it with the tight package option to reduce
% the amount of white space around the subfigures. subfigure.sty is already
% installed on most LaTeX systems. The latest version and documentation can
% be obtained at:
% http://www.ctan.org/tex-archive/obsolete/macros/latex/contrib/subfigure/
% subfigure.sty has been superceeded by subfig.sty.



%\usepackage[caption=false]{caption}
%\usepackage[font=footnotesize]{subfig}
% subfig.sty, also written by Steven Douglas Cochran, is the modern
% replacement for subfigure.sty. However, subfig.sty requires and
% automatically loads Axel Sommerfeldt's caption.sty which will override
% IEEEtran.cls handling of captions and this will result in nonIEEE style
% figure/table captions. To prevent this problem, be sure and preload
% caption.sty with its "caption=false" package option. This is will preserve
% IEEEtran.cls handing of captions. Version 1.3 (2005/06/28) and later
% (recommended due to many improvements over 1.2) of subfig.sty supports
% the caption=false option directly:
%\usepackage[caption=false,font=footnotesize]{subfig}
%
% The latest version and documentation can be obtained at:
% http://www.ctan.org/tex-archive/macros/latex/contrib/subfig/
% The latest version and documentation of caption.sty can be obtained at:
% http://www.ctan.org/tex-archive/macros/latex/contrib/caption/




% *** FLOAT PACKAGES ***
%
%\usepackage{fixltx2e}
% fixltx2e, the successor to the earlier fix2col.sty, was written by
% Frank Mittelbach and David Carlisle. This package corrects a few problems
% in the LaTeX2e kernel, the most notable of which is that in current
% LaTeX2e releases, the ordering of single and double column floats is not
% guaranteed to be preserved. Thus, an unpatched LaTeX2e can allow a
% single column figure to be placed prior to an earlier double column
% figure. The latest version and documentation can be found at:
% http://www.ctan.org/tex-archive/macros/latex/base/



%\usepackage{stfloats}
% stfloats.sty was written by Sigitas Tolusis. This package gives LaTeX2e
% the ability to do double column floats at the bottom of the page as well
% as the top. (e.g., "\begin{figure*}[!b]" is not normally possible in
% LaTeX2e). It also provides a command:
%\fnbelowfloat
% to enable the placement of footnotes below bottom floats (the standard
% LaTeX2e kernel puts them above bottom floats). This is an invasive package
% which rewrites many portions of the LaTeX2e float routines. It may not work
% with other packages that modify the LaTeX2e float routines. The latest
% version and documentation can be obtained at:
% http://www.ctan.org/tex-archive/macros/latex/contrib/sttools/
% Documentation is contained in the stfloats.sty comments as well as in the
% presfull.pdf file. Do not use the stfloats baselinefloat ability as IEEE
% does not allow \baselineskip to stretch. Authors submitting work to the
% IEEE should note that IEEE rarely uses double column equations and
% that authors should try to avoid such use. Do not be tempted to use the
% cuted.sty or midfloat.sty packages (also by Sigitas Tolusis) as IEEE does
% not format its papers in such ways.


%\ifCLASSOPTIONcaptionsoff
%  \usepackage[nomarkers]{endfloat}
% \let\MYoriglatexcaption\caption
% \renewcommand{\caption}[2][\relax]{\MYoriglatexcaption[#2]{#2}}
%\fi
% endfloat.sty was written by James Darrell McCauley and Jeff Goldberg.
% This package may be useful when used in conjunction with IEEEtran.cls'
% captionsoff option. Some IEEE journals/societies require that submissions
% have lists of figures/tables at the end of the paper and that
% figures/tables without any captions are placed on a page by themselves at
% the end of the document. If needed, the draftcls IEEEtran class option or
% \CLASSINPUTbaselinestretch interface can be used to increase the line
% spacing as well. Be sure and use the nomarkers option of endfloat to
% prevent endfloat from "marking" where the figures would have been placed
% in the text. The two hack lines of code above are a slight modification of
% that suggested by in the endfloat docs (section 8.3.1) to ensure that
% the full captions always appear in the list of figures/tables - even if
% the user used the short optional argument of \caption[]{}.
% IEEE papers do not typically make use of \caption[]'s optional argument,
% so this should not be an issue. A similar trick can be used to disable
% captions of packages such as subfig.sty that lack options to turn off
% the subcaptions:
% For subfig.sty:
% \let\MYorigsubfloat\subfloat
% \renewcommand{\subfloat}[2][\relax]{\MYorigsubfloat[]{#2}}
% For subfigure.sty:
% \let\MYorigsubfigure\subfigure
% \renewcommand{\subfigure}[2][\relax]{\MYorigsubfigure[]{#2}}
% However, the above trick will not work if both optional arguments of
% the \subfloat/subfig command are used. Furthermore, there needs to be a
% description of each subfigure *somewhere* and endfloat does not add
% subfigure captions to its list of figures. Thus, the best approach is to
% avoid the use of subfigure captions (many IEEE journals avoid them anyway)
% and instead reference/explain all the subfigures within the main caption.
% The latest version of endfloat.sty and its documentation can obtained at:
% http://www.ctan.org/tex-archive/macros/latex/contrib/endfloat/
%
% The IEEEtran \ifCLASSOPTIONcaptionsoff conditional can also be used
% later in the document, say, to conditionally put the References on a
% page by themselves.





% *** PDF, URL AND HYPERLINK PACKAGES ***
%
%\usepackage{url}
% url.sty was written by Donald Arseneau. It provides better support for
% handling and breaking URLs. url.sty is already installed on most LaTeX
% systems. The latest version can be obtained at:
% http://www.ctan.org/tex-archive/macros/latex/contrib/misc/
% Read the url.sty source comments for usage information. Basically,
% \url{my_url_here}.





% *** Do not adjust lengths that control margins, column widths, etc. ***
% *** Do not use packages that alter fonts (such as pslatex).         ***
% There should be no need to do such things with IEEEtran.cls V1.6 and later.
% (Unless specifically asked to do so by the journal or conference you plan
% to submit to, of course. )


% correct bad hyphenation here
%\hyphenation{op-tical net-works semi-conduc-tor}



%\usepackage{amsmath}
\usepackage{amsfonts}
\usepackage{amscd}
%\parindent=0pt
%\textheight 250mm
%\textwidth 160mm
%\hoffset -14mm
%\voffset -26mm

%%%%%%%%%%%%%%%%%%%%%%
% \'Enonc\'es
%%%%%%%%%%%%%%%%%%%%%%

\newtheorem{expl}{Example}[section]
\newtheorem{theorem}[expl]{Theorem}
\newtheorem{corollary}[expl]{Corollary}
\newtheorem{definition}[expl]{Definition}
\newtheorem{prop}[expl]{Proposition}
\newtheorem{algorithm}[expl]{Algorithm}
\newtheorem{lemma}[expl]{Lemma}
\newtheorem{rem}[expl]{Remark}
\newtheorem{note}[expl]{Note}
\newtheorem{appli}[expl]{Applications}

\def\Proof{\medskip\noindent {\it Proof --- \ }}
\def\cqfd{\hfill $\clubsuit$ \bigskip}


%%%%%%%%%%%%%%%%%%%%%%
% Divers
%%%%%%%%%%%%%%%%%%%%%%

\def\A{{\sym A}}
\def\B{{\cal B}}
\def\Cl{{\cal C}}
\def\C{\mathb{C}}
\def\E{{\cal E}}
\def\ES{{\cal ES}}
\def\F{{\cal F}}
\def\I{{\cal I}}
\def\N{{\sym N}}
\def\M{{\cal M}}
\def\Q{\mathbb{Q}}
\def\R{{\sym R}}
\def\ba{{\mathbf a}}
\def\L{{\mathbf L}}
\def\V{{\mathbf V}}
\def\T{{\cal T}}
\def\card{\mathsf{card}}
\def\sbs{{\sym Subs}}
\def\fst{{\bf F\hspace{-1mm}St}}
\def\ole{\overline{end}}
\def\op{\overline{perm}}
\def\ra{\rightarrow}
\def\binomial#1#2{\left(\,\matrix{#1 \cr #2}\,\right)}
\def\pointir{\unskip . --- \ignorespaces}
\def\mref#1{(\ref{#1})}
\def\cqfd{\hfill $\Box$ \bigskip}
\def\Box{\fbox{\hspace{0.5mm}}}
\def\scal#1#2{\langle #1| #2\rangle}
\def\ul#1{\underline{#1}}
\def\ol#1{\overline{#1}}


%%%%%%%%%%%%%%%
%Greek letters
%%%%%%%%%%%%%%%

\def\al{{\alpha}}
\def\be{{\beta}}
\def\si{\sigma}
\def\om{\omega}
\def\ep{\epsilon}



\begin{document}
\title{Statistics on Graphs, Exponential Formula and Combinatorial Physics}

\author{G\'erard~H.~E.~Duchamp, Laurent~Poinsot, Silvia~Goodenough and Karol~A.~Penson% <-this % stops a space
\thanks{Manuscript received April 06, 2009. This work was supported by the French Ministry of Science and Higher Education under Grant ANR PhysComb.}
\thanks{G. H. E. Duchamp, L. Poinsot and S. Goodenough are affiliated to Laboratoire d'Informatique Paris Nord, Universit\'e Paris-Nord 13, CNRS UMR 7030,  99 av. J.-B. Cl\'ement, F 93430 Villetaneuse, France (emails: $\{$ghed,laurent.poinsot$\}$@lipn-univ.paris13.fr, goodenou@iutv.univ-paris13.fr).}% <-this % stops a space
\thanks{K. A. Penson is affiliated to Laboratoire de Physique Th\'eorique de la Mati\`ere Condens\'ee, Universit\'e Pierre et Marie Curie, CNRS UMR 7600, Tour 24 - 2e \'et., 4 pl. Jussieu, F 75252 Paris cedex 05, France (email: penson@lptl.jussieu.fr).}}% <-this % stops a space



%\author{Michael~Shell,~\IEEEmembership{Member,~IEEE,}
 %       John~Doe,~\IEEEmembership{Fellow,~OSA,}
  %      and~Jane~Doe,~\IEEEmembership{Life~Fellow,~IEEE}% <-this % stops a space
%\thanks{M. Shell is with the Department
%of Electrical and Computer Engineering, Georgia Institute of Technology, Atlanta,
%GA, 30332 USA e-mail: (see http://www.michaelshell.org/contact.html).}% <-this % stops a space
%\thanks{J. Doe and J. Doe are with Anonymous University.}% <-this % stops a space
%\thanks{Manuscript received April 19, 2005; revised January 11, 2007.}}

% note the % following the last \IEEEmembership and also \thanks -
% these prevent an unwanted space from occurring between the last author name
% and the end of the author line. i.e., if you had this:
%
% \author{....lastname \thanks{...} \thanks{...} }
%                     ^------------^------------^----Do not want these spaces!
%
% a space would be appended to the last name and could cause every name on that
% line to be shifted left slightly. This is one of those "LaTeX things". For
% instance, "\textbf{A} \textbf{B}" will typeset as "A B" not "AB". To get
% "AB" then you have to do: "\textbf{A}\textbf{B}"
% \thanks is no different in this regard, so shield the last } of each \thanks
% that ends a line with a % and do not let a space in before the next \thanks.
% Spaces after \IEEEmembership other than the last one are OK (and needed) as
% you are supposed to have spaces between the names. For what it is worth,
% this is a minor point as most people would not even notice if the said evil
% space somehow managed to creep in.



% The paper headers
%\markboth{Journal of \LaTeX\ Class Files,~Vol.~6, No.~1, January~2007}%
%{Shell \MakeLowercase{\textit{et al.}}: Bare Demo of IEEEtran.cls for Journals}
% The only time the second header will appear is for the odd numbered pages
% after the title page when using the twoside option.
%
% *** Note that you probably will NOT want to include the author's ***
% *** name in the headers of peer review papers.                   ***
% You can use \ifCLASSOPTIONpeerreview for conditional compilation here if
% you desire.




% If you want to put a publisher's ID mark on the page you can do it like
% this:
%\IEEEpubid{0000--0000/00\$00.00~\copyright~2007 IEEE}
% Remember, if you use this you must call \IEEEpubidadjcol in the second
% column for its text to clear the IEEEpubid mark.



% use for special paper notices
%\IEEEspecialpapernotice{(Invited Paper)}




% make the title area
\maketitle


\begin{abstract}
%\boldmath
This paper concerns a famous combinatorial formula known as the ``exponential formula" which occurs quite naturally in many physical contexts. Its meaning is the following: the exponential generating function of a whole structure is equal to the exponential of those of connected substructures. Keeping this descriptive statement as a guideline, we develop a general framework to handle many different situations in which the exponential formula can be applied. 
\end{abstract}
% IEEEtran.cls defaults to using nonbold math in the Abstract.
% This preserves the distinction between vectors and scalars. However,
% if the journal you are submitting to favors bold math in the abstract,
% then you can use LaTeX's standard command \boldmath at the very start
% of the abstract to achieve this. Many IEEE journals frown on math
% in the abstract anyway.

% Note that keywords are not normally used for peerreview papers.
\begin{IEEEkeywords}
Combinatorial physics, Exponential generating function, Partial semigroup, Experimental mathematics.  
\end{IEEEkeywords}






% For peer review papers, you can put extra information on the cover
% page as needed:
% \ifCLASSOPTIONpeerreview
% \begin{center} \bfseries EDICS Category: 3-BBND \end{center}
% \fi
%
% For peerreview papers, this IEEEtran command inserts a page break and
% creates the second title. It will be ignored for other modes.
\IEEEpeerreviewmaketitle



\section{Introduction}\label{expf}

Applying the exponential paradigm one can feel sometimes incomfortable wondering whether ``one has the right'' to do 
so (as for example for coloured structures). The following paper is aimed at giving a rather large framework where this 
formula holds. 

Exponential formula can be traced back to works by Touchard and Ridell \& Uhlenbeck \cite{To,RU}. 
For an other exposition, see for example \cite{DM97,Fl,Jo,St}.
 
We are interested to compute various examples of EGF for combinatorial objects having 
(a finite set of) nodes (i.e. their set-theoretical support) so we use as central concept the mapping $\sigma$ which 
associates to every structure, its set of (labels of its) nodes.\\
We need to draw what could be called ``square-free decomposable objects'' (SFD). This version is suited to our needs 
for the ``exponential formula'' and it is sufficiently general to contain, as a particular case, the case of multivariate series. 

%\section{Terminology and logical foundations}
%The usual exponential formula deals with "big" sets such as the class of all graphs of equivalence relations or the class of all graphs of endofunctions. Actually these collections cannot be considered as sets in ZFC set theory\footnote{"ZFC" means "Zermelo-Fraenkel and axiom of choice" which is a standard list of axioms for set theory.} (see for instance \cite{Bo}). In order to deal with such objects, as in \cite{McL}, we need to enrich our set theory with the notion of {\it universes}. A {\it universe} is defined as a set $\mathcal{U}$ together with the following properties:
%\begin{enumerate}
%\item $x\in y\in \mathcal{U}$ implies $x\in \mathcal{U}$;
%\item $x\in \mathcal{U}$ and $y\in U$ imply that $\{x,y\}$, $(x,y)$ and $x\times y\in \mathcal{U}$;
%\item $x\in \mathcal{U}$ implies the set $\mathcal{P}(x)$ of all subsets of $x$ belongs to $\mathcal{U}$;
%\item $x\in\mathcal{U}$ implies that $\displaystyle\bigcup x \in \mathcal{U}$;
%\item $\mathbb{N}\in\mathcal{U}$;
%\item If $f:x\rightarrow y$ is a surjective function with $x\in\mathcal{U}$ and $y\subseteq \mathcal{U}$, then $y\in\mathcal{U}$.
%\end{enumerate} 
%Actually these properties have been chosen in such way that it guarentees that any usual set-theoretic operation in $\mathcal{U}$ can be carried out within $\mathcal{U}$. Nevertheless the existence of such universes is not provable within ZFC set theory so we need to add such an existence result in our list of usual axioms (see~\cite{Bo1}). For the rest of this paper a universe $\mathcal{U}$ is fixed. In a usual way we call {\it small sets} the elements of $\mathcal{U}$, in such a way that $\mathcal{U}$ is the set of all small sets, and 
%{\it classes} the subsets of $\mathcal{U}$. By property (1) of universes, a small set also is a class. The reciprocal is not true. A {\it proper class} is a class which is not a small set (for instance $\mathcal{U}$ itself). In what follows we forget any reference to the universe $\mathcal{U}$ and call {\it set} any class. 


\section{Partial semigroups}

Let us call partial semigroup a semigroup with a partially defined associative law (see for instance \cite{Eil74} for usual semigroups and \cite{Bru58,LE97,Seg73} for more details on structures with a partially defined binary operation). More precisely, 
a {\it partial semigroup} is a pair $(S,*)$ where $S$ is a set and $*$ is a (partially defined) function $S\times S\rightarrow S$ such that the two (again partially defined) functions $S\times S\times S \rightarrow S$
\begin{equation}
(x,y,z)\mapsto (x*y)*z\ \mbox{and}\ (x,y,z)\mapsto x*(y*z)
\end{equation} 
coincide (same domain and values). Using this requirement one can see that the values of the (partially defined) functions $S^n \rightarrow S$
\begin{equation}
(x_1,\cdots,x_n)\mapsto E_T(x_1,\cdots,x_n)
\end{equation}
obtained by evaluating the expression formed by labelling by $x_i$ (from left to right) the $i$th leaf of a binary tree $T$ with $n$ nodes and by $*$ its internal nodes, is independant of $T$. We will denote $x_1*\cdots*x_n$ their common value.  In this paper we restrict our attention to {\it commutative} semigroups. By this we mean that the value $x_1*\cdots*x_n$ does not depend on the relative order of the $x_i$. A nonempty partial semigroup $(S,*)$ has a {\it (two-sided and total) unit} $\epsilon \in S$ if, and only if, for every $\om \in S$, $\om*\epsilon=\om=\epsilon*\om$. Using associativity of $*$, it can be easily checked that if $S$ has a unit, then it is unique.  %A partial semigroup $(S,*)$ is {\it commutative} if, and only if, for every $\om_1,\om_2\in S$, $(\om_1,\om_2)\in D$ implies that $(\om_2,\om_1)\in D$, and if $(\om_1,\om_2)\in D$, then $\om_1*\om_2=\om_2*\om_1$. %A partial monoid which is a commutative partial semigroup is called a {\it commutative partial monoid}. In what follows, a notation such as $\om_1*\om_2$ always suppose that $(\om_1,\om_2)\in D$ even if not explicitely indicated. More generaly $\om_1*\om_2*\dots*\om_n$ is based on the assumption that $(\om_1,\om_2)\in D$, $((\om_1*\om_2),\om_3)\in D$, ..., $((\om_1*\dots*\om_{n-1}),\om_n)\in D$. Likewise for $A_1,\dots,A_n \subseteq S$, we define $A_1*\dots * A_n$ as the set of all well-defined products $\om_1*\dots *\om_n$ where $\om_i\in A_i$ for every $i=1,\dots,n$. 
\begin{expl}
Let $F$ be a set of sets (resp. which contains $\emptyset$ as an element) and which is closed under the disjoint sum $\sqcup$, {\it i.e.}, if $A,B\in F$ such that $A\cap B=\emptyset$, then $A \cup B (=A\sqcup B)\in F$. Then $(F,\sqcup)$ is a partial semigroup (resp. partial semigroup with unit). %We can instanciate $F$ with 
%$F=\{\{0\},\{1\},\{0,3\},\{0,1\},\{0,1,2\},\{0,1,3\},\{0,1,2,3\}\}$ (resp. $F=\{\emptyset,\{0\},\{1\},\{0,3\},\{0,1\},\{0,1,2\},\{0,1,3\},\{0,1,2,3\}\}$), but we can also take for $F$ the set of all nonempty finite subsets (resp. all finite subsets) of the positive integers $\mathbb{N}^{+}$
\end{expl}
%Let $(S_i,*_i)$ be a partial semigroup (the domain of $*_i$ is $D_i$) for $i=1,2$. A mapping $f : S_1 \rightarrow S_2$ is called a {\it partial semigroup homomorphism}  if, and only if, $(\om_1,\om_2)\in D_1$ implies that $(f(\om_1),f(\om_2))\in D_2$ and $f(\om_1 *_1 \om_2)=f(\om_1)*_2 f(\om_2)$. If $(M_i,*_i)$ is a monoid with unit $\epsilon_i$ ($i=1,2$), a partial semigroup homomorphism $f:M_1\rightarrow M_2$ is a {\it partial monoid homomorphism} if, and only if, $f(\epsilon_1)=\epsilon_2$. \\

%Let $(S,*)$ be a partial semigroup. Let $X\subseteq S$. We define $\overline{X}$ the {\it partial semigroup generated by $X$ (in $S$)} as the set of all well-defined products $x_1*\dots*x_n$ with $x_i\in X$ for $i=1,\dots,n$ and for each positive integer $n$. If $(M,*)$ is a partial monoid and $X\subseteq M$, then the {\it partial monoid generated by $X$ in $M$} is the union of the partial semigroup generated by $X$ (in the underlying semigroup structure of $M$) with $\epsilon$, and it is also  denoted $\overline{X}$. \\

%Following \cite{Eil74}, a partial semigroup with unit $S$ is said {\it locally finite} if each $x \in S$ admits only a finite number of  factorizations 
%\begin{equation}
%x=x_1*\cdots*x_n
%\end{equation}
%where $x_i\not=\epsilon$ for each $i$. 

%Let $(M,*)$ be a partial semigroup with unit. Let $\om_1,\om_2\in M$. We say that $\om_2$ is a {\it left divisor} (resp. {\it left proper divisor}) of $\om_1$ if, and only if, $\om_1=\om_2* \om_3$ for some $\om_3\in M$ (resp. $\om_3\in M\setminus\{\epsilon\}$). We say that a partial monoid is {\it left Noetherian} if, and only if, left divisibility is a well-founded relation, {\it i.e.}, there is no infinite descending sequence $\om_0 * \om_1 * \om_2 *\cdots$ such that $\om_{i+1}$ is a proper divisor of $\om_i$ for all $i\geq 0$. When $M$ is commutative, we say that $M$ is {\it Noetherian}. 

\section{Square-free decomposable partial semigroups}
Let $\mathsf{2}^{(\mathbb{N}^+)}$ be the set of all finite subsets of the positive integers $\mathbb{N}^+$ and $(S,\oplus)$ be a partial semigroup with unit equipped with a mapping $\si:S \rightarrow \mathsf{2}^{(\mathbb{N}^+)}$, called the {\it (set-theoretic) support mapping}. Let $D$ be the domain of the $\oplus$. The triple $(S,\oplus,\si)$ is called {\it square-free decomposable} (SFD) if, and only if, it fulfills the two following conditions. %(The triple $(S,\oplus,\si)$ is called a {\it direct sum partial semigroup with unit} (DS) if, and only if, it fulfills at least the first condition.)
\begin{itemize}
\item {\it Direct sum} (DS): 
\begin{enumerate}
\item $\sigma(\om)=\emptyset$ iff $\om=\epsilon$;
\item $D=\{(\om_1,\om_2)\in S^2 : \sigma(\om_1)\cap \sigma(\om_2)=\emptyset\}$;
\item For all $\om_1,\om_2\in S$, if $(\om_1,\om_2)\in D$ then $\sigma(\om_1\oplus \om_2)=\sigma(\om_1)\cup\sigma(\om_2)$.
\end{enumerate}
\item {\it Levi's property} (LP): For every $\om_1,\om_2,\om^1,\om^2 \in S$ such that $(\om_1,\om_2),(\om^1,\om^2)\in D$ and $\om_1\oplus \om_2=\om^1\oplus \om^2$, there are $\om_i^j\in S$ for $i=1,2$, $j=1,2$ %$\om_1^1,\om_1^2,\om_1^2,\om_2^2 \in M$ 
such that $(\om_i^1,\om_i^2),(\om_1^j,\om_2^j)\in D$, %$(\om_1^1,\om_1^2),(\om_2^1,\om_2^2),(\om_1^1,\om_2^1),(\om_1^2,\om_2^2)\in D$,  
$\om_i=\om_i^1\oplus\om_i^2$ and $\om^j=\om^j_1\oplus \om^j_2$ for $i=1,2$ and $j=1,2$. %$\om_1=\om_1^1\oplus \om_1^2$, $\om_2=\om_2^1\oplus \om_2^2$, $\om^1=\om_1^1\oplus \om_2^1$ and $\om^2=\om_1^2\oplus \om_2^2$. 
\end{itemize}

\begin{note}
The second and third conditions of (DS) imply that $\si(\om_1\oplus \om_2)=\si(\om_1)\sqcup \si(\om_2)$ whenever $(\om_1,\om_2)\in D$ (which means that $\si(\om_1)\cap\si(\om_2)=\emptyset$), where $\sqcup$ denotes the disjoint sum. %Moreover since $\sigma(\epsilon)=\emptyset$, $\sigma$ is a partial monoid homomorphism from $(S,\oplus)$ to $(\mathsf{2}^{(\mathbb{N}^+)},\sqcup)$. 
\end{note}
\begin{expl}
As example of this setting we have:\\
\begin{enumerate}\label{ex1}
\item\label{intsf} The positive square-free integers, $\si(n)$ being the set of primes which divide $n$, the atoms being the 
prime numbers.
\item\label{int} All the positive integeres ($S=\mathbb{N}^+$), under the usual integer multiplication, $\sigma(n)$ being the set of primes which divides $n$.%, if $n>1$, and $\sigma(1)=\emptyset$. % a the positive integers $\si(n)$ being the set of primes which divide $n$, the atoms being the primes.
\item\label{graphs} Graphs, hypergraphs, (finitely) coloured, weighted graphs, with nodes in $\mathbb{N}^+$, $\si(G)$ being the set of nodes and $\oplus$ the 
juxtaposition (direct sum) when the set of nodes are mutually disjoint. %, here the atoms are connected graphs.
\item\label{endof} The set of endofunctions $f:F\rightarrow F$ where $F$ is a finite subset of $\mathbb{N}^+$.
\item\label{ex13} The (multivariate) polynomials in $\mathbb{N}[X]$, $X=\{x_i : i\in I\}$, with $I\subseteq \mathbb{N}^+$, being a nonempty set of (commuting or not) variables, with $\si(P)=Alph(P)$ the set of indices of variables that occur in a polynomial $P$,  and $\oplus=+$.
\item\label{ex14} For a given finite or denumerable field, the set of irreducible monic polynomials is denumerable. Arrange them in a sequence $(P_n)_{n\in\mathbb{N}^+}$, then the square-free monic (for a given order on the variables) polynomials is SFD,   $\si(P):=\{n\in\mathbb{N}^+ : P_n\ \mathit{divides}\ P\}$ and $\oplus$ being the multiplication.
\item\label{ex15} Rational complex algebraic curves; $\si(V)$ being the set of monic irreducible bivariate polynomials vanishing on $V$. 
%on an infinite subset of $V$.
\end{enumerate}
\end{expl}

In what follows we write $\displaystyle\oplus_{i=1}^n \om_i$ instead of $\om_1\oplus\dots\oplus\om_n$ (if $n=0$, then $\oplus_{i=1}^n \om_i=\epsilon$) and  we suppose that $(S,\oplus,\sigma)$ is SFD for the two following easy lemmas.
%\begin{lemma}\label{lemme_somme_generale}
%Let $(S,\oplus,\sigma)$ be DS. 
%Let $n\in \mathbb{N}^+$. Let $\om_1,\dots,\om_n\in S$ such that $\displaystyle\oplus_{i=1}^n \om_i$ is defined. For every $i,j\in \{1,\dots,n\}$, if $i\not=j$, then $\sigma(\om_i)\cap\sigma(\om_j)=\emptyset$.  In particular, if none $\om_k$ is equal to $\epsilon$, then for every $i,j\in\{1,\dots, n\}$, $i\not=j$, then $\om_i\not=\om_j$. 
%\end{lemma}
%\Proof
%If $n=2$ it is obvious. Suppose that $n>2$. Let $i,j\in \{1,\dots,n\}$ such that $i\not=j$. If $\displaystyle\bigoplus_{i=1}^n \om_i$ is defined, by associativity and commutativity, we have 
%$\displaystyle\bigoplus_{i=1}^n \om_i=(\om_i\oplus \om_j)\oplus\left (\bigoplus_{k=1, k\not=i,j}^n \om_k\right )$. If none $\om_k=\epsilon$, then for every $i,j\in\{1,\dots,n\}$, $i\not=j$, $\sigma(\om_i)\cap\sigma(\om_j)=\emptyset$, $\sigma(\om_i)\not=\emptyset$, $\sigma(\om_j)\not=\emptyset$ imply that $\sigma(\om_i)\not=\sigma(\om_j)$ and therefore $\om_i\not=\om_j$. 
%\cqfd
\begin{lemma}\label{lemme_somme_generale_et_support}
%Let $(S,\oplus,\sigma)$ be DS. 
Let $\om_1,\dots,\om_n\in S$ such that $\displaystyle\oplus_{i=1}^n \om_i$ is defined. Then for every $i,j\in \{1,\dots,n\}$ such that $i\not=j$, it holds that $\sigma(\om_i)\cap\sigma(\om_j)=\emptyset$.  In particular, if none $\om_k$ is equal to $\epsilon$, then $\om_i\not=\om_j$ for every $i,j\in\{1,\dots, n\}$ such that $i\not=j$.  Moreover  $\sigma(\displaystyle\oplus_{i=1}^n \om_i)=\bigsqcup_{i=1}^n \sigma(\om_i)$. 
%Let $\alpha_1$ and $\alpha_2$ be two distinct atoms. Then $(\alpha_1,\alpha_2)\in D$. 
\end{lemma}
%\Proof
%Obvious (use lemma~\ref{lemme_somme_generale} for the case $n>1$). 
%\cqfd
 
%\begin{lemma}\label{sum_of_2_decompositions}
%Let $(S,\oplus,\sigma)$ be DS. 
%Let $\omega_i\in S$ for $i=1,2$ such that $\si(\om_1)\cap\si(\om_2)=\emptyset$. Suppose that $\om_i=\om_i^1\oplus\om_i^2$ for some $\om_{i}^j\in S$, for $i=1,2,j=1,2$. Then $\om_1\oplus\om_2=\displaystyle\bigoplus_{i=1,2\atop j=1,2}\om_i^j$.
%\end{lemma}
%\Proof
%We have $\si(\om_i^1)\cap\si(\om_i^2)=\emptyset$ and $\si(\om_i^1)\cup\si(\om_i^2)=\si(\om_i)$ for $i=1,2$ and $\si(\om_1)\cap\si(\om_2)=\emptyset$. Therefore $\si(\om_1^1\oplus\om_1^2)\cap\si(\om_2^1)=\si(\om)\cap\si(\om_2^1)=\emptyset$, therefore $\om\oplus\om_2^1=(\om_1^1\oplus \om_1^2)\oplus\om_2^1$ is well-defined. Finally $\si(\om\oplus \om_2^1)\cap\si(\om_2^2)=(\si(\om)\cup\si(\om_2^1))\cap \si(\om_2^2)=(\si(\om)\cap\si(\om_2^1))\cup(\si(\om_2^1)\cap\si(\om_2^2))=\emptyset$. Therefore $(\om\oplus\om_2^1)\oplus\om_2^2$ is well-defined. So by associativity the expected result is obtained. 
%\cqfd

%Iterating the proof of the previous lemma, one has the following.
\begin{lemma}
Let $(\omega_i)_{i=1}^n$ be a finite family of elements of $S$ with pairwise disjoint supports.  Suppose that for $i=1,\cdots, n$, $\omega_i=\displaystyle\oplus_{k=1}^{n_i}\om_{i}^{k}$, where $(\om_i^{k})_{k=1}^{n_i}$ is a finite family of elements of $S$. Then 
$\displaystyle\oplus_{i=1}^n \omega_i=\oplus_{i=1}^n \left ( \oplus_{k=1}^{n_i}\om_{i}^{k}\right )$. 
\end{lemma}
These lemmas are useful to define the sum of two or more elements of $S$ using respective sum decompositions.\\
 
Now, an {\it atom} in a partial semigroup with unit $S$ is any object $\om\not=\ep$ which cannot be split, formally 
\begin{equation}
\om=\om_1\oplus \om_2\Longrightarrow \ep\in \{\om_1,\om_2\}\ .
\end{equation}
%Let $S^{+}:=S\setminus\{\epsilon\}$. Denoting $(S^+)^2$ the set of all elements of the form $\om_1\oplus \om_2$ with both $\om_1,\om_2\not=\epsilon$, then we can check that the set of atoms of $S$ is actually $S^+\setminus(S^+)^2$. 
The set of all atoms is denoted by $\mathtt{atoms}(S)$. 
Whenever the square-free decomposable semigroup $S$ is not {\it trivial}, {\it i.e.}, reduced to $\{\epsilon\}$, $\mathtt{atoms}(S)$ is not empty. 
\begin{expl}
The atoms obtained from examples~\ref{ex1}:
\begin{enumerate}\label{ex2}
%\item\label{intsf} the positive square-free integers $\si(n)$ being the set of primes which divide $n$, the atoms being the 
%primes.
\item The atoms of \ref{ex1}.\ref{int} are the primes.
\item The atoms of \ref{ex1}.\ref{graphs} are connected graphs.
\item The atoms of \ref{ex1}.\ref{endof} are the endofunctions for which the domain is a singleton.
\item The atoms of \ref{ex1}.\ref{ex13} are the monomials.  
\end{enumerate}
\end{expl}

%\begin{lemma}\label{noetherian}
%Let $(S,\oplus,\sigma)$ be a square-free decomposable (partial) semigroup. Then there is no infinite sequence $\om_0\oplus \om_1 \oplus \om_2\oplus\cdots$ such that for each $i$, $\omega_i=\omega_{i+1}\oplus \omega_{i+1}'$ for some $\omega_{i+1}'\in S$ where $\omega_{i+1}\not=\epsilon$.    
%\emph{}Then the division relation is noetherian in $(S,\oplus)$.
%\end{lemma}
%\Proof
%Let $\om\in S\setminus\{\epsilon\}$. If $\om$ is an atom, it has no proper divisor. So let suppose that $\om=\om_1\oplus \om_2$ with $\om_1$ and $\om_2$ different from $\epsilon$. By (DS) one has $\sigma(\om)=\sigma(\om_1)\sqcup\sigma(\om_2)$ with $\card(\sigma(\om_1))>0$, $\card(\sigma(\om_2))>0$, and $\card(\sigma(\om))=\card(\sigma(\om_1))+\card(\sigma(\om_2))$ and therefore $\card(\sigma(\om))>\card(\sigma(\om_i))$, $i=1,2$. Therefore at each step of the division process, the cardinality of each factor has strictly decreased. Because we deal with finite cardinal numbers and because $\epsilon$ is the unique element of $S$ such that $\sigma(\epsilon)=\emptyset$, there is no infinite chains of proper divisors. 
%\cqfd

%\begin{prop}
%Let $(S,\oplus,\sigma)$ be DS. Then $S$ is generated by the set of its atoms $\mathtt{atoms}(S)$. 
%\end{prop}
%\Proof
%Let $\pi : M^a \rightarrow M$ be the natural inclusion. 
%Let $(\mathtt{atoms}(S))^{\oplus}$ be the partial monoid generated by the atoms in $S$. We need to prove that $S\subseteq (\mathtt{atoms}(S))^{\oplus}$ which follows easily by noetherian induction: if $\om\in \mathtt{atoms}(S)$ there is nothing to prove. Suppose that $\om\not\in \mathtt{atoms}(S)$, therefore there are $\om_1\not=\epsilon$, $\om_2\not=\epsilon$ such that $\om=\om_1\oplus \om_2$. Because 
%$\card(\sigma(\om))>\card(\sigma(\om_i))$ (for $i=1,2$), it follows by induction that $\om_i$ are finite sums of atoms and so is $\om$.    
%\cqfd

The prescriptions (DS,LP) imply that decomposition of objects into atoms always exists  and is unique. 
\begin{prop}\label{decomposition_atomique_unique}
Let $(S,\oplus,\sigma)$ be SFD. For each $\om \in S$ there is one and only one  finite set of atoms $A=\{\om_1,\cdots,\om_n\}$ such that $\om={\oplus}_{i=1}^n \om_i$. One has $A=\emptyset$ iff $\omega=\epsilon$. 
\end{prop}

%\Proof
%Let $\om\in S$ such that $\om=\alpha_1\oplus\alpha_2=\alpha^1\oplus\alpha^2$, $\alpha_i,\alpha^j\in \mathtt{atoms}(S)$, $i=1,2$, $j=1,2$. By (LP) there are $\alpha_i^j\in S$ ($i=1,2$, $j=1,2$) such that $\alpha_i=\alpha_i^1\oplus\alpha_i^2$ and $\alpha_j=\alpha_1^j\oplus\alpha_2^j$ for $i=1,2$ and $j=1,2$. But $\alpha_1\in \mathtt{atoms}(S)$, therefore $\alpha_1^1$ or $\alpha_1^2$ is equal to $\epsilon$. Without loss of generality we may suppose that $\alpha_1^2=\epsilon$ and so $\alpha_1=\alpha_1^1$. Then 
%for the same reason $\alpha^1=\alpha_1^1=\alpha_1$ and $\alpha_1^2=\epsilon$. It implies easily that $\alpha^2=\alpha_2$. Now suppose that $\om=\alpha_1\oplus \om_2=\alpha^1 \oplus \om^2$, $\alpha_1,\alpha^1 \in \mathtt{atoms}(S)$ and $\om_1,\om_2\in S$. There are $\om_i^j \in S$ such that $\alpha_1=\om_1^1\oplus\om_1^2$, $\om_2=\om_2^1\oplus\om_2^2$, $\alpha^1=\om_1^1\oplus\om_2^1$ and 
%$\om^2=\om_1^2\oplus \om_2^2$. Since $\alpha_1 \in \mathtt{atoms}(S)$, either $\om_1^1$ or $\om_1^2$ is equal to $\epsilon$.
%\begin{enumerate}
%\item Suppose that $\om_1^1=\alpha_1$ and $\om_1^2=\epsilon$. Therefore $\alpha^1=\alpha_1$ and $\om_2^1=\epsilon$. Which in turn implies that $\om_2=\om^2$;
%\item Suppose that $\om_1^2=\alpha_1$ and $\om_1^1=\epsilon$. Therefore $\alpha^1=\om_2^1$, $\om_2=\alpha^1\oplus\om_2^2$ and 
%$\om^2=\alpha_1\oplus\om_2^2$. So one has 
%\begin{equation}
%\begin{array}{lll}
%\alpha_1\oplus\om_2&=&\alpha^1\oplus\om^2\\
%&=&\alpha^1\oplus\alpha_1\oplus\om_2^2\\
%&=&\alpha_1\oplus(\alpha^1\oplus\om_2^2)\ .
%\end{array}
%\end{equation}
%So we can iterate point (1) with $\om^2$ being replaced by $\alpha^1\oplus\om_2^2$. 
%\end{enumerate} 
%\cqfd 

\section{Exponential formula}
In this section we consider $(S,\oplus,\sigma)$ as a square-free decomposable partial semigroup with unit.\\

In the set $S$, objects are conceived to be  ``measured'' by different parameters (data in statistical language). So, to get 
a general purpose tool, we suppose that the statistics takes its values in a (unitary) ring $R$ of characteristic zero that is to say which contains $\Q$ (as, to write 
exponential generating series it is convenient to have no trouble with the fractions $\frac{1}{n!}$). Let then $c: S\ra R$ be the 
given statistics. For $F$ a finite set and each $X\subseteq S$, we define 
\begin{equation}
X_F:=\{\om\in X : \sigma(\om)=F\}\ .
\end{equation}
In order to write generating series, we need 
\begin{enumerate}
\item that the sums $\displaystyle c(X_F):=\sum_{\om\in X_F}c(\om)$ exist for every finite set $F$ of $\mathbb{N}^{+}$ and every $X\subseteq S$;
\item that $F\ra c(X_F)$ would depend only of the cardinality of the finite set $F$ of $\mathbb{N}^+$, for each fixed $X\subseteq S$;
\item that $c(\om_1\oplus \om_2)=c(\om_1).c(\om_2)$.
\end{enumerate}
We formalize it in \\

\noindent (LF) {\it Local finiteness}\pointir For each finite set $F$ of $\mathbb{N}^+$, the subset $S_F$ of $S$ 
is a finite set.\\
(Eq) {\it Equivariance}\pointir 
\begin{equation}
\card(F_1)=\card(F_2)\Longrightarrow c(\mathtt{atoms}(S)_{F_1})=c(\mathtt{atoms}(S)_{F_2})\ .
\end{equation}
(Mu) {\it Multiplicativity}\pointir 
\begin{equation}
c(\om_1\oplus \om_2)=c(\om_1).c(\om_2)\ .
\end{equation}

\begin{note}
a) In fact, (LF) is a property of the set $S$, while (Eq) is a property of the statistics. 
In practice, we choose $S$ which is locally finite and choose equivariant statistics for instance
$$
c(\om)=x^{\rm (number\ of\ cycles)}y^{\rm (number\ of\ fixed\ points)}
$$ 
for some variables $x,y$.\\


b) More generally, it is typical to take integer-valued partial (additive) statistics $c_1, \cdots c_i,\cdots ,c_r$ 
(for every $\omega\in S$, $c_i(\omega)\in \mathbb{N}$) and set
$c(\om)=x_1^{c_1(\omega)}x_2^{c_2(\omega)}\cdots x_r^{c_r(\omega)}$.\\
 
c) The set of example \ref{ex1}.\ref{int} is not locally finite, but other examples satisfy (LF): for instance \ref{ex1}.\ref{graphs} 
if one asks that the number of arrows and weight is finite, \ref{ex1}.\ref{intsf}.
\end{note}

A multiplicative statistics is called {\it proper} if $c(\epsilon)\not=0$. It is called {\it improper} if $c(\epsilon)=0$. In this case, for every $\om\in S$, $c(\om)=0$. Indeed 
$c(\om)=c(\om\oplus \epsilon)=c(\om)c(\epsilon)=0$. 

%A multiplicative statistic is called {\it proper} if, and only if, it is not improper, {\it i.e.}, $c(\epsilon)\not=0$. 
If $R$ is a integral domain and if $c$ is proper, then $c(\epsilon)=1$ because $c(\epsilon)=c(\epsilon\oplus\epsilon)=c(\epsilon)^2$, therefore $1=c(\epsilon)$. Note that for each $X\subseteq S$,  $c(X_{\emptyset})=\displaystyle\sum_{\om\in X_{\emptyset}}c(\om)=\left\{\begin{array}{lll}
c(\epsilon)&\mathit{if} & \epsilon\in X\\
0 & \mathit{if} & \epsilon\not\in X\end{array}\right .$. For every finite subset $X$ of $S$, we also define $c(X):=\displaystyle\sum_{\om\in X}c(\om)$, then we have in particular $c(\emptyset)=0$ (different from $c(S_{\emptyset})=c(\{\epsilon\})$ if $c$ is proper). The requirement (LF) implies that for every $X\subseteq S$ and every finite set $F$ of $\mathbb{N}^+$, $c(X_F)$ is defined as a sum of a finite number of terms because $X_F \subseteq S_F$, and therefore $X_F$ is finite. \\

Now, we are in position to state the exponential formula as it will be used throughout the paper. Let us recall the usual {\it exponential formula} for formal power series in $R[[z]]$ (see~\cite{La,St} for more details on formal power series). Let $f(z)=\displaystyle\sum_{n\geq 1}f_n z^n$. Then we have 
\begin{equation}
e^f=\displaystyle\sum_{n\geq 0}a_n \frac{z^n}{n!}
\end{equation} 
where 
\begin{equation}
a_n = \displaystyle\sum_{\pi\in \Pi_n}\prod_{p\in\pi}f_{\card(p)}
\end{equation}
with $\Pi_n$ being the set of all partitions of $[1..n]$ (in particular for $n=0$, $a_0=1$) and $e^z=\displaystyle\sum_{n\geq 0}\frac{z^n}{n!}\in R[[z]]$. \\
In what follows $[1..n]$ denotes the interval $\{j\in \mathbb{N}^+ : 1\leq j\leq n\}$, reduced to $\emptyset$ when $n=0$. Let $(S,\oplus,\si)$ be locally finite SFD and $c$ be a multiplicative equivariant statistics. For every subset $X$ of $S$ one sets the following {\it exponential
generating series}
\begin{equation}
\mathbf{EGF}(X; z) = \displaystyle\sum_{n= 0}^{\infty}c(X_{[1..n]})\frac{z^n}{n!}\ .
\end{equation}
\begin{theorem}[exponential formula]\label{expformula}
Let $S$ be a locally finite SFD and $c$ be a multiplicative equivariant statistics. We have 
\begin{equation}
\mathbf{EGF}(S;z)=c(\epsilon)-1+e^{\mathbf{EGF}({\mathtt{atoms}(S)};z)}\ .
\end{equation}
In particular if $c(\epsilon)=1$ (for instance if $c$ is proper and $R$ is an integral domain), 
\begin{equation}
\mathbf{EGF}(S;z)=e^{\mathbf{EGF}({\mathtt{atoms}(S)};z)}\ .
\end{equation}
\end{theorem}

\Proof
Let $n=0$. Then the unique element of $S_{\emptyset}$ is $\epsilon$. Therefore $c(S_{\emptyset})=c(\epsilon)$. Now suppose that $n> 0$ and let $\omega\in S_{[1..n]}$. According to proposition~\ref{decomposition_atomique_unique}, there is a unique finite set $\{\alpha_1,\dots,\alpha_k\}\subseteq {\mathtt{atoms}(S)}$ such that $\omega=\displaystyle\oplus_{i=1}^k \alpha_i$. By 
lemma~\ref{lemme_somme_generale_et_support}, $\{\sigma(\alpha_i):1\leq i\leq k\}$ is a partition of $[1..n]$ into $k$ blocks. Therefore $\omega\in {\mathtt{atoms}(S)}_{P_1}\oplus\dots\oplus {\mathtt{atoms}(S)}_{P_k}$ where $P_i=\sigma(\alpha_i)$ for $i=1,\dots,k$. We can remark that $\alpha_1\oplus\dots\oplus\alpha_k$ is well-defined for each $(\alpha_1,\dots,\alpha_k)\in {\mathtt{atoms}(S)}_{P_1}\times\dots\times {\mathtt{atoms}(S)}_{P_k}$ since the supports are disjoint. 
Now, one has, thanks to the partitions of $[1..n]$
\begin{eqnarray}
\displaystyle S_{[1..n]}=\bigsqcup_{\pi\in \Pi_n}\bigoplus_{p\in\pi}{\mathtt{atoms}(S)}_p \\
c(S_{[1..n]})=\sum_{\pi\in\Pi_n}\prod_{p\in \pi}c({\mathtt{atoms}(S)}_{p})
\end{eqnarray}
as, for disjoint (finite) sets $F$ and $G$ of $\mathbb{N}^+$, it is easy to check that $c(X_F\oplus X_G)=c(X_F)c(X_G)$ for every $X\subseteq S$ and because the disjoint union as only a finite number of factors. 
Therefore due to equivariance of $c$ on sets of the form ${\mathtt{atoms}(S)}_{F}$, one has 
\begin{equation}
\displaystyle c(S_{[1..n]})=\sum_{\pi\in\Pi_n}\prod_{p\in \pi}c({\mathtt{atoms}(S)}_{[1..\card(p)]})\ .
\end{equation}
But $c({\mathtt{atoms}(S)}_{[1..\card(p)]})$ is the $\card(p)$th coefficient of the series $\mathbf{EGF}({\mathtt{atoms}(S)};z)$. Therefore due to the usual exponential formula, $\mathbf{EGF}(S;z)=c(\epsilon)-1+e^{\mathbf{EGF}({\mathtt{atoms}(S)};z)}$. Now if  $c(\epsilon)=1$, then we obtain $\mathbf{EGF}(S;z)=e^{\mathbf{EGF}({\mathtt{atoms}(S)};z)}$. 
\cqfd

\section{Two examples}

The examples provided here pertain to the class of labelled graphs where the ``classic" exponential formula applies, namely {\it Burnside's Classes\footnote{The name is related to the notion of {\it free Burnside semigroups}, namely the quotient of the free semigroup $A^{+}$, where $A$ is a finite alphabet, by the the smallest congruence that contains the relators $\om^{n+m}=\om^n$, $\om\in A^{+}$. For more details see~\cite{PdLS01}.}} $\mathit{Burn}_{a,b}$, defined, for $0\leq a < b$ two integers, as the class of graphs of numeric endofunctions $f$ such that 
\begin{equation}
f^a = f^b
\end{equation}
where $f^n$ denotes the $n$th power with respect to functional composition. Despite of its simplicity, there are still (enumerative combinatorial) open problems for this class and only $B_{1,\ell+1}$ gives rise to an elegant formula \cite{GJ,St} (see also  \cite{HS67}, for the idempotent case: $\ell=1$ and compare to exact but non-easily tractable formulas in \cite{DM97} for the general case in the symmetric semigroup, and in \cite{Krat} for their generalization to the wreath product of the symmetric semigroup and a finite group).\\

The second example: the class of finite partitions which can be (and should here) identified as graphs of equivalence relations on finite subsets $F\subseteq \mathbb{N}^+$. Call this class ``Stirling class" as the number of such graphs with support $[1..n]$ and $k$ connected components is exactly the Stirling number of the second kind $S_2(n,k)$ and, using the statistics $x^{(\mathit{number\ of\ points})}y^{(\mathit{number\ of\ connected\ components})}$, one obtains 
\begin{equation}\label{stirling-class-classique}
\displaystyle\sum_{n,k\geq 0}S_2(n,k)\frac{x^n}{n!}y^k=e^{y(e^x-1)}\ .
\end{equation}

Examples of this kind bring us to the conclusion that bivariate ststistics like $Burn_{a,b}(n,k)$, 
$S_2(n,k)$ or $S_1(n,k)$ (Stirling numbers of the second and first kind) are better understood 
through the notion of one-parameter group, conversely such groups naturally arinsing in 
Combinatorial Physics lead to such statistics and new ones some of which can be interpreted 
combinatorially.

\section{Generalized Stirling numbers in Combinatorial Physics}

Many tools of Quantum Mechanics bail down to the consideration of creation and annihilation operators which will be here denoted respectively $a^{\dagger}$ and $a$. These two symbols do not commute and are subject to the unique relation 
\begin{equation}
[a,a^{\dagger}]=1\ .
\end{equation}
The complex algebra generated by these two symbols and this unique relation, the {\it Heisenberg-Weyl algebra}, will be here denoted by $HW_{\mathbb{C}}$. The consideration of evolution (one-parameter) groups $e^{\lambda \Omega}$ where 
$\Omega=\displaystyle\sum_{\omega\in HW_{\mathbb{C}}}\alpha(\omega)\omega$ is an element of $HW_{\mathbb{C}}$, with all - but a finite number of them - the complex numbers $\alpha(\omega)$ equal to $0$, and $\omega$ a word on the alphabet $\{a,a^{\dagger}\}$ leads to the necessity of solving the {\it Normal Ordering Problem}, {\it i.e.}, the reduction of the powers of $\Omega$ to the form 
\begin{equation}
\Omega^n = \displaystyle\sum \beta_{i,j}(a^{\dagger})^i a^j\ .
\end{equation}
In the sequel, $\mathit{Normal}(\Omega^n)$ denotes such a sum. 
This problem can be performed with three indices in general and two in the case of homogeneous operators that is operators for which the ``excess" $e=i-j$ is constant along the monomials $(a^{\dagger})^ia^j$ of the support (for which $\beta_{i,j}\not=0$). Thus, for 
\begin{equation}
\Omega = \displaystyle\sum_{i-j=e}\beta_{i,j}(a^{\dagger})^ia^j
\end{equation}
one has, for all $n\in\mathbb{N}$, 
\begin{equation}
\mathit{Normal}(\Omega^n)=(a^{\dagger})^{ne}\displaystyle\sum_{k=0}^{\infty}S_{\Omega}(n,k)(a^{\dagger})^ka^k
\end{equation}
when $e\geq 0$, and 
\begin{equation}
\mathit{Normal}(\Omega^n)=\displaystyle\left ( \sum_{k=0}^{\infty}S_{\Omega}(n,k)(a^{\dagger})^ka^k\right )a^{n|e|}
\end{equation}
otherwise. It turns out that, when there is only one annihilation, one gets a formula of the type ($x,y$ are formal commutative variables) 
\begin{equation}
\displaystyle\sum_{n,k\geq 0}S_{\Omega}(n,k)\frac{x^n}{n!}y^k = g(x)e^{y\sum_{n\geq 1}S_{\Omega}(n,1)\frac{x^n}{n!}}
\end{equation} 
which is a generalization of formula (\ref{stirling-class-classique}). A complete study of such a procedure and the details to perform the solution of the normal ordering problem may be found in \cite{GHED}. 

\section{Conclusion}

In this paper, we have broadened the domain
of application of the exponential formula, a
tool originated from statistical physics.
This broadening reveals us together with the
essence of ``why this formula works" a possibility
of extension to denominators other than the
factorial and also a link with one-parameter groups
whose infinitesimal generators are (formal) vector
fields on the line. The general combinatorial
theory of the correspondence
(vector fields $\leftrightarrow$ bivariate ststistics)
is still to be done despite the fact that we have
already a wealth of results in this direction.


\begin{thebibliography}{1}
%\bibitem{Bo} Bourbaki N., {\it Elements of mathematics: theory of sets}, Springer (2004).
%
%\bibitem{Bo1} Bourbaki N., {\it Univers}, Michael Artin, Alexandre Grothendieck, Jean-Louis Verdiers, eds. S\'eminaire de G\'eom\'etrie Alg\'ebrique du Bois-Marie - Th\'eorie des topos et cohomologie \'etale des sch\'emas (SGA 4), Lecture Notes in Mathematics. {\bf 269} (1963), 185-217.
%
%\bibitem{Co} Comtet L., {\it Analyse combinatoire}, PUF (1970).
%
\bibitem{Bru58} R.~H.~Bruck, {\it A survey of binary systems}, Ergebnisse der Mathematik und ihrer Grenzgebiete, new series, vol. 20, Berlin-Göttingen-Heidelberg, Springer, 1958.
%
\bibitem{DM97} A.~Dress and T.~M\"uller, ``Decomposable functors and the exponential principle", {\it Advances in Mathematics}, vol.~129, pp.~188-221, 1997.
%
\bibitem{Eil74} S.~Eilenberg, {\it Automata, Languages and Machines - volume A}, Academic Press, 1974.
%
\bibitem{Fl} P.~Flajolet, {\it Analytic Combinatorics}, Cambridge University Press, 2008.
%
\bibitem{GJ} I.~P.~Goulden and D.~M.~Jackson, {\it Combinatorial enumeration}, John Wiley \& Sons, Inc., 1983. 
%
\bibitem{GHED} G.~H.~E.~Duchamp, K.~A.~Penson, A.~I.~Solomon, A.~Horzela and P.~Blasiak, ``One-parameter groups and combinatorial physics", in {\it Proc. of the Third International Workshop on Contemporary Problems in Mathematic Physics (COPROMAPH3)}, Porto-Novo (Benin), 2003.
%
\bibitem{Jo} A.~Joyal, ``Une th\'eorie combinatoire des s\'eries formelles", {\it Advances in Mathematics}, vol.~42, pp.~1-82, 1981. 
%
\bibitem{HS67} B.~Harris and L.~Shoenfeld, ``The number of idempotent elements in symmetric semigroups", {\it Journal of Combinatorial Theory, Series A}, vol.~3, pp.~122-135, 1967.
%
\bibitem{Krat} C.~Krattenthaler and T.~W.~M\"uller, ``Equations in finite semigroups: explicit enumeration and asymptotics of solution numbers", {\it Journal of Combinatorial Theory, Series A}, vol.~105, pp.~291-334, 2004.
%
\bibitem{La} S.~Lang, {\it Complex analysis}, Springer, 1999.
%
\bibitem{LE97} E.~S.~Ljapin and A.~E.~Evseev, {\it The Theory of Partial Algebraic Operations}, Kluwer Academic, 1997.
%
%\bibitem{McL} Mc Lane, S., {\it Categories for the working mathematician}, Springer (1998).
\bibitem{PdLS01} A.~Pereira~do~Lago and I.~Simon, ``Free Burnside Semigroups", {\it Theoretical Informatics and Applications}, vol.~35, pp.~579-595, 2001. 
%
\bibitem{RU} R.~J.~Ridell and G.~E.~Uhlenbeck, ``On the theory of the virial development of the equation of state of monomatomic gases", 
 {\it J. Chem. Phys.}, vol.~21, pp.~2056-2064, 1953. 
%
\bibitem{Seg73} G.~Segal, ``Configuration-spaces and iterated loop-spaces", {\it Inventiones Mathematicae}, vol.~21 (3), pp.~213-221, 1973.
%
\bibitem{St} R.~Stanley, {\it Enumerative Combinatorics - Volume I}, in {\it Studies in Advanced Mathematics} vol.~49, Cambridge University Press, 1997. 
%
\bibitem{To} J.~Touchard, ``Sur les cycles des substitutions", {\it Acta Math.}, vol. 70, pp.~243-297, 1939.
%
\end{thebibliography}

\end{document} 
