×

Rooted planar maps modulo some patterns. (English) Zbl 1329.05075

Summary: We provide generating functions for the number of equivalence classes of rooted planar maps where two maps are equivalent whenever their representations in shuffles of Dyck words coincide on all occurrences of a given pattern.

MSC:

05C10 Planar graphs; geometric and topological aspects of graph theory
05C40 Connectivity
05A05 Permutations, words, matrices
05A15 Exact enumeration problems, generating functions
68R10 Graph theory (including graph drawing) in computer science
68Q45 Formal languages and automata
68R15 Combinatorics on words

Software:

OEIS
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Arquès, D., Une relation fonctionnelle nouvelle sur les cartes planaires pointées, J. Combin. Theory Ser. B, 39, 1, 27-42 (1985) · Zbl 0571.05001
[2] Baril, J.-L.; Mansour, T.; Petrossian, A., Equivalence classes of permutations modulo excedances, J. Comb., 5, 4, 453-469 (2014) · Zbl 1312.05002
[3] Baril, J.-L.; Petrossian, A., Equivalence of Dyck paths modulo some statistics, Discrete Math., 338, 655-660 (2015) · Zbl 1305.05006
[4] Baril, J.-L.; Petrossian, A., Equivalence classes of Motzkin paths modulo a pattern of length at most two, J. Integer Seq., 18, 15.7.1 (2015) · Zbl 1337.68216
[5] Bernardi, O., Bijective counting of tree-rooted maps and shuffles of parenthesis systems, Electron. J. Combin., 14, #R9 (2007) · Zbl 1115.05002
[6] Cori, R.; Richard, J., Enumeration des graphes planaires à l’aide des séries formelles en variables non commutatives, Discrete Math., 2, 115-162 (1972) · Zbl 0247.05140
[7] Deutsch, E., Dyck path enumeration, Discrete Math., 204, 167-202 (1999) · Zbl 0932.05006
[8] Lehman, A. B.; Walsh, T., Counting rooted maps by genus II, J. Comb. Theory B, 13, 122-141 (1972) · Zbl 0228.05109
[9] Mansour, T., Statistics on Dyck words, J. Integer Seq, 9, 06.1.5 (2006) · Zbl 1101.05006
[10] Mansour, T., Counting peaks at height \(k\) in a Dyck path, J. Integer Seq., 5, 02.1.1 (2002) · Zbl 1012.05004
[11] Mansour, T.; Shattuck, M., Counting Dyck paths according to the maximum distance between peaks and valley, J. Integer Seq., 15, 12.1.1 (2012) · Zbl 1292.05029
[12] Merlini, D.; Sprugnoli, R.; Verri, M. C., Some statistics on Dyck words, J. Statis. Plann. Inference, 101, 211-227 (2002) · Zbl 0998.05004
[13] Sapounakis, A.; Tasoulas, I.; Tsikouras, P., Counting strings in Dyck paths, Discrete Math., 307, 211-227 (2002) · Zbl 1127.05005
[15] Tutte, W. T., A census of planar maps, Canad J. Math., 15, 249-271 (1963) · Zbl 0115.17305
[16] Tutte, W. T., On the enumeration of planar maps, Bull. Amer. Math. Soc., 74, 64-74 (1968) · Zbl 0157.31101
[17] Walsh, T. R.S., Combinatorial enumeration of non-planar maps (1971), University of Toronto, (Ph.D. thesis) · Zbl 0443.05050
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.