A simple proof for the exponential upper bound for some tenacious patterns
type: Item
instance of: scholarly article
title: A simple proof for the exponential upper bound for some tenacious patterns
zbMATH Open document ID: 1050.05005
author: Miklós Bóna
published in: Advances in Applied Mathematics
publication date: 2004-10-12T00:00:00Z
Mathematics Subject Classification ID: 05A05
Mathematics Subject Classification ID: 05A15
zbMATH DE Number: 2107245
zbMATH Keywords: pattern
zbMATH Keywords: Stanley-Wilf conjecture
MaRDI profile type: Publication
full work available at URL: j.aam.2003.07.003
OpenAlex ID: W2041026622
cites work: On the number of permutations avoiding a given pattern
cites work: Q3148849
cites work: The solution of a conjecture of Stanley and Wilf for all layered patterns
cites work: Exact enumeration of 1342-avoiding permutations: A close link with labeled trees and planar maps
cites work: Asymptotic values for degrees associated with strips of Young diagrams
DOI: 10.1016/J.AAM.2003.07.003
Recommended article: Exponential patterns in arithmetic Ramsey theory
Recommended article: An exponential-type upper bound for Folkman numbers
Recommended article: Bounds on the exponential domination number
Recommended article: Upper bounds for the Stanley-Wilf limit of 1324 and other layered patterns
Recommended article: A new exponential upper bound for the Erd\H{o}s-Ginzburg-Ziv constant
Recommended article: Q3137399
Recommended article: Upper and lower bounds in exponential Tauberian theorems
Recommended article: On a conjecture about strong pattern avoidance
Recommended article: Proof of the Razumov-Stroganov conjecture for some infinite families of link patterns
Recommended article: A new upper bound for Conway's thrackles
description: scientific article; zbMATH DE number 2107245