ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Is the determinant-sign hypothesis necessary in the following assertion? Suppose EE and FF are finite graphs for which C∗(E)C^*(E) and C∗(F)C^*(F) (equivalently, LC(E)L_{\mathbb C}(E) and LC(F)L_{\mathbb C}(F)) are purely infinite and simple. If there is an isomorphism ϕ:K0(LC(E))→K0(LC(F))\phi:K_0(L_{\mathbb C}(E))\to K_0(L_{\mathbb C}(F)) satisfying ϕ([1LC(E)])=[1LC(F)]\phi([1_{L_{\mathbb C}(E)}])=[1_{L_{\mathbb C}(F)}], must it follow that LC(E)≅LC(F)L_{\mathbb C}(E)\cong L_{\mathbb C}(F) without assuming that det⁡(I−AE)\det(I-A_E) and det⁡(I−AF)\det(I-A_F) have the same sign?

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.