365 search results - page 16 / 73 » On the combinatorics of Galois numbers |
82
Voted
COMBINATORICS
1998
14 years 11 months ago
1998
New lower bounds for 15 classical Ramsey numbers are established. Several of the colorings are found using a new variation of local search heuristics. Several others are found usi...
110
click to vote
COMBINATORICS
1999
14 years 11 months ago
1999
We find, in the form of a continued fraction, the generating function for the number of (132)-avoiding permutations that have a given number of (123) patterns, and show how to ext...
117
click to vote
MOC
2011
14 years 6 months ago
2011
Let K be an imaginary quadratic field with class number one and let p ⊂ OK be a degree one prime ideal of norm p not dividing 6dK . In this paper we generalize an algorithm of S...
107
click to vote
CHES
2007
Springer
15 years 6 months ago
2007
Springer
It is shown that the amount of true randomness produced by the recently introduced Galois and Fibonacci ring oscillators can be evaluated experimentally by restarting the oscillato...
COMBINATORICS
2006
14 years 12 months ago
2006
A set M of edges of a graph G is a matching if no two edges in M are incident to the same vertex. The matching number of G is the maximum cardinality of a matching of G. A set S o...