179,816 research outputs found
Hadamard partitioned difference families and their descendants
If is a Hadamard difference set (HDS) in , then
is clearly a partitioned
difference family (PDF). Any -PDF will be said of Hadamard-type
if as the one above. We present a doubling construction which,
starting from any such PDF, leads to an infinite class of PDFs. As a special
consequence, we get a PDF in a group of order and three
block-sizes , and , whenever we have a
-HDS and the maximal prime power divisors of are
all greater than
Totally frustrated states in the chromatic theory of gain graphs
We generalize proper coloring of gain graphs to totally frustrated states,
where each vertex takes a value in a set of `qualities' or `spins' that is
permuted by the gain group. (An example is the Potts model.) The number of
totally frustrated states satisfies the usual deletion-contraction law but is
matroidal only for standard coloring, where the group action is trivial or
nearly regular. One can generalize chromatic polynomials by constructing spin
sets with repeated transitive components.Comment: 14 pages, 2 figure
Multiclass Total Variation Clustering
Ideas from the image processing literature have recently motivated a new set
of clustering algorithms that rely on the concept of total variation. While
these algorithms perform well for bi-partitioning tasks, their recursive
extensions yield unimpressive results for multiclass clustering tasks. This
paper presents a general framework for multiclass total variation clustering
that does not rely on recursion. The results greatly outperform previous total
variation algorithms and compare well with state-of-the-art NMF approaches
- …