Wilf-equivalence for singleton classes

DOI10.1016/J.AAM.2004.11.006zbMATH Open1127.05002OpenAlexW2015106956WikidataQ60638477 ScholiaQ60638477MaRDI QIDQ2643864FDOQ2643864

Authors: Julian West, Guoce Xin, Jörgen Backelin 

Publication date: 27 August 2007

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aam.2004.11.006

Recommendations

• The permutations \(123p_4\dots p_m\) and \(321p_4\dots p_m\) are Wilf-equivalent
• scientific article; zbMATH DE number 125616
• Matrices permutation equivalent to primitive matrices
• scientific article; zbMATH DE number 4057527
• Permutative nonnegative matrices with prescribed spectrum
• A note on the rank inequality for diagonally magic matrices
• On \(\kappa\)-real and \(\kappa\)-Hermitian matrices
• Bijective matrix algebra
• Ranks of permutative matrices
• scientific article; zbMATH DE number 774598

zbMATH Keywords

permutationspermutation matricesYoung diagramsbijectionsWilf equivalenceforbidden subsequencesforbidden matrices

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20)

Cites Work

• Restricted permutations
• Generating trees and the Catalan and Schröder numbers
• Forbidden subsequences
• Generating trees and forbidden subsequences
• A new class of Wilf-equivalent permutations
• The permutations \(123p_4\dots p_m\) and \(321p_4\dots p_m\) are Wilf-equivalent
• Classification of forbidden subsequences of length 4

Cited In (48)

• Fast algorithms for finding pattern avoiders and counting pattern occurrences in permutations
• Partial permutations avoiding pairs of patterns
• Shape-Wilf-equivalences for vincular patterns
• Increasing and decreasing sequences in fillings of moon polyominoes
• Beyond alternating permutations: pattern avoidance in Young diagrams and tableaux
• On pattern avoiding alternating permutations
• Ascent-descent Young diagrams and pattern avoidance in alternating permutations
• Classical and consecutive pattern avoidance in rooted forests
• On refinements of Wilf-equivalence for involutions
• Explicit enumeration of 321, hexagon-avoiding permutations
• Growth diagrams, and increasing and decreasing chains in fillings of Ferrers shapes
• The permutations \(123p_4\dots p_m\) and \(321p_4\dots p_m\) are Wilf-equivalent
• Equidistribution of set-valued statistics on standard Young tableaux and transversals
• Finite transition matrices for permutations avoiding pairs of length four patterns
• Modified growth diagrams, permutation pivots, and the BWX map \(\phi ^{\ast}\)
• A new class of Wilf-equivalent permutations
• Permutations avoiding certain patterns: The case of length 4 and some generalizations
• Pattern-avoiding \(( 0 , 1 )\)-matrices and bases of permutation matrices
• Wilf equivalence relations for consecutive patterns
• Long increasing subsequences and non-algebraicity
• The limit of a Stanley-Wilf sequence is not always rational, and layered patterns beat monotone patterns
• Upper bounds for the Stanley-Wilf limit of 1324 and other layered patterns
• Avoiding a pair of patterns in multisets and compositions
• New records in Stanley-Wilf limits
• Mini-workshop: Permutation patterns. Abstracts from the mini-workshop held January 28 -- February 2, 2024
• k-noncrossing and k-nonnesting graphs and fillings of Ferrers diagrams
• Pattern avoidance in matchings and partitions
• Hecke insertion and maximal increasing and decreasing sequences in fillings of stack polyominoes
• Combinatorics of exterior peaks on pattern-avoiding symmetric transversals
• A new class of multiset Wilf equivalent pairs
• On (shape-)Wilf-equivalence for words
• Another look at bijections for pattern-avoiding permutations
• The solution of a conjecture of Stanley and Wilf for all layered patterns
• On bijections for pattern-avoiding permutations
• Maximal increasing sequences in fillings of almost-moon polyominoes
• An infinite family of inv-Wilf-equivalent permutation pairs
• Classical length-5 pattern-avoiding permutations
• Counting permutations with no long monotone subsequence via generating trees and the kernel method
• A general theory of Wilf-equivalence for Catalan structures
• Stack-sorting, set partitions, and Lassalle's sequence
• Decreasing subsequences in permutations and Wilf equivalence for involutions
• New equivalences for pattern avoiding involutions
• \(k\)-noncrossing and \(k\)-nonnesting graphs and fillings of Ferrers diagrams
• Large deviations for permutations avoiding monotone patterns
• On a refinement of Wilf-equivalence for permutations
• Uniquely-Wilf classes
• Fillings of skew shapes avoiding diagonal patterns
• Wilf equivalences for patterns in rooted labeled forests

This page was built for publication: Wilf-equivalence for singleton classes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2643864)