2022
DOI: 10.2478/puma-2022-0009
|View full text |Cite
|
Sign up to set email alerts
|

A generating tree with a single label for permutations avoiding the vincular pattern 1−32−4

Abstract: We continue the study of permutations avoiding the vincular pattern 1−32−4 by constructing a generating tree with a single label for these permutations. This construction finally provides a clearer explanation of why a certain recursive formula found by Callan actually counts these permutations, since this formula was originally obtained as a consequence of a very intricate bijection with a certain class of ordered rooted trees. This responds to a theoretical issue already raised by Duchi, Guerrini and Rinaldi… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals

citations
Cited by 0 publications
references
References 19 publications
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?