Subregularity in infinitely labeled generating trees of restricted permutations
From MaRDI portal
Publication:2155932
DOI10.1016/J.AAM.2022.102393zbMath1493.05009arXiv2110.07784OpenAlexW3206070984MaRDI QIDQ2155932
Mark Shattuck, Reza Rastegar, Toufik Mansour
Publication date: 15 July 2022
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2110.07784
Trees (05C05) Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Directed graphs (digraphs), tournaments (05C20)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Refining enumeration schemes to count according to permutation statistics
- Enumeration schemes for vincular patterns
- Patterns in permutations and words.
- The enumeration of permutations with a prescribed number of ``forbidden patterns
- The number of Baxter permutations
- Forbidden subsequences and Chebyshev polynomials
- Enumeration schemes and, more importantly, their automatic generation
- Generating functions for generating trees
- A methodology for plane tree enumeration
- Finite transition matrices for permutations avoiding pairs of length four patterns
- Generating trees and the Catalan and Schröder numbers
- Generating trees and forbidden subsequences
- From Motzkin to Catalan permutations
- Finitely labeled generating trees and restricted permutations
- Kernel method and linear recurrence system
- Automatic Generation of Theorems and Proofs on Enumerating Consecutive-Wilf Classes
- ECO:a methodology for the enumeration of combinatorial objects
- Enumeration Schemes for Restricted Permutations
- Restricted permutations
This page was built for publication: Subregularity in infinitely labeled generating trees of restricted permutations
