Binary strings without zigzags

zbMath1186.05015MaRDI QIDQ2654560

Emanuele Munarini, Norma Zagaglia Salvi

Publication date: 19 January 2010

Published in: Séminaire Lotharingien de Combinatoire (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/227464

zbMATH Keywords

lattice pathszigzagsbinary wordssecondary structuresbinary stringsCatalan-like pathsriordan matrixtrinomial paths

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Factorials, binomial coefficients, combinatorial functions (05A10) Permutations, words, matrices (05A05) Asymptotic enumeration (05A16)

Related Items (4)

Double graphs ⋮ Seven (lattice) paths to log-convexity ⋮ A history and a survey of lattice path enumeration ⋮ Analytic combinatorics of lattice paths with forbidden patterns, the vectorial kernel method, and generating functions for pushdown automata

This page was built for publication: Binary strings without zigzags