The rank of connection matrices and the dimension of graph algebras
| dc.creator | Lovasz, Laszlo | |
| dc.date | 2004-08-18 | |
| dc.date.accessioned | 2026-07-07T05:11:20Z | |
| dc.date.available | 2026-07-07T05:11:20Z | |
| dc.description | Connection matrices were introduced by Freedman, Lovasz and Schrijver [1], who used them to characterize graph homomorphism functions. The goal of this note is to determine the exact rank of these matrices. The result can be rephrased in terms of graph algebras (also introduced in [1]. Yet another version proves that if two k-tuples of nodes behave the same way from the point of view of graph homomorphisms, then they are equivalent under the automorphism group. | |
| dc.description | 12 pages | |
| dc.identifier | https://arxiv.org/abs/math/0408232 | |
| dc.identifier | http://arxiv.org/abs/math/0408232 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/72207 | |
| dc.subject | Combinatorics | |
| dc.subject | 05C99 | |
| dc.title | The rank of connection matrices and the dimension of graph algebras | |
| dc.type | text |