Examples of automatic asymptotic expansions
ACM SIGSAM Bulletin
Asymptotic enumeration methods
Handbook of combinatorics (vol. 2)
Combinatorial Enumeration
Hi-index | 0.00 |
We study the number of solutions of the general semigroup equation in one variable, Xα = Xβ, as well as of the system of equations X2 = X, Y2 = Y, XY = YX in H ≀ Tn, the wreath product of an arbitrary finite group H with the full transformation semigroup Tn on n letters. For these solution numbers, we provide explicit exact formulae, as well as asymptotic estimates. Our results concerning the first mentioned problem generalize earlier results by Harris and Schoenfeld (J. Combin. Theory Ser. A 3 (1967) 122) on the number of idempotents in Tn, and a result of Dress and the second author (Adv. in Math. 129 (1997) 188). Among the asymptotic tools employed are Hayman's method for the estimation of coefficients of analytic functions and the Poisson summation formula.