3 problems
- 0 votes0 replies0 views
The q-deformed chromatic polynomial limit conjecture for graphical arrangements
Let be a graph, let be its -deformed graphical arrangement, let denote the characteristic polynomial of this arrangement, and let…
- 0 votes0 replies0 views
Polynomiality of region counts for fixed gain-function trees
Let be fixed, let vary, and fix a tree of gain functions. Consider the regions of the arrangement associated to that tree. Polynomiality conjectur…
- 0 votes0 replies0 views
The graph-generalized Orlik–Terao conjecture
The graph-generalized Orlik–Terao conjecture. For any simple connected graph , there exists an isomorphism