where (x, g) denotes % evaluated at g. Each % thus yields a homomorphism of M(G) onto the complex numbers. Every such homomorphism of L(G) is obtained in this way. Let be a homomorphism of L{G) into M(H). After composing with <[>, every homomorphism of M(H) onto the complex numbers either is identically zero, or can be identified with a member of G. We thus have a map <£* from Ê into {G, 0 ...

For digraphs G and H , a homomorphism of G to H is a mapping f : V (G)→V (H) such that uv ∈ A(G) implies f(u)f(v) ∈ A(H). If, moreover, each vertex u ∈ V (G) is associated with costs ci(u), i ∈ V (H), then the cost of a homomorphism f is ∑ u∈V (G) cf(u)(u). For each fixed digraph H , the minimum cost homomorphism problem for H , denoted MinHOM(H), can be formulated as follows: Given an input di...

For digraphs D and H , a mapping f : V (D)→V (H) is a homomorphism of D to H if uv ∈ A(D) implies f(u)f(v) ∈ A(H). For a fixed digraph H , the homomorphism problem is to decide whether an input digraph D admits a homomorphism to H or not, and is denoted as HOM(H). An optimization version of the homomorphism problem was motivated by a realworld problem in defence logistics and was introduced in ...

We extend certain homomorphisms defined on the higher Torelli subgroups of the mapping class group to crossed homomorphisms defined on the entire mapping class group. In particular, for every k ≥ 2, we construct a crossed homomorphism ǫk which extends Morita’s homomorphism τ̃k to the entire mapping class group. From this crossed homomorphism we also obtain a crossed homomorphism extending the kt...

Using the continuous decomposition, we classify strongly free actions of discrete amenable groups on strongly amenable subfactors of type IIIλ, 0 < λ < 1. Winsløw’s fundamental homomorphism is a complete invariant. This removes the extra assumptions in the classification theorems of Loi and Winsløw and gives a complete classification up to cocycle conjugacy.

Minimum cost homomorphism problems can be viewed as a generalization of list homomorphism problems. They also extend two well-known graph colouring problems: the minimum colour sum problem and the optimum cost chromatic partition problem. In both of these problems, the cost function meets an additional constraint: the cost of using a specific colour is the same for every vertex of the input gra...