edge-connection rank 1graph parameters 1mixed partition functions 1super vector spaces 1tensor categories 1
From the 1 of 2 linked papers with an AI index.
2 papers
math.CO2026
Mixed partition functions are exactly the graph parameters of exponentially bounded edge-connection rank
William Whistler
The paper proves that a complex‑valued graph parameter has exponentially bounded edge‑connection rank exactly when it can be expressed as a mixed partition function, and it builds…
math.CO2026
Counting spanning quasi-trees of ribbon graphs: determinants and #P-completeness
William Whistler
A quasi-tree of a connected ribbon graph is a spanning ribbon subgraph with exactly one boundary component; quasi-trees play the role of spanning trees in the topological graph the…