Publication:2328858

DOI10.1007/978-3-030-11102-1_17zbMATH Open1422.05014arXiv1601.07988OpenAlexW2271322173MaRDI QIDQ2328858FDOQ2328858

Ran Pan, Jeffrey Remmel

Publication date: 16 October 2019

Abstract: Let $mathcal{L}_n$ denote the set of all paths from $[0,0]$ to $[n,n]$ which consist of either unit north steps $N$ or unit east steps $E$ or, equivalently, the set of all words $Lin{E,N}^{*}$ with $n$ $E$'s and $n$ $N$'s. Given $Linmathcal{L}_n$ and a subset $A$ of $[n]=1,ldots,n$, we let $p{s}_L(A)$ denote the word that results from $L$ by removing the $i^{th}$ occurrence of $E$ and the $i^{th}$ occurrence of $N$ in $L$ for all $iin[n]-A$, reading from left to right. Then we say that a paired pattern $Pinmathcal{L}_k$ occurs in $L$ if there is some $Asubseteq[n]$ of size $k$ such that $p{s}_L(A)=P$. In this paper, we study the generating functions of paired pattern matching in $mathcal{L}_n$.

Full work available at URL: https://arxiv.org/abs/1601.07988

zbMATH Keywords

generating functionwordslattice pathspaired patterns

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19)

Cited In (2)

• Doubled patterns with reversal and square-free doubled patterns
• Analytic combinatorics of lattice paths with forbidden patterns, the vectorial kernel method, and generating functions for pushdown automata

This page was built for publication: Paired patterns in lattice paths

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2328858)