| Title | Graph invariants in the spin model |
|---|---|
| Published in | Journal of Combinatorial Theory Series B, Vol. 99, No. 2, p.502-511. ISSN 00958956. |
| Author | Schrijver, A. |
| Date | 2009 |
| Type | article |
| Abstract | Given a symmetric n x n matrix A, we define, for any graph G, f(A)(G) := Sigma(phi:VG ->[1,...,n]) Pi(uv is an element of EG) a(phi(u),phi(v).) We characterize for which graph parameters f there is a complex matrix A with f = f(A), and similarly for real A. We show that f(A) uniquely determines A, up to permuting rows and (simultaneously) columns. The proofs are based on the Nullstellensatz and some elementary invariant-theoretic techniques. |
| Publication | http://dare.uva.nl/record/328543 |
| OpenURL | Search this publication in (your) library |
| Persistent Identifier | urn:nbn:nl:ui:29-328543 |
| Metadata | XML |
| Repository | University of Amsterdam |
Go to page top
Go back to contents
Go back to site navigation