Sciweavers

1215 search results - page 137 / 243
» Combinatorics
Sort
View
122
Voted
COMBINATORICS
2007
75views more  COMBINATORICS 2007»
15 years 3 months ago
Maximal Projective Degrees for Strict Partitions
Let λ be a partition, and denote by fλ the number of standard tableaux of shape λ. The asymptotic shape of λ maximizing fλ was determined in the classical work of Logan and S...
D. Bernstein, A. Henke, A. Regev
115
Voted
COMBINATORICS
2007
88views more  COMBINATORICS 2007»
15 years 3 months ago
Maximum Matchings in Regular Graphs of High Girth
Let G = (V, E) be any d-regular graph with girth g on n vertices, for d ≥ 3. This note shows that G has a maximum matching which includes all but an exponentially small fraction...
Abraham D. Flaxman, Shlomo Hoory
COMBINATORICS
2007
164views more  COMBINATORICS 2007»
15 years 3 months ago
Longest Alternating Subsequences in Pattern-Restricted Permutations
We determine the limiting distributions of the longest alternating subsequence for pattern-restricted permutations in which the pattern is any one of the six patterns of length th...
Ghassan Firro, Toufik Mansour, Mark C. Wilson
133
Voted
COMBINATORICS
2007
105views more  COMBINATORICS 2007»
15 years 3 months ago
A Two Parameter Chromatic Symmetric Function
We introduce and develop a two-parameter chromatic symmetric function for a simple graph G over the field of rational functions in q and t , Q (q, t). We derive its expansion in ...
Ellison-Anne Williams
66
Voted
COMBINATORICS
2007
55views more  COMBINATORICS 2007»
15 years 3 months ago
Which Chessboards have a Closed Knight's Tour within the Cube?
A closed knight’s tour of a chessboard uses legal moves of the knight to visit every square exactly once and return to its starting position. When the chessboard is translated i...
Joe DeMaio