Sciweavers

134 search results - page 4 / 27
» Combinatorics of diagrams of permutations
Sort
View
65
Voted
COMBINATORICS
2006
83views more  COMBINATORICS 2006»
15 years 20 days ago
A Permutation Regularity Lemma
We introduce a permutation analogue of the celebrated Szemer
Joshua N. Cooper
93
Voted
COMBINATORICS
2004
73views more  COMBINATORICS 2004»
15 years 14 days ago
Minuscule Heaps over Dynkin Diagrams of Type A~
Manabu Hagiwara
80
Voted
COMBINATORICS
2002
83views more  COMBINATORICS 2002»
15 years 13 days ago
The Minimum Number of Monotone Subsequences
Erdos and Szekeres showed that any permutation of length n k2 + 1 contains
Joseph Samuel Myers
93
Voted
COMBINATORICS
2004
105views more  COMBINATORICS 2004»
15 years 14 days ago
An Answer to a Question by Wilf on Packing Distinct Patterns in a Permutation
We present a class of permutations for which the number of distinctly ordered subsequences of each permutation approaches an almost optimal value as the length of the permutation ...
Micah Coleman
56
Voted
COMBINATORICS
2002
80views more  COMBINATORICS 2002»
15 years 13 days ago
321-Polygon-Avoiding Permutations and Chebyshev Polynomials
A 321-k-gon-avoiding permutation avoids 321 and the following four patterns: k(k + 2)(k + 3)
Toufik Mansour, Zvezdelina Stankova