Sciweavers

72 search results - page 5 / 15

» combinatorics 1999

72

Voted

COCOON
1999
Springer

101views Combinatorics» more COCOON 1999»

The Web as a Graph: Measurements, Models, and Methods

15 years 2 months ago

The Web as a Graph: Measurements, Models, and Methods

Download www.cs.brown.edu

Jon M. Kleinberg, Ravi Kumar, Prabhakar Raghavan, ...

claim paper

Read More »

54

CPM
1999
Springer

94views Combinatorics» more CPM 1999»

Finding Maximal Pairs with Bounded Gap

15 years 2 months ago

Finding Maximal Pairs with Bounded Gap

Download www.brics.dk

Gerth Stølting Brodal, Rune B. Lyngsø...

claim paper

Read More »

68

COMBINATORICS
1999

75views more COMBINATORICS 1999»

Stability of Kronecker Products of Irreducible Characters of the Symmetric Group

14 years 9 months ago

Stability of Kronecker Products of Irreducible Characters of the Symmetric Group

Download www.combinatorics.org

F. Murnaghan observed a long time ago that the computation of the decompositon of the Kronecker product (n-a,2,... ) (n-b,

Ernesto Vallejo

claim paper

Read More »

81

COMBINATORICS
1999

98views more COMBINATORICS 1999»

On the Structure and Classification of SOMAs: Generalizations of Mutually Orthogonal Latin Squares

14 years 9 months ago

On the Structure and Classification of SOMAs: Generalizations of Mutually Orthogonal Latin Squares

Download www.combinatorics.org

Let k 0 and n 2 be integers. A SOMA, or more specifically a SOMA(k, n), is an n

Leonard H. Soicher

claim paper

Read More »

61

Voted

COMBINATORICS
1999

91views more COMBINATORICS 1999»

A Criterion for Unimodality

14 years 9 months ago

A Criterion for Unimodality

Download www.combinatorics.org

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

claim paper

Read More »

« Prev « First page 5 / 15 Last » Next »