Counting permutations by their rigid patterns
From MaRDI portal
Publication:696917
DOI10.1006/JCTA.2002.3279zbMATH Open1006.05008OpenAlexW2102040169MaRDI QIDQ696917FDOQ696917
Authors: Amy N. Myers
Publication date: 12 September 2002
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/39c6e9e9038e6e44e03187372b3cd2c23f743e8e
Recommendations
Cites Work
- The On-Line Encyclopedia of Integer Sequences
- Restricted permutations
- The enumeration of permutations with a prescribed number of ``forbidden patterns
- Exact enumeration of 1342-avoiding permutations: A close link with labeled trees and planar maps
- Classification of forbidden subsequences of length 4
- The solution of a conjecture of Stanley and Wilf for all layered patterns
- Permutation patterns and continued fractions
- Title not available (Why is that?)
Cited In (11)
- New theoretical bounds and constructions of permutation codes under block permutation metric
- From Hertzsprung's problem to pattern-rewriting systems
- Where the monotone pattern (mostly) rules
- A discrete probability problem in card shuffling
- Title not available (Why is that?)
- A counting scheme and some algebraic properties of a class of special permutation patterns
- Stacking Blocks and Counting Permutations
- Counting occurrences of a pattern of type (1, 2) or (2, 1) in permutations
- A new metric on symmetric groups and applications to block permutation codes
- Title not available (Why is that?)
- Title not available (Why is that?)
Uses Software
This page was built for publication: Counting permutations by their rigid patterns
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q696917)