Permutation clones that preserve relations
Fuente:
arXiv
Guardado en:
| Autor principal: | |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866913602326233088 |
|---|---|
| author | Boykett, Tim |
| author_facet | Boykett, Tim |
| contents | Permutation clones generalise permutation groups and clone theory. We investigate permutation clones defined by relations, or equivalently, the automorphism groups of powers of relations. We find many structural results on the lattice of all relationally defined permutation clones on a finite set. We find all relationally defined permutation clones on two element set.
We show that all maximal borrow closed permutation clones are either relationally defined or cancellatively defined.
Permutation clones generalise clones to permutations of $A^n$. Emil Jeřábek found the dual structure to be weight mappings $A^k\rightarrow M$ to a commutative monoid, generalising relations. We investigate the case when the dual object is precisely a relation, equivalently, that $M={\mathbb B}$, calling these relationally defined permutation clones.
We determine the number of relationally defined permutation clones on two elements (13).
We note that many infinite classes of clones collapse when looked at as permutation clones. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2412_06109 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Permutation clones that preserve relations Boykett, Tim Combinatorics Discrete Mathematics Logic in Computer Science Group Theory Rings and Algebras Permutation clones generalise permutation groups and clone theory. We investigate permutation clones defined by relations, or equivalently, the automorphism groups of powers of relations. We find many structural results on the lattice of all relationally defined permutation clones on a finite set. We find all relationally defined permutation clones on two element set. We show that all maximal borrow closed permutation clones are either relationally defined or cancellatively defined. Permutation clones generalise clones to permutations of $A^n$. Emil Jeřábek found the dual structure to be weight mappings $A^k\rightarrow M$ to a commutative monoid, generalising relations. We investigate the case when the dual object is precisely a relation, equivalently, that $M={\mathbb B}$, calling these relationally defined permutation clones. We determine the number of relationally defined permutation clones on two elements (13). We note that many infinite classes of clones collapse when looked at as permutation clones. |
| title | Permutation clones that preserve relations |
| topic | Combinatorics Discrete Mathematics Logic in Computer Science Group Theory Rings and Algebras |
| url | https://arxiv.org/abs/2412.06109 |