6 problems
- 0 votes0 replies0 views
Kumjian–Pask–Sims conjecture on cubical and categorical cohomology of higher-rank graphs
Kumjian–Pask–Sims conjecture. The cubical and categorical cohomology groups should be isomorphic in all dimensions:
- 0 votes0 replies1 view
Exel's conjecture on the groupoid of a higher-rank graph inverse semigroup
Let a general higher-rank graph be given, and consider the inverse semigroup constructed from it as in Farthing, Muhly, and Yeend (2005). Let denote the tight gr…
- 0 votes0 replies0 views
The q-independence conjecture for higher-rank graph models of quantum groups
q-independence conjecture. The -algebra should be isomorphic to for every .
- 0 votes0 replies0 views
The dimension bound for planar higher-rank trees
A higher-rank tree is a higher-rank graph arising from the construction associated with a polyhedral graph, and it is planar when the underlying graph is embedded in a sphere. Assu…
- 0 votes0 replies0 views
Simplicity conjecture for commutator subgroups of higher-rank graph groups
Let be a higher rank graph such that the associated Boolean inverse monoid is countably infinite, and suppose that also satisfies the condition of Proposition 4.9 of KP. Le…
- 0 votes0 replies1 view
The abundance conjecture for faithful representations of higher-rank graph algebras
Abundance conjecture. The Perron–Frobenius measure is potentially just one of many probability measures that could give faithful representations of the Cuntz–Krieger -algebra…