COMBINATORICS
2007
13 years 11 months ago
2007
COMBINATORICS
2007
13 years 11 months ago
2007
In the last decade there has been an ongoing interest in string comparison problems; to a large extend the interest was stimulated by genome rearrangement problems in computationa...
COMBINATORICS
2007
13 years 11 months ago
2007
We define a partial order on colored compositions with many properties analogous to Young’s lattice. We show that saturated chains correspond to colored permutations, and that ...
COMBINATORICS
2007
13 years 11 months ago
2007
COMBINATORICS
2007
13 years 11 months ago
2007
We refine previous results to provide examples, and in some cases precise classifications, of extremal subsets of {1, ..., n} containing no solutions to a wide class of non-inva...
COMBINATORICS
2007
13 years 11 months ago
2007
This work introduces the technique of using a carefully chosen determining set to prove the existence of a distinguishing labeling using few labels. A graph G is said to be d-dist...
COMBINATORICS
2007
13 years 11 months ago
2007
In this note we present a short proof of the following result, which is a slight extension of a nice 2005 theorem by Kano and Yu. Let e be an edge of an rregular graph G. If G has...
COMBINATORICS
2007
13 years 11 months ago
2007
The unitary Cayley graph Xn has vertex set Zn = {0, 1, . . . , n−1}. Vertices a, b
COMBINATORICS
2007
13 years 11 months ago
2007
We study the structure of a minimum dominating set of Cn 2n+1, the Cartesian product of n copies of the cycle of size 2n + 1, where 2n + 1 is a prime.
COMBINATORICS
2007
13 years 11 months ago
2007
There are many applications of the enumeration of maps in surfaces to other areas of mathematics and the physical sciences. In particular, in quantum field theory and string theo...