Semidefinite functions on categories (Q1028868)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5576461
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Semidefinite functions on categories |
scientific article; zbMATH DE number 5576461 |
Statements
Semidefinite functions on categories (English)
0 references
8 July 2009
0 references
Summary: Freedman, Lovász and Schrijver characterized graph parameters that can be represented as the (weighted) number of homomorphisms into a fixed graph. Several extensions of this result have been proved. We use the framework of categories to prove a general theorem of this kind. Similarly as previous resuts, the characterization uses certain infinite matrices, called connection matrices, which are required to be positive semidefinite.
0 references
connection matrices
0 references
0.8077791333198547
0 references
0.7872976660728455
0 references
0.7584543228149414
0 references
0.7412011027336121
0 references
0.7378271818161011
0 references
