On a conjecture about strong pattern avoidance

DOI10.1007/S00373-022-02602-YzbMATH Open1504.05014OpenAlexW4311892914WikidataQ123017920 ScholiaQ123017920MaRDI QIDQ2103333FDOQ2103333

Authors: Junyao Pan 

Publication date: 13 December 2022

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-022-02602-y

Recommendations

• Pattern-avoiding permutation powers
• Pattern avoidance in permutations and their squares
• The number of permutations avoiding a set of generalized permutation patterns
• On the Stanley-Wilf conjecture for the number of permutations avoiding a given pattern
• On the number of permutations avoiding a given pattern

zbMATH Keywords

permutationFibonacci numberstrong pattern avoidance

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorics of partially ordered sets (06A07) Recurrences (11B37)

Cites Work

• Title not available (Why is that?)
• Combinatorics of permutations
• Pattern avoidance in permutations and their squares
• Two first-order logics of permutations
• Permutation Involvement and Groups
• Permutation groups arising from pattern involvement
• Pattern-avoiding permutation powers

Cited In (6)

• Pattern-avoiding permutation powers
• Some variations on a theme of Irina Mel'nichuk concerning the avoidability of patterns in strings of symbols
• On pattern avoidance in matchings and involutions
• Powers of permutations that avoid chains of patterns
• A simple proof for the exponential upper bound for some tenacious patterns
• On the permutations that strongly avoid the pattern 312 or 231

This page was built for publication: On a conjecture about strong pattern avoidance

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