## Are you sure?

This action might not be possible to undo. Are you sure you want to continue?

L

´

aszl

´

o Lov

´

asz and Alexander Schrijver

June 1, 2008

1 Introduction

In this paper, the graphs we consider are ﬁnite, undirected and have no

parallel edges, but they may have loops. A graph parameter is a real valued

function deﬁned on graphs, invariant under isomorphisms.

For two graphs F and G, let hom(F, G) denote the number of homomor-

phisms F → G, that is, adjacency preserving maps V (F) → V (G). The

deﬁnition can be extended to weighted graphs (when the nodes and edges

of G have real weights). In [1] graph parameters of the form hom(, G) were

characterized, where G is a weighted graph. Several variants of this result

have been obtained, characterizing graph parameters hom(, G) where all

nodeweights of G are 1 [3], such graph parameters deﬁned on multigraphs [2]

etc. These characterizations involve certain inﬁnite matrices, called connec-

tion matrices, which are required to be positive semideﬁnite and to satisfy a

condition on their rank.

The goal of this paper is to study the dual question, and characterize

graph parameters of the form hom(F, ), where F is an (unweighted) graph.

It turns out that reversing the arrows in the category of graphs gives the right

hints for the condition, and the characterization involves the dually deﬁned

connection matrices.

For two graphs G and H, the product G H is the graph with node

set V (G) V (H), two nodes (u, v) and (u

′

, v

′

) being adjacent if and only if

uu

′

∈ E(G) and vv

′

∈ E(H). Then

hom(F, GH) = hom(F, G)hom(F, H). (1)

An S-colored graph is a pair (G, φ), where G is a graph and φ : V (G) →

1

S, where S is a ﬁnite set. We call (G, φ) colored if it is S-colored for some S.

We call φ(v) the color of v.

The product (G, φ) (H, ψ) of two colored graphs is the colored graph

(J, ϑ), where J is the subgraph of G H induced by the set of nodes (u, v)

with φ(u) = ψ(v), and where ϑ(u, v) := φ(u) (= ψ(v)).

For two colored graphs (F, φ) and (G, ψ), a homomorphism h : V (F) →

V (G) is color-preserving if φ = ψh. Let hom

c

((F, φ), (G, ψ)) denote the

number of color-preserving homomorphisms F → G.

It is easy to see that for any three colored graphs F, G and H,

hom

c

(F, GH) = hom

c

(F, G)hom

c

(F, H). (2)

(Equation (1) is the special case where all nodes have color 1.) Moreover, if

both G and H are S-colored, then for any uncolored graph F,

hom(F, GH) =

φ: V (F)→S

hom

c

((F, φ), G)hom

c

((F, φ), H). (3)

Here hom(F, (G, φ)) := hom(F, G) for any colored graph (G, φ). More gen-

erally, we extend any graph parameter f to colored graphs by deﬁning

f(G, φ) := f(G) for any colored graph (G, φ).

For every graph parameter f and k ≥ 1, we deﬁne an (inﬁnite) matrix

N(f, k) as follows. The rows and columns are indexed by [k]-colored graphs

(where [k] = ¦1, . . . , k¦), and the entry in row G and column H (where G

and H are [k]-colored graphs) is f(GH).

Equation (3) implies that for any graph F and any k ≥ 1, the matrix

N(f, k) belonging to f = hom(F, ) is positive semideﬁnite and has rank at

most [S[

|V (F)|

. Trivially, it satisﬁes f(

¯

K

1

) = hom(F,

¯

K

1

) = 1 (where

¯

K

1

is a single node with a loop). The main result of this paper is that these

properties characterize such graph parameters:

Theorem 1 Let f be a graph parameter and n ≥ 1. Then f = hom(F, ) for

some graph F with at most n nodes if and only if f(

¯

K

1

) = 1, and for each

k ≥ 1, the matrix N(f, k) is positive semideﬁnite and has rank at most k

n

.

The proof will require a development of an algebraic machinery, similar

to the one used in [1] (but the details are diﬀerent). It is important to realize

that the conditions imply that

f(GH) = f(G)f(H) (4)

2

for any uncolored graphs G and H, since N(f, 1) is positive semideﬁnite and

has rank at most 1, and since f(

¯

K

1

) = 1.

2 The algebras / and /

S

The colored graphs form a semigroup under multiplication . Let ( denote

its semigroup algebra (the elements of ( are formal linear combinations of

colored graphs with real coeﬃcients, also called quantum colored graphs). Let

(

S

denote the semigroup algebra of the semigroup of S-colored graphs. For

each S, the complete graphs

¯

K

S

on S (with a loop at each node) is the unit

element of (

S

.

By the positive semideﬁniteness of N(f, k), the function

¸G, H) := f(GH)

deﬁnes a semideﬁnite (but not necessarily deﬁnite) inner product on (. The

set

I := ¦g ∈ ( [ ¸g, g) = 0¦ = ¦g ∈ ( [ ¸g, x) = 0 for all x ∈ (¦

is an ideal in (, and hence the quotient / = (/I is a commutative algebra

with (deﬁnite) inner product. We denote multiplication in / by concatena-

tion.

It is easy to check that

I ∩ (

S

= ¦g ∈ (

S

[ ¸g, x) = 0 for all x ∈ (

S

¦

is an ideal in (

S

, and hence the quotient /

S

= (

S

/(I ∩(

S

) is also a commu-

tative algebra with a (deﬁnite) inner product. This algebra can be identiﬁed

with (

S

/I in a natural way. The dimension of /

S

is equal to the rank of the

matrix N(f, [S[), hence it is at most [S[

n

(in particular, ﬁnite).

Note that 1

S

=

¯

K

S

+ I is the unit element of /

S

and that /

S

is an

ideal in /. Moreover, /

S

⊆ /

T

if S ⊆ T. In fact, the stronger relation

/

S

∩ /

T

= /

S

/

T

= /

S∩T

holds. To see this, we show that

/

S

∩ /

T

⊆ /

S

/

T

⊆ /

S∩T

⊆ /

S

∩ /

T

.

Indeed, if x ∈ /

S

∩ /

T

then x = x1

T

∈ /

S

/

T

, which proves the ﬁrst

inclusion. If g ∈ (

S

and h ∈ (

T

, then (g +I)(h+I) = gh+I ∈ /

S∩T

, which

proves the second. The third inclusion is trivial.

3

As the inner product ¸, ) satisﬁes ¸xy, z) = ¸x, yz) for all x, y, z ∈ /

S

,

/

S

has a unique orthogonal basis /

S

consisting of idempotents, called the

basic idempotents of /

S

. Every idempotent in /

S

is the sum of a subset of

/

S

, and in particular

1

S

=

p∈M

S

p. (5)

For every nonzero idempotent p we have f(p) > 0, as f(p) = f(p

2

) = ¸p, p) >

0.

3 Maps between diﬀerent /

S

Let S and T be ﬁnite subsets of Z, and let α : S → T. We deﬁne a linear

function ˇ α : (

S

→ (

T

by

ˇ α(G, φ) := (G, αφ)

for any S-colored graph (G, φ). We deﬁne another linear map ˆ α : (

T

→ (

S

as follows. Let (G, φ) be a T-colored graph. For any node v of G, split v into

[α

−1

(φ(v))[ copies, adjacent to any copy of any neighbour of v in G. Give

these copies of v distinct colors from α

−1

(φ(v)), to get the colored graph

ˆ α(G, φ).

It is easy to see that the map ˆ α is an algebra homomorphism, while the

map ˇ α is not an algebra homomorphism in general. On the other hand, ˇ α is

an isomorphism of the underlying uncolored graphs, but in general ˆ α is not.

For any T-colored graph G and any S-colored graph H, we have

ˇ α(ˆ α(G) H) = G ˇ α(H),

which implies that the underlying uncolored graphs of ˆ α(G) H and G

ˇ α(H) are the same. Then g ∈ I implies ˇ α(g) ∈ I for any g ∈ (

S

, since

¸ˇ α(g), ˇ α(g)) = ¸g, ˆ αˇ α(g)) = 0. Hence ˇ α quotients to a linear function /

S

→

/

T

. Similarly, g ∈ I implies ˆ α(g) ∈ I for any g ∈ (

T

, hence ˆ α quotients to

an algebra homomorphism /

T

→ /

S

. We abuse notation and denote these

induced maps also by ˇ α and ˆ α.

Then

ˇ α(ˆ α(x)y) = xˇ α(y) (6)

and hence

¸ˆ α(x), y) = ¸x, ˇ α(y)) (7)

4

for all x ∈ /

T

and y ∈ /

S

.

It is easy to see that if α : S → T is surjective, then ˇ α : (

S

→ (

T

is

surjective and so is the map /

S

→ /

T

it induces. On the other hand, if

again α : S → T is surjective, then ˆ α : (

T

→ (

S

is injective, and so is the

map /

T

→ /

S

it induces.

Since ˆ α is an algebra homomorphism, ˆ α(p) is an idempotent in /

S

for

any idempotent p ∈ /

T

, and ˆ α(1

T

) = 1

S

. So (5) implies that

p∈M

T

ˆ α(p) = ˆ α(1

T

) = 1

S

=

q∈M

S

q. (8)

Deﬁne for any p ∈ /

T

and α : S → T:

/

α,p

:= ¦q ∈ /

S

[ ˆ α(p)q = q¦.

By (8),

ˆ α(p) =

q∈Mα,p

q. (9)

This implies that if α is surjective, then /

α,p

,= ∅.

Proposition 2 Let p ∈ /

T

, α : S → T, and q ∈ /

α,p

. Then

ˇ α(q) =

f(q)

f(p)

p.

Proof. If p

′

∈ /

T

¸ ¦p¦, then

¸ˇ α(q), p

′

) = ¸q, ˆ α(p

′

)) = 0 = ¸

f(q)

f(p)

p, p

′

),

since ¸p, p

′

) = 0. Moreover,

¸ˇ α(q), p) = ¸q, ˆ α(p)) = f(ˆ α(p)q) = f(q) = ¸

f(q)

f(p)

p, p),

since ¸p, p) = f(p).

5

4 Maximal basic idempotents

For each x ∈ /, let C(x) be the minimal set S of colors for which x ∈ /

S

.

This is well deﬁned because /

S

∩ /

T

= /

S∩T

.

Proposition 3 [C(p)[ ≤ n for each basic idempotent p.

Proof. Suppose [C(p)[ > n. Let S := C(p). Then any /

T

has at least

|T|

|S|

**basic idempotents, since for each subset S
**

′

of T of size [S[ we can choose a

bijection α : S → S

′

. Then ˇ α(p) belongs to /

T

, and they are all distinct.

So dim(/

T

) ≥

|T|

|S|

**. As [S[ > n, the latter value is larger than [T[
**

n

if [T[

is large enough. This contradicts our rank assumption.

This proposition implies that we can choose an idempotent p with [C(p)[

maximal, which we ﬁx from now on. Deﬁne S := C(p).

Proposition 4 Let α : T → S be surjective. Then

ˆ α(p) =

β: S→T

αβ=id

S

ˇ

β(p).

Note that the maps β in the summation are necessarily injections.

Proof. Consider any q ∈ /

α,p

. By Proposition 2, ˇ α(q) is a nonzero multiple

of p. This implies C(p) = C(ˇ α(q)) ⊆ α(C(q)). So [C(q)[ ≥ [C(p)[, hence by

the maximality of [C(p)[, [C(q)[ = [C(p)[. So α[

C(q)

is a bijection between

C(q) and C(p). Setting β = (α[

C(q)

)

−1

, we get q =

ˇ

β(p). By symmetry,

ˇ

φ(p)

occurs in the sum (1) for every injective φ : S → T such that αφ = id

S

.

Proposition 5 For any ﬁnite set T,

α: S→T

ˇ α(p) = f(p)1

T

. (10)

Proof. Let σ and τ be the projections of S T on S and on T, respectively.

Then for any S-colored graph G and any T-colored graph H one has that

ˆ σ(G) ˆ τ(H) is, as uncolored graph, equal to the product of the underlying

uncolored graphs of G and H. Hence, with (4),

f(ˆ σ(G) ˆ τ(H)) = f(G)f(H). (11)

6

Now for each α : S → T, there is a unique β : S → S T with σβ = id

S

and τβ = α. Hence, with Proposition 4,

α: S→T

ˇ α(p) =

β: S→S×T

σβ=id

S

ˇ τ

ˇ

β(p) = ˇ τ

β: S→S×T

σβ=id

S

ˇ

β(p) = ˇ τ ˆ σ(p).

So for any x ∈ /

T

, with (7) and (11),

¸ˇ τ ˆ σ(p), x) = ¸ˆ σ(p), ˆ τ(x)) = f(ˆ σ(p)ˆ τ(x)) = f(p)f(x) = ¸f(p)1

T

, x).

This implies that ˇ τ ˆ σ(p) = f(p)1

T

.

Remark 6 While it follows from the theorem, it may be worthwhile to point

out that the maximal basic idempotent p is unique up to renaming the col-

ors, and all other basic idempotents arise from it by merging and renaming

colors. Indeed, we know by Proposition 2 that every term in (10) is a posi-

tive multiple of a basic idempotent in /

T

, and so it follows that every basic

idempotent in /

T

is a positive multiple of ˇ α(p) for an appropriate map α.

In particular, if p

′

is another basic idempotent with [C(p

′

)[ = [C(p)[, then it

follows that p

′

= ˇ α(p) for some bijective map α : C(p) → C(p

′

).

5 M¨obius transforms

For any colored graph H, deﬁne the quantum graph µ(H) (the M¨obius trans-

form) by

µ(H) :=

Y ⊆E(H)

(−1)

|Y |

(H −Y ).

We call a colored graph G ﬂat, if V (G) = T, and the color of node t is t.

For any T-cololored graph G and any ﬁnite set S, deﬁne

λ

S

(G) :=

α:S→T

ˆ α(G).

Proposition 7 Let F and G be ﬂat colored graphs, and S := V (F), T :=

V (G). Then

λ

S

(G) µ(F) = hom(F, G)µ(F). (12)

7

Proof. Consider any map α : S → T. If α is a homomorphism F → G,

then ˆ α(G) µ(F) is equal to µ(F). If α is not a homomorphism F → G,

then ˆ α(G) µ(F) = 0, since F contains edges that are not represented in

ˆ α(G) F.

6 Completing the proof

Since

K

S

=

F

µ(F), where F ranges over all ﬂat S-colored graphs, and

since

K

S

p = p, there exists a ﬂat S-colored graph F with µ(F)p ,= 0. As

p is a basic idempotent, µ(F)p = γp for some real γ ,= 0. We prove that

f = hom(F, ).

Choose a ﬂat T-colored graph G. As p is in the ideal generated by µ(F),

(12) gives λ

S

(G)p = hom(F, G)p. Then by (10) and (7):

f(p)f(G) = f(p)¸G, 1

T

) =

α: S→T

¸G, ˇ α(p)) =

α: S→T

¸ˆ α(G), p)

= ¸λ

S

(G), p) = f(λ

S

(G)p) = hom(F, G)f(p).

Since f(p) ,= 0, this gives f = hom(F, ).

7 Concluding remarks

For a ﬁxed ﬁnite set S of colors, colored graphs can be thought of as arrows

G →

¯

K

S

in the category of graph homomorphisms. The product of two

colored graphs is pullback of the corresponding pair of maps. The setup in

[1, 3] can be described by reversing the arrows. This raises the possibility

that there is a common generalization in terms of categories.

The methods from [1] have been applied in extremal graph theory and

elsewhere. Are there similar applications of the methods used in this paper?

If we relax the rank condition from k

n

to just polynomial in k, we obtain

a characterization of the convex hull of the functions hom(F, ).

References

[1] M. Freedman, L. Lov´asz, A. Schrijver: Reﬂection positivity, rank con-

nectivity, and homomorphisms of graphs, J. Amer. Math. Soc. 20

(2007), 37–51.

8

[2] L. Lov´asz and B. Szegedy: The moment problem for 2-variable

functions and reﬂection positive graph parameters (manuscript)

http://www.cs.elte.hu/

~

lovasz/moment.pdf

[3] A. Schrijver, Graph invariants in the spin model,

http://homepages.cwi.nl/

~

lex/files/grvm.pdf

9

K1 ) = 1 (where K1 is a single node with a loop).S. ·) is positive semideﬁnite and has rank at ¯ ¯ ¯ most |S||V (F )| . The product (G. k) belonging to f = hom(F. we extend any graph parameter f to colored graphs by deﬁning f (G. where J is the subgraph of G × H induced by the set of nodes (u. φ) and (G. We call (G. (G. G) for any colored graph (G. then for any uncolored graph F . φ). G and H. φ). φ)) := hom(F. G × H) = φ: V (F )→S homc ((F. and for each k ≥ 1. Let homc ((F. hom(F. φ) × (H. ψ) of two colored graphs is the colored graph (J. . H). G)homc ((F. ψ)) denote the number of color-preserving homomorphisms F → G. Equation (3) implies that for any graph F and any k ≥ 1. v) with φ(u) = ψ(v). and where ϑ(u. . ψ).) Moreover. It is important to realize that the conditions imply that f (G × H) = f (G)f (H) 2 (4) . Trivially. G)homc (F. . and the entry in row G and column H (where G and H are [k]-colored graphs) is f (G × H). ϑ). φ). the matrix N(f. The main result of this paper is that these properties characterize such graph parameters: Theorem 1 Let f be a graph parameter and n ≥ 1. Then f = hom(F. k}). φ) colored if it is S-colored for some S. v) := φ(u) (= ψ(v)). The rows and columns are indexed by [k]-colored graphs (where [k] = {1. φ). it satisﬁes f (K1 ) = hom(F. if both G and H are S-colored. For every graph parameter f and k ≥ 1. a homomorphism h : V (F ) → V (G) is color-preserving if φ = ψh. The proof will require a development of an algebraic machinery. We call φ(v) the color of v. where S is a ﬁnite set. homc (F. φ) := f (G) for any colored graph (G. (3) Here hom(F. (2) (Equation (1) is the special case where all nodes have color 1. For two colored graphs (F. we deﬁne an (inﬁnite) matrix N(f. ·) for ¯ some graph F with at most n nodes if and only if f (K1 ) = 1. It is easy to see that for any three colored graphs F . similar to the one used in [1] (but the details are diﬀerent). the matrix N(f. (G. . k) is positive semideﬁnite and has rank at most k n . H). More generally. k) as follows. φ). G × H) = homc (F.

we show that AS ∩ AT ⊆ AS AT ⊆ AS∩T ⊆ AS ∩ AT . Indeed. ﬁnite). The third inclusion is trivial. which proves the ﬁrst inclusion. The dimension of AS is equal to the rank of the matrix N(f. Let G denote its semigroup algebra (the elements of G are formal linear combinations of colored graphs with real coeﬃcients. 1) is positive semideﬁnite and ¯ has rank at most 1. x = 0 for all x ∈ GS } is an ideal in GS . ¯ Note that 1S = KS + I is the unit element of AS and that AS is an ideal in A. In fact. since N(f. k). the complete graphs KS on S (with a loop at each node) is the unit element of GS . To see this. Moreover. if x ∈ AS ∩ AT then x = x1T ∈ AS AT . 2 The algebras A and AS The colored graphs form a semigroup under multiplication ×. and hence the quotient A = G/I is a commutative algebra with (deﬁnite) inner product. H := f (G × H) deﬁnes a semideﬁnite (but not necessarily deﬁnite) inner product on G. and since f (K1 ) = 1. and hence the quotient AS = GS /(I ∩ GS ) is also a commutative algebra with a (deﬁnite) inner product. 3 . By the positive semideﬁniteness of N(f. Let GS denote the semigroup algebra of the semigroup of S-colored graphs. then (g + I)(h + I) = gh + I ∈ AS∩T . x = 0 for all x ∈ G} is an ideal in G.for any uncolored graphs G and H. It is easy to check that I ∩ GS = {g ∈ GS | g. the function G. This algebra can be identiﬁed with GS /I in a natural way. hence it is at most |S|n (in particular. the stronger relation AS ∩ AT = AS AT = AS∩T holds. We denote multiplication in A by concatenation. AS ⊆ AT if S ⊆ T . For ¯ each S. also called quantum colored graphs). If g ∈ GS and h ∈ GT . which proves the second. |S|). g = 0} = {g ∈ G | g. The set I := {g ∈ G | g.

adjacent to any copy of any neighbour of v in G. z = x. · satisﬁes xy. AS has a unique orthogonal basis MS consisting of idempotents. g ∈ I implies α(g) ∈ I for any g ∈ GT . Every idempotent in AS is the sum of a subset of MS . z ∈ AS . We deﬁne another linear map α : GT → GS ˆ as follows. We deﬁne a linear function α : GS → GT by ˇ α(G. φ) := (G. we have α(α(G) × H) = G × α(H). hence α quotients to ˆ ˆ an algebra homomorphism AT → AS . yz for all x. Then g ∈ I implies α(g) ∈ I for any g ∈ GS . 3 Maps between diﬀerent AS Let S and T be ﬁnite subsets of Z. αα(g) = 0. ˇ ˆ ˇ which implies that the underlying uncolored graphs of α(G) × H and G × ˆ α(H) are the same. to get the colored graph α(G. φ). αφ) ˇ for any S-colored graph (G. ˇ ˆ Then α(α(x)y) = xˇ ˇ ˆ α(y) (6) and hence α(x). split v into |α−1(φ(v))| copies. Let (G. but in general α is not. while the ˆ map α is not an algebra homomorphism in general. since ˇ ˇ α(g). (5) 1S = p∈MS For every nonzero idempotent p we have f (p) > 0. φ). For any node v of G. called the basic idempotents of AS . and in particular p. as f (p) = f (p2 ) = p. Give these copies of v distinct colors from α−1 (φ(v)).As the inner product ·. On the other hand. p > 0. ˆ For any T -colored graph G and any S-colored graph H. α is ˇ ˇ an isomorphism of the underlying uncolored graphs. y. α(y) ˆ ˇ 4 (7) . α(g) = g. φ) be a T -colored graph. y = x. and let α : S → T . Similarly. ˆ It is easy to see that the map α is an algebra homomorphism. Hence α quotients to a linear function AS → ˇ ˇ ˆˇ ˇ AT . We abuse notation and denote these induced maps also by α and α.

if again α : S → T is surjective. So (5) implies that ˆ α(p) = α(1T ) = 1S = ˆ ˆ p∈MT q∈MS q. p = q. Then α(q) = ˇ Proof. then α(q). If p′ ∈ MT \ {p}. (9) This implies that if α is surjective. On the other hand.p = ∅. f (p) f (q) p. p′ = 0. and so is the ˆ map AT → AS it induces. It is easy to see that if α : S → T is surjective. α(p′ ) = 0 = ˇ ˆ since p. and α(1T ) = 1S . f (q) p. p′ = q. then α : GS → GT is ˇ surjective and so is the map AS → AT it induces. then α : GT → GS is injective. f (p) f (q) p. p = f (p).p := {q ∈ MS | α(p)q = q}. α(q).p . f (p) 5 . α(p) is an idempotent in AS for ˆ ˆ any idempotent p ∈ AT .for all x ∈ AT and y ∈ AS . Moreover. and q ∈ Mα. p . α : S → T . Since α is an algebra homomorphism. then Mα. p′ . α(p) = ˆ q∈Mα. ˆ By (8). (8) Deﬁne for any p ∈ MT and α : S → T : Mα. Proposition 2 Let p ∈ MT .p q. α(p) = f (α(p)q) = f (q) = ˇ ˆ ˆ since p.

Setting β = (α|C(q) )−1 . Hence. So |C(q)| ≥ |C(p)|. This proposition implies that we can choose an idempotent p with |C(p)| maximal. ˇ α: S→T (10) Proof. with (4). Proof.4 Maximal basic idempotents For each x ∈ A. f (ˆ (G) × τ (H)) = f (G)f (H).p . respectively. Proof. |C(q)| = |C(p)|. Let S := C(p). α(q) is a nonzero multiple ˇ of p. Proposition 4 Let α : T → S be surjective. Proposition 5 For any ﬁnite set T . By Proposition 2. Consider any q ∈ Mα. φ(p) occurs in the sum (1) for every injective φ : S → T such that αφ = idS . ˇ So dim(AT ) ≥ |T | . Note that the maps β in the summation are necessarily injections. and they are all distinct. So α|C(q) is a bijection between ˇ ˇ C(q) and C(p). This implies C(p) = C(α(q)) ⊆ α(C(q)). α(p) = f (p)1T . By symmetry. the latter value is larger than |T |n if |T | |S| is large enough. Let σ and τ be the projections of S × T on S and on T . This is well deﬁned because AS ∩ AT = AS∩T . As |S| > n. hence by ˇ the maximality of |C(p)|. equal to the product of the underlying ˆ ˆ uncolored graphs of G and H. Then α(p) belongs to AT . let C(x) be the minimal set S of colors for which x ∈ AS . Then α(p) = ˆ β: S→T αβ=idS ˇ β(p). σ ˆ 6 (11) . Then for any S-colored graph G and any T -colored graph H one has that σ (G) × τ (H) is. which we ﬁx from now on. Then any AT has at least |T | |S| basic idempotents. we get q = β(p). as uncolored graph. Proposition 3 |C(p)| ≤ n for each basic idempotent p. This contradicts our rank assumption. since for each subset S ′ of T of size |S| we can choose a bijection α : S → S ′ . Deﬁne S := C(p). Suppose |C(p)| > n.

with (7) and (11). and all other basic idempotents arise from it by merging and renaming colors.Now for each α : S → T . x = σ(p). and S := V (F ). and the color of node t is t. if p′ is another basic idempotent with |C(p′ )| = |C(p)|. τ (x) = f (ˆ (p)ˆ(x)) = f (p)f (x) = f (p)1T . x . α(p) = ˇ α: S→T β: S→S×T σβ=idS τ β(p) = τ ˇˇ ˇ β: S→S×T σβ=idS ˇ β(p) = τ σ (p). ˇˆ Remark 6 While it follows from the theorem. ˇ In particular. ˇˆ So for any x ∈ AT . then it follows that p′ = α(p) for some bijective map α : C(p) → C(p′ ). Hence. deﬁne the quantum graph µ(H) (the M¨bius transo form) by µ(H) := (−1)|Y | (H − Y ). and so it follows that every basic idempotent in AT is a positive multiple of α(p) for an appropriate map α. with Proposition 4. there is a unique β : S → S × T with σβ = idS and τ β = α. Y ⊆E(H) We call a colored graph G ﬂat. τ σ (p). ˇˆ ˆ ˆ σ τ This implies that τ σ (p) = f (p)1T . if V (G) = T . For any T -cololored graph G and any ﬁnite set S. deﬁne λS (G) := α:S→T α(G). T := V (G). G)µ(F ). (12) 7 . Then λS (G) × µ(F ) = hom(F. it may be worthwhile to point out that the maximal basic idempotent p is unique up to renaming the colors. ˆ Proposition 7 Let F and G be ﬂat colored graphs. ˇ 5 M¨bius transforms o For any colored graph H. Indeed. we know by Proposition 2 that every term in (10) is a positive multiple of a basic idempotent in AT .

(12) gives λS (G)p = hom(F. 3] can be described by reversing the arrows. This raises the possibility that there is a common generalization in terms of categories. J. If α is not a homomorphism F → G. then α(G) × µ(F ) is equal to µ(F ). Soc. 20 (2007). A. since F contains edges that are not represented in ˆ α(G) × F . Are there similar applications of the methods used in this paper? If we relax the rank condition from k n to just polynomial in k. µ(F )p = γp for some real γ = 0. References [1] M. p = f (λS (G)p) = hom(F. we obtain a characterization of the convex hull of the functions hom(F. there exists a ﬂat S-colored graph F with µ(F )p = 0. α(p) = ˇ α: S→T α(G). ·). 7 Concluding remarks For a ﬁxed ﬁnite set S of colors. ˆ 6 Completing the proof Since KS = F µ(F ). 8 . 37–51. where F ranges over all ﬂat S-colored graphs. Schrijver: Reﬂection positivity. and since KS p = p. and homomorphisms of graphs. ˆ then α(G) × µ(F ) = 0. L. Lov´sz. colored graphs can be thought of as arrows ¯ G → KS in the category of graph homomorphisms. G)f (p). Consider any map α : S → T . As p is a basic idempotent. 1T = α: S→T G. p ˆ = λS (G). this gives f = hom(F. Amer. rank cona nectivity. ·).Proof. If α is a homomorphism F → G. The setup in [1. Choose a ﬂat T -colored graph G. The product of two colored graphs is pullback of the corresponding pair of maps. Freedman. Then by (10) and (7): f (p)f (G) = f (p) G. Since f (p) = 0. G)p. ·). Math. As p is in the ideal generated by µ(F ). We prove that f = hom(F. The methods from [1] have been applied in extremal graph theory and elsewhere.

pdf [3] A.cs.elte. Lov´sz and B.cwi. Szegedy: The moment problem for 2-variable a functions and reﬂection positive graph parameters (manuscript) http://www.hu/~ lovasz/moment. Graph invariants in the spin model. Schrijver. http://homepages.pdf 9 .nl/~ lex/files/grvm.[2] L.

- Graphs Algorithms Optimizationuploaded byYoussefi Abdelkader
- HW Set3 Gentry_graded (2)uploaded bySakshi Singhania
- ch4.pdfuploaded byKishan Kumar
- Solution Determinantsuploaded byJeffrey Melchor
- 2.IJMCAROCT20172uploaded byTJPRC Publications
- 6th grade math- section 1uploaded byapi-302577842
- 9. Maths - IJMCAR - Group Automorphism Structures of Some Graphuploaded byTJPRC Publications
- Dat Astruc tuploaded byChayne Rodil
- Dehmerovanje 6uploaded bydragance106
- 23 DynDet (AIRO2004)uploaded byguido gentile
- V69-No7-05uploaded bydragance106
- Shifting of Graphsuploaded byTariq Sultan
- Domination Nulluploaded byprabhamaths
- Vertex Magic Total Labelings of 2-Regular Graphsuploaded byDaniel Doankk
- dsgt_2006uploaded byandhracolleges
- SDDEuploaded byddedoccom
- College Algebra Final Reviewuploaded byzahed83
- Tut+1+-+Soluploaded byhoangduc007
- 2009SeniorQuizSolnuploaded bySerey Keo
- Smarandache sums of productsuploaded byRyanElias
- ACM ICPC Amritapuri 2014uploaded byPulkit Aggarwal
- 1.Whole-Number--pg-1---44-uploaded bySuzana Muhammad
- Recreational Mathematics in Ancient Egyptuploaded bysteve_pillman
- hw11sol.pdfuploaded bysbfjbsjkbf
- serbiamontenegroMO_1998uploaded bydhrubajyoti ghosh
- z5uploaded byGraciele Maeoka
- padlet - ccmmslions 6thperiod m7plusuploaded byapi-234347533
- Lecture 27(Dijkstra,Huffmancoding)uploaded byavinash
- Practice Paper A1 MS - C1 Edexceluploaded byAusten Michaelle
- phd-vida-SSuploaded byapi-3733260

Close Dialog## Are you sure?

This action might not be possible to undo. Are you sure you want to continue?

Loading