Papers › Weighted theta functions for non-commutative graphs
Weighted theta functions for non-commutative graphs
Dan Stahlke
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Gr\"otschel, Lov\'asz, and Schrijver generalized the Lov\'asz ϑ function by allowing a weight for each vertex. We provide a similar generalization of Duan, Severini, and Winter's ϑ̃ on non-commutative graphs. While the classical theory involves a weight vector assigning a non-negative weight to each vertex, the non-commutative theory uses a positive semidefinite weight matrix. The classical theory is recovered in the case of diagonal weight matrices. Most of Gr\"otschel, Lov\'asz, and Schrijver's results generalize to non-commutative graphs. In particular, we generalize the inequality ϑ(G, w) ϑ(G, x) ≥⟨w, x ⟩ with some modification needed due to non-commutative graphs having a richer notion of complementation. Similar to the classical case, facets of the theta body correspond to cliques and if the theta body anti-blocker is finitely generated then it is equal to the non-commutative generalization of the clique polytope. We propose two definitions for non-commutative perfect graphs, equivalent for classical graphs but inequivalent for non-commutative graphs.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections