Finite Groupoids, Finite Coverings and Symmetries in Finite Structures
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2014
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910294756818944 |
|---|---|
| author | Otto, Martin |
| author_facet | Otto, Martin |
| contents | We propose a novel construction of finite hypergraphs and relational structures that is based on reduced products with Cayley graphs of groupoids. To this end we construct groupoids whose Cayley graphs have large girth not just in the usual sense, but with respect to a discounted distance measure that contracts arbitrarily long sequences of edges within the same sub-groupoid (coset) and only counts transitions between cosets. Reduced products with such groupoids are sufficiently generic to be applicable to various constructions that are specified in terms of local glueing operations and require global finite closure. We here examine hypergraph coverings and extension tasks that lift local symmetries to global automorphisms. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_1404_4599 |
| institution | arXiv |
| publishDate | 2014 |
| record_format | arxiv |
| spellingShingle | Finite Groupoids, Finite Coverings and Symmetries in Finite Structures Otto, Martin Combinatorics Logic in Computer Science Logic 05E18, 05C65, 05C25, 05C38, 20F05, 57M12 We propose a novel construction of finite hypergraphs and relational structures that is based on reduced products with Cayley graphs of groupoids. To this end we construct groupoids whose Cayley graphs have large girth not just in the usual sense, but with respect to a discounted distance measure that contracts arbitrarily long sequences of edges within the same sub-groupoid (coset) and only counts transitions between cosets. Reduced products with such groupoids are sufficiently generic to be applicable to various constructions that are specified in terms of local glueing operations and require global finite closure. We here examine hypergraph coverings and extension tasks that lift local symmetries to global automorphisms. |
| title | Finite Groupoids, Finite Coverings and Symmetries in Finite Structures |
| topic | Combinatorics Logic in Computer Science Logic 05E18, 05C65, 05C25, 05C38, 20F05, 57M12 |
| url | https://arxiv.org/abs/1404.4599 |