Finite transition matrices for permutations avoiding pairs of length four patterns (Q1398262): Difference between revisions

This article shows that four classes of pattern-avoiding permutations are enumerated by a closed formula. The technique of proofs uses finite transition matrices associated with permutations avoiding pairs of length four patterns.

0 references

reviewed by

Laurent Vuillon

0 references

zbMATH Keywords

pattern-avoiding permutations

0 references

describes a project that uses

WILF

0 references

HERB

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Permutations which are the union of an increasing and a decreasing subsequence

0 references

The permutations \(123p_4\dots p_m\) and \(321p_4\dots p_m\) are Wilf-equivalent

0 references

Permutations avoiding certain patterns: The case of length 4 and some generalizations

0 references

Exact enumeration of 1342-avoiding permutations: A close link with labeled trees and planar maps

0 references

The permutation classes equinumerous to the smooth class

0 references

On representations of the braid group

0 references

Permutations with forbidden subsequences and a generalized Schröder number

0 references

Asymptotic values for degrees associated with strips of Young diagrams

0 references

Restricted permutations

0 references

Forbidden subsequences

0 references

Generating trees and the Catalan and Schröder numbers

0 references

Generating trees and forbidden subsequences

0 references

Wilf-equivalence for singleton classes

0 references

Enumeration schemes and, more importantly, their automatic generation

0 references

full work available at URL

https://doi.org/10.1016/s0012-365x(03)00042-6

0 references

Identifiers

zbMATH Open document ID

1024.05001

0 references

DOI

10.1016/S0012-365X(03)00042-6

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1398262

@@ Property / describes a project that uses @@
+HERB
@@ Property / describes a project that uses: HERB / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Permutations which are the union of an increasing and a decreasing subsequence
+Normal rank
@@ Property / cites work @@
+The permutations \(123p_4\dots p_m\) and \(321p_4\dots p_m\) are Wilf-equivalent
+Normal rank
@@ Property / cites work @@
+Permutations avoiding certain patterns: The case of length 4 and some generalizations
+Normal rank
@@ Property / cites work @@
+Exact enumeration of 1342-avoiding permutations: A close link with labeled trees and planar maps
+Normal rank
@@ Property / cites work @@
+The permutation classes equinumerous to the smooth class
+Normal rank
@@ Property / cites work @@
+On representations of the braid group
@@ Property / cites work: On representations of the braid group / rank @@
+Normal rank
@@ Property / cites work @@
+Permutations with forbidden subsequences and a generalized Schröder number
+Normal rank
@@ Property / cites work @@
+Asymptotic values for degrees associated with strips of Young diagrams
+Normal rank
@@ Property / cites work @@
+Restricted permutations
@@ Property / cites work: Restricted permutations / rank @@
+Normal rank
@@ Property / cites work @@
+Forbidden subsequences
@@ Property / cites work: Forbidden subsequences / rank @@
+Normal rank
@@ Property / cites work @@
+Generating trees and the Catalan and Schröder numbers
+Normal rank
@@ Property / cites work @@
+Generating trees and forbidden subsequences
@@ Property / cites work: Generating trees and forbidden subsequences / rank @@
+Normal rank
@@ Property / cites work @@
+Wilf-equivalence for singleton classes
@@ Property / cites work: Wilf-equivalence for singleton classes / rank @@
+Normal rank
@@ Property / cites work @@
+Enumeration schemes and, more importantly, their automatic generation
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0012-365x(03)00042-6
+Normal rank
@@ Property / OpenAlex ID @@
+W2024633196
@@ Property / OpenAlex ID: W2024633196 / rank @@
+Normal rank