Sciweavers

1215 search results - page 101 / 243
» Combinatorics
Sort
View
116
Voted
COMBINATORICS
1998
130views more  COMBINATORICS 1998»
15 years 3 months ago
Codes and Projective Multisets
The paper gives a matrix-free presentation of the correspondence between full-length linear codes and projective multisets. It generalizes the BrouwerVan Eupen construction that t...
Stefan M. Dodunekov, Juriaan Simonis
134
Voted
COMBINATORICS
1998
80views more  COMBINATORICS 1998»
15 years 3 months ago
Increasing Subsequences and the Classical Groups
We show that the moments of the trace of a random unitary matrix have combinatorial interpretations in terms of longest increasing subsequences of permutations. To be precise, we s...
Eric M. Rains
COMBINATORICS
1999
87views more  COMBINATORICS 1999»
15 years 3 months ago
Multivariate Asymptotics for Products of Large Powers with Applications to Lagrange Inversion
An asymptotic estimate is given for the coefficients of products of large powers of generating functions. This theorem and another local limit theorem which is useful for conditio...
Edward A. Bender, L. Bruce Richmond
107
Voted
COMBINATORICS
1999
113views more  COMBINATORICS 1999»
15 years 3 months ago
Bicoloring Steiner Triple Systems
A Steiner triple system has a bicoloring with m color classes if the points are partitioned into m subsets and the three points in every block are contained in exactly two of the ...
Charles J. Colbourn, Jeffrey H. Dinitz, Alexander ...
116
Voted
COMBINATORICS
1999
80views more  COMBINATORICS 1999»
15 years 3 months ago
On the Theory of Pfaffian Orientations. I. Perfect Matchings and Permanents
Kasteleyn stated that the generating function of the perfect matchings of a graph of genus g may be written as a linear combination of 4g Pfaffians. Here we prove this statement. ...
Anna Galluccio, Martin Loebl