Sciweavers

1215 search results - page 100 / 243
» Combinatorics
Sort
View
COMBINATORICS
2002
109views more  COMBINATORICS 2002»
15 years 3 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
146
Voted
COMBINATORICS
1998
84views more  COMBINATORICS 1998»
15 years 3 months ago
Multimatroids II. Orthogonality, minors and connectivity
A multimatroid is a combinatorial structure that encompasses matroids, delta-matroids and isotropic systems. This structure has been introduced to unify a theorem of Edmonds on th...
André Bouchet
132
Voted
COMBINATORICS
1998
88views more  COMBINATORICS 1998»
15 years 3 months ago
Multi-statistic enumeration of two-stack sortable permutations
Using Zeilberger’s factorization of two-stack-sortable permutations, we write a functional equation — of a strange sort — that defines their generating function according t...
Mireille Bousquet-Mélou
COMBINATORICS
1998
42views more  COMBINATORICS 1998»
15 years 3 months ago
On Noncrossing and Nonnesting Partitions for Classical Reflection Groups
The number of noncrossing partitions of {1, 2, . . . , n} with fixed block sizes has a simple closed form, given by Kreweras, and coincides with the corresponding number for nonne...
Christos A. Athanasiadis
90
Voted
COMBINATORICS
1998
60views more  COMBINATORICS 1998»
15 years 3 months ago
Finite Vector Spaces and Certain Lattices
The Galois number Gn(q) is defined to be the number of subspaces of the n-dimensional vector space over the finite field GF(q). When q is prime, we prove that Gn(q) is equal to...
Thomas W. Cusick