Equivariant simplicial reconstruction
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 gro...
| Main Authors: | , , |
|---|---|
| Format: | Journal article |
| Language: | English |
| Published: |
Society for Industrial and Applied Mathematics
2020
|