Automorphisms of the cube n^d

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F21%3A00349471" target="_blank" >RIV/68407700:21240/21:00349471 - isvavai.cz</a>
Result on the web
<a href="https://doi.org/10.1016/j.disc.2020.112234" target="_blank" >https://doi.org/10.1016/j.disc.2020.112234</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.disc.2020.112234" target="_blank" >10.1016/j.disc.2020.112234</a>

Result language
angličtina
Original language name
Automorphisms of the cube n^d
Original language description
Consider a hypergraph n^d where the vertices are points of the d-dimensional cube [n]^d and the edges are all sets of n points such that they are in one line. We study the structure of the group of automorphisms of n^d, i.e., permutations of points of [n]^d preserving the edges. In this paper we provide a complete characterization. Moreover, we consider the Colored Cube Isomorphism problem of deciding whether for two colorings of the vertices of n^d there exists an automorphism of n^d preserving the colors. We show that this problem is GI-complete.
Czech name
—
Czech description
—

Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10101 - Pure mathematics

Project
<a href="/en/project/EF16_019%2F0000765" target="_blank" >EF16_019/0000765: Research Center for Informatics</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2021
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)