On asymmetric structures

A given structure is said to be asymmetric if its automorphism group reduces to the identity. The problem of enumerating asymmetric structures (and, more generally, to count structures according to stabilizers) is usually solved by making use of Mobius inversion techniques and symmetric functions in the context of group actions. This method of solution was introduced by Rota (1964, 1969) who defined special classes of polynomials which may be called asymmetry indicator polynomials. Subsequent developments following similar ideas can be found in Stockmeyer (1971), White (1975), Rota, Smith and Sagan (1977, 1980), Kerber (1986). We present here another approach to this problem within the theory of species of structures in the sense of Joyal (1981, 1985, 1986). Every species of structures F contains a sub-species F, called the flat part of F, consisting of all asymmetric F-structures. We introduce an asymmetry indicator series ΓF(x1, x2, x3,…) by means of which we study the correspondence F↦F in connection with the various operations existing in the theory of species of structures. The main result is that the ΓF behaves with respect to the combinatorial operations of sum, product, substitution and differentiation as does the classical cycle indicator series ZF. As a consequence, the asymmetry indicator series can be applied to the systematic classification and enumeration of asymmetric F-structures when the species F is defined (explicitly or recursively) by combinatorial equations. We illustrate the method on particular species (including enriched trees and rooted trees) and a table of ΓF is given for the atomic species concentrated on small cardinalities. Examples show that ΓF contains information independent of that in ZF.

[1]  G. Rota On the foundations of combinatorial theory I. Theory of Möbius Functions , 1964 .

[2]  Adalbert Kerber,et al.  Enumeration under finite group action: Symmetry classes of mappings , 1986 .

[3]  Gilbert Labelle,et al.  Some new computational methods in the theory of species , 1986 .

[4]  Dennis E. White,et al.  Counting patterns with a given automorphism group , 1975 .

[5]  John W. Moon,et al.  Hereditarily finite sets and identity trees , 1983, J. Comb. Theory, Ser. B.

[6]  Gilbert Labelle,et al.  Une nouvelle démonstration combinatoire des formules d'inversion de Lagrange , 1981 .

[7]  Frank Harary,et al.  The number of homeomorphically irreducible trees, and other species , 1959 .

[8]  Gian-Carlo Rota,et al.  Baxter algebras and combinatorial identities. II , 1969 .

[9]  Yeong-Nan Yeh,et al.  The relation between burnside rings and combinatorial species , 1989, J. Comb. Theory, Ser. A.

[10]  François Bergeron Combinatorics of classic orthogonal polynomials: a unified approach , 1990 .

[11]  Dominique Foata,et al.  A Combinatorial Proof of the Mehler Formula , 1978, J. Comb. Theory A.

[12]  Gilbert Labelle On combinatorial differential equations , 1986 .

[13]  Gian-Carlo Rota,et al.  Congruences Derived from Group Action , 1980, Eur. J. Comb..

[14]  A. Joyal Une théorie combinatoire des séries formelles , 1981 .

[15]  Yeong-Nan Yeh The calculus of virtual species and K-species , 1986 .

[16]  Gilbert Labelle Combinatorial directional derivatives and Taylor expansions (French) , 1990 .

[17]  G. Pólya Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische Verbindungen , 1937 .

[18]  A. Joyal Foncteurs analytiques et espèces de structures , 1986 .

[19]  Gian-Carlo Rota,et al.  Enumeration under group action , 1977 .

[20]  Gilbert Labelle,et al.  On the generalized iterates of Yeh's combinatorial K-species , 1989, J. Comb. Theory, Ser. A.