Author
Carbone, L
Nanda, V
Naqvi, Y
Journal title
SIAM Journal on Applied Algebra and Geometry
DOI
10.1137/20M1327483
Issue
4
Volume
4
Last updated
2022-05-06T17:49:12.54+01:00
Page
532-552
Abstract
We introduce and analyze parallelizable algorithms to compress and accurately
reconstruct finite simplicial complexes that have non-trivial automorphisms. The compressed
data – called a complex of groups – amounts to a functor from (the poset of simplices in)
the orbit space to the 2-category of groups, whose higher structure is prescribed by isomorphisms arising from conjugation. Using this functor, we show how to algorithmically recover
the original complex up to equivariant simplicial isomorphism. Our algorithms are derived
from generalizations (by Bridson-Haefliger, Carbone-Rips and Corson, among others) of the
classical Bass-Serre theory for reconstructing group actions on trees.
Symplectic ID
1131281
Favourite
Off
Publication type
Journal Article
Publication date
14 Dec 2020
Please contact us for feedback and comments about this page. Created on 09 Sep 2020 - 18:20.