Automatic enumeration of regular objects
Journal of integer sequences, Tome 10 (2007) no. 5
We describe a framework for systematic enumeration of families combinatorial structures that possess a certain regularity. More precisely, we describe how to obtain the differential equations satisfied by their generating series. These differential equations are then used to determine the initial terms in the counting sequence and for asymptotic analysis. The key tool is the scalar product for symmetric functions.
Classification :
05A16, 05C30
Keywords: asymptotic enumeration, automatic combinatorics, generating functions, symmetric functions
Keywords: asymptotic enumeration, automatic combinatorics, generating functions, symmetric functions
@article{JIS_2007__10_5_a4,
author = {Mishna, Marni},
title = {Automatic enumeration of regular objects},
journal = {Journal of integer sequences},
year = {2007},
volume = {10},
number = {5},
zbl = {1138.05303},
language = {en},
url = {http://geodesic.mathdoc.fr/item/JIS_2007__10_5_a4/}
}
Mishna, Marni. Automatic enumeration of regular objects. Journal of integer sequences, Tome 10 (2007) no. 5. http://geodesic.mathdoc.fr/item/JIS_2007__10_5_a4/