1215 search results - page 98 / 243 » Combinatorics |
108
Voted
COMBINATORICS
2000
15 years 3 months ago
2000
The known methods for constructing complete sets of mutually orthogonal frequency squares all yield one of two parameter sets. We show that almost all these constructions can be d...
109
click to vote
COMBINATORICS
2000
15 years 3 months ago
2000
: We prove two extensions of the Hales-Jewett coloring theorem. The first is a polynomial version of a finitary case of Furstenberg and Katznelson's multiparameter elaboration...
115
Voted
COMBINATORICS
2000
15 years 3 months ago
2000
A (multi)hypergraph H with vertices in N contains a permutation p = a1a2 . . . ak of 1, 2, . . . , k if one can reduce H by omitting vertices from the edges so that the resulting ...
107
Voted
COMBINATORICS
2000
15 years 3 months ago
2000
Bound polysemy is the property of any pair (G1, G2) of graphs on a shared vertex set V for which there exists a partial order on V such that any pair of vertices has an upper boun...
110
click to vote
COMBINATORICS
2002
15 years 3 months ago
2002
An efficient and purely combinatorial algorithm for calculating products in arbitrary Coxeter groups is presented, which combines ideas of Fokko du Cloux and myself. Proofs are lar...