365 search results - page 20 / 73 » On the combinatorics of Galois numbers |
COMBINATORICS
2006
14 years 12 months ago
2006
We introduce and characterise grid classes, which are natural generalisations of other well-studied permutation classes. This characterisation allows us to give a new, short proof...
COMBINATORICS
2004
14 years 11 months ago
2004
We consider Class-Uniformly Resolvable Group Divisible Designs (CURGDD), which are resolvable group divisible designs in which each of the resolution classes has the same number o...
COMBINATORICS
1998
14 years 11 months ago
1998
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...
ANTS
2006
Springer
15 years 3 months ago
2006
Springer
We provide a modular method for computing the splitting field Kf of an integral polynomial f by suitable use of the byproduct of computation of its Galois group Gf by p-adic Staudu...
COMBINATORICS
2007
14 years 12 months ago
2007
We investigate the notion of quantum chromatic number of a graph, which is the minimal number of colours necessary in a protocol in which two separated provers can convince a refe...