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...
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....
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...
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...
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...