Pages that link to "Item:Q1305174"
From MaRDI portal
The following pages link to On the Stanley-Wilf conjecture for the number of permutations avoiding a given pattern (Q1305174):
Displaying 48 items.
- Locally convex words and permutations (Q281597) (← links)
- Waiting time distribution for the emergence of superpatterns (Q292369) (← links)
- Using functional equations to enumerate 1324-avoiding permutations (Q402577) (← links)
- The maximal length of a \(k\)-separator permutation (Q405306) (← links)
- Upper bounds for the Stanley-Wilf limit of 1324 and other layered patterns (Q444905) (← links)
- Large deviations for permutations avoiding monotone patterns (Q504968) (← links)
- Preferential arrangement superpatterns (Q510524) (← links)
- The limit of a Stanley-Wilf sequence is not always rational, and layered patterns beat monotone patterns (Q556857) (← links)
- Excluded permutation matrices and the Stanley-Wilf conjecture (Q598446) (← links)
- Permutations generated by stacks and deques (Q659569) (← links)
- Some results on superpatterns for preferential arrangements (Q730640) (← links)
- Bounded affine permutations. II: Avoidance of decreasing patterns (Q825965) (← links)
- Longest alternating subsequences of permutations (Q841561) (← links)
- Hereditary properties of partitions, ordered graphs and ordered hypergraphs (Q850077) (← links)
- New records in Stanley-Wilf limits (Q854808) (← links)
- Avoiding consecutive patterns in permutations (Q990772) (← links)
- Asymptotic bounds for permutations containing many different patterns (Q1003625) (← links)
- On constants in the Füredi-Hajnal and the Stanley-Wilf conjecture (Q1003642) (← links)
- The solution of a conjecture of Stanley and Wilf for all layered patterns (Q1279660) (← links)
- Shape avoiding permutations (Q1604576) (← links)
- Staircases, dominoes, and the growth rate of 1324-avoiders (Q1689896) (← links)
- Generating permutations with restricted containers (Q1747767) (← links)
- Avoidance of boxed mesh patterns on permutations (Q1759862) (← links)
- Finite automata and pattern avoidance in words (Q1775550) (← links)
- On growth rates of closed permutation classes (Q1871365) (← links)
- On the number of permutations avoiding a given pattern (Q1971017) (← links)
- On the growth of merges and staircases of permutation classes (Q2002496) (← links)
- Lower bounds for superpatterns and universal sequences (Q2037175) (← links)
- On Stanley-Wilf limit of the pattern 1324 (Q2048379) (← links)
- On a conjecture about strong pattern avoidance (Q2103333) (← links)
- Supertrees (Q2181994) (← links)
- Growth rates of permutation classes: categorization up to the uncountability threshold (Q2182018) (← links)
- Pattern-avoiding permutation powers (Q2198373) (← links)
- Universal arrays (Q2231736) (← links)
- A new record for \(1324\)-avoiding permutations (Q2340972) (← links)
- Bounds on superpatterns containing all layered permutations (Q2354608) (← links)
- Longest monotone subsequences and rare regions of pattern-avoiding permutations (Q2409846) (← links)
- On the Stanley--Wilf limit of 4231-avoiding permutations and a conjecture of Arratia (Q2490021) (← links)
- Asymptotic enumeration of permutations avoiding generalized patterns (Q2490025) (← links)
- Universality of random permutations (Q3300092) (← links)
- Bounded affine permutations I. Pattern avoidance and enumeration (Q5074763) (← links)
- Finite Automata, Probabilistic Method, and Occurrence Enumeration of a Pattern in Words and Permutations (Q5107065) (← links)
- Containing All Permutations (Q5144492) (← links)
- On the centrosymmetric permutations in a class (Q5197609) (← links)
- (Q5383238) (← links)
- Stanley-Wilf limits for patterns in rooted labeled forests (Q6146494) (← links)
- An asymptotically tight lower bound for superpatterns with small alphabets (Q6179325) (← links)
- Strongly sublinear algorithms for testing pattern freeness (Q6566461) (← links)
