Forum Problem Lists Definitions FAQ

19.95 (2018)

Open

Let $G_\Gamma$ be a partially commutative soluble group of derived length $n \geqslant 3$ with defining graph $\Gamma$ (the definition is similar to the case of $n = 2$, see 17.104). Is it true that the centralizer of any vertex of the graph is generated by its adjacent vertices?

Contributor: E. I. Timoshenko

Comments

All comments are the responsibility of the user. Comments appearing on this page are not verified for correctness. Please keep posts mathematical and on topic. If you want to submit a proof (or a partial proof), please use the dedicated proof submission form rather than posting it in the comments.
Order by newest first or oldest first.

No comments yet. Be the first to comment.

Proof claims

Proof claims are the responsibility of the submitter. Appearance here does not mean the claim has been checked for mathematical correctness. Moderators only screen for spam, abuse, and obviously low-effort submissions.

No proof claims yet.