7796 search results - page 21 / 1560 » On Generalized Schur Numbers |
101
click to vote
STOC
2005
ACM
16 years 1 months ago
2005
ACM
We present a quantum algorithm for the computation of the irrational period lattice of a function on Zn which is periodic in a relaxed sense. This algorithm is applied to compute t...
113
Voted
JCT
2006
15 years 21 days ago
2006
Eroh and Oellermann defined BRR(G1, G2) as the smallest N such that any edge coloring of the complete bipartite graph KN,N contains either a monochromatic G1 or a multicolored G2....
84
Voted
COMBINATORICS
2000
15 years 17 days ago
2000
Abstract. We introduce color-signed permutations to obtain a very explicit combinatorial interpretation of the q-Eulerian identities of Brenti and some generalizations. In particul...
118
Voted
COMBINATORICS
2004
15 years 18 days ago
2004
In 1958, Richard Guy proved that the number of partitions of n into odd parts greater than one equals the number of partitions of n into distinct parts with no powers of 2 allowed...
129
click to vote
CORR
2010
Springer
15 years 25 days ago
2010
Springer
The oriented chromatic number of an oriented graph G is the minimum order of an oriented graph H such that G admits a homomorphism to H. The oriented chromatic number of an undire...