Paired patterns in lattice paths

Publication date: 16 October 2019

Abstract: Let

m a t h c a l 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

L i n {E, N}^{*}

with

n

E

's and

n

N

's. Given

L i n m a t h c a l L_{n}

and a subset

A

of

[n] = 1, l d o t s, n

, we let

p s_{L} (A)

denote the word that results from

L

by removing the

i^{t h}

occurrence of

E

and the

i^{t h}

occurrence of

N

in

L

for all

i i n [n] - A

, reading from left to right. Then we say that a paired pattern

P i n m a t h c a l L_{k}

occurs in

L

if there is some

A s u b s e t e q [n]

of size

k

such that

p s_{L} (A) = P

. In this paper, we study the generating functions of paired pattern matching in

m a t h c a l L_{n}

.

Cited In (2)

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