A non-abelian analogue of Whitney's 2-isomorphism theorem

From MaRDI portal
Publication:2454085

DOI10.1007/S10801-013-0461-XzbMATH Open1294.05189arXiv1208.1994OpenAlexW2037440724MaRDI QIDQ2454085FDOQ2454085


Authors: Eric Katz Edit this on Wikidata


Publication date: 12 June 2014

Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)

Abstract: We give a non-abelian analogue of Whitney's 2-isomorphism theorem for graphs. Whitney's theorem states that the cycle space determines a graph up to 2-isomorphism. Instead of considering the cycle space of a graph which is an abelian object, we consider a mildly non-abelian object, the 2-truncation of the group algebra of the fundamental group of the graph considered as a subalgebra of the 2-truncation of the group algebra of the free group on the edges. The analogue of Whitney's theorem is that this is a complete invariant of 2-edge connected graphs: let G,G' be 2-edge connected finite graphs; if there is a bijective correspondence between the edges of G and G' that induces equality on the 2-truncations of the group algebras of the fundamental groups, then G and G' are isomorphic.


Full work available at URL: https://arxiv.org/abs/1208.1994




Recommendations




Cites Work


Cited In (1)





This page was built for publication: A non-abelian analogue of Whitney's 2-isomorphism theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2454085)