Sciweavers

492 search results - page 33 / 99
» combinatorics 2006
Sort
View
COMBINATORICS
2004
97views more  COMBINATORICS 2004»
14 years 9 months ago
Dominance Order and Graphical Partitions
We gave a new criterion for graphical partitions. We derive a new recursion formula, which allows the computation of the number g(n) of graphical partitions of weight n for up to ...
Axel Kohnert
COMBINATORICS
2002
92views more  COMBINATORICS 2002»
14 years 9 months ago
New Lower Bound Formulas for Multicolored Ramsey Numbers
We give two lower bound formulas for multicolored Ramsey numbers. These formulas improve the bounds for several small multicolored Ramsey numbers.
Aaron Robertson
COMBINATORICS
1999
91views more  COMBINATORICS 1999»
14 years 9 months ago
A Criterion for Unimodality
We show that if P(x) is a polynomial with nondecreasing, nonnegative coefficients, then the coefficient sequence of P(x + 1) is unimodal. Applications are given.
George Boros, Victor H. Moll
COMBINATORICS
1999
75views more  COMBINATORICS 1999»
14 years 9 months ago
Stability of Kronecker Products of Irreducible Characters of the Symmetric Group
F. Murnaghan observed a long time ago that the computation of the decompositon of the Kronecker product (n-a,2,... ) (n-b,
Ernesto Vallejo
COCOON
2006
Springer
15 years 1 months ago
Improved Algorithms for the Minmax Regret 1-Median Problem
Hung-I Yu, Tzu-Chin Lin, Biing-Feng Wang