Sciweavers

Share
COMBINATORICS
2002
77views more  COMBINATORICS 2002»
9 years 10 months ago
Profile Classes and Partial Well-Order for Permutations
Maximillian M. Murphy, Vincent R. Vatter
COMBINATORICS
2002
93views more  COMBINATORICS 2002»
9 years 10 months ago
On a Theorem of Erdos, Rubin, and Taylor on Choosability of Complete Bipartite Graphs
Erdos, Rubin, and Taylor found a nice correspondence between the minimum order of a complete bipartite graph that is not r-choosable and the minimum number of edges in an r-unifor...
Alexandr V. Kostochka
COMBINATORICS
2002
72views more  COMBINATORICS 2002»
9 years 10 months ago
Linearly Independent Products of Rectangularly Complementary Schur Functions
Fix a rectangular Young diagram R, and consider all the products of Schur functions ssc , where and c run over all (unordered) pairs of partitions which are complementary with re...
Michael Kleber
COMBINATORICS
2002
109views more  COMBINATORICS 2002»
9 years 10 months ago
Efficient Packing of Unit Squares in a Square
Let s(N) denote the edge length of the smallest square in which one can pack N unit squares. A duality method is introduced to prove that s(6) = s(7) = 3. Let nr be the smallest i...
Michael J. Kearney, Peter Shiu
COMBINATORICS
2002
51views more  COMBINATORICS 2002»
9 years 10 months ago
On Growth Rates of Closed Permutation Classes
Tomás Kaiser, Martin Klazar
COMBINATORICS
2002
105views more  COMBINATORICS 2002»
9 years 10 months ago
Counting 1324-Avoiding Permutations
We consider permutations that avoid the pattern 1324. By studying the generating tree for such permutations, we obtain a recurrence formula for their number. A computer program pr...
Darko Marinov, Rados Radoicic
COMBINATORICS
2002
80views more  COMBINATORICS 2002»
9 years 10 months 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
COMBINATORICS
2002
73views more  COMBINATORICS 2002»
9 years 10 months ago
Prefix Exchanging and Pattern Avoidance by Involutions
Let In() denote the number of involutions in the symmetric group Sn which avoid the permutation . We say that two permutations , Sj may be exchanged if for every n, k, and order...
Aaron D. Jaggard
books