Automatic enumeration of regular objects

Simple item page
dc.creatorMishna, Marni
dc.date2005-07-12
dc.date2007-05-10
dc.date.accessioned2026-07-07T09:23:37Z
dc.date.available2026-07-07T09:23:37Z
dc.descriptionWe describe a framework for systematic enumeration of families combinatorial structures which 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 counting sequence and for asymptotic analysis. The key tool is the scalar product for symmetric functions and that this operation preserves D-finiteness.
dc.descriptionCorrected for readability; To appear in the Journal of Integer Sequences
dc.identifierhttps://arxiv.org/abs/math/0507249
dc.identifierhttp://arxiv.org/abs/math/0507249
dc.identifierJournal of Integer Sequences, Vol. 10 (2007), Article 07.5.5
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/155799
dc.subjectCombinatorics
dc.subject05A15 (primary) 05C50 05C65 (secondary)
dc.titleAutomatic enumeration of regular objects
dc.typetext

Files

Collections

arXiv