Automorphisms of the cube n^d

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F16%3A10324865" target="_blank" >RIV/00216208:11320/16:10324865 - isvavai.cz</a>
Alternative codes found
RIV/68407700:21240/16:00306777
Result on the web
<a href="http://dx.doi.org/10.1007/978-3-319-42634-1_33" target="_blank" >http://dx.doi.org/10.1007/978-3-319-42634-1_33</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-319-42634-1_33" target="_blank" >10.1007/978-3-319-42634-1_33</a>

Result language
angličtina
Original language name
Automorphisms of the cube n^d
Original language description
Consider a hypergraph $H_n^d$ where the vertices are points of the $d$-dimensional combinatorial 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 $H_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 Automorphism problem of deciding whether for two colorings of the vertices of $H_n^d$ there exists an automorphism of $H_n^d$ preserving the colors. We show that this problem is $GI$-complete.
Czech name
—
Czech description
—

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

Article name in the collection
Computing and Combinatorics 22nd International Conference, COCOON 2016, Ho Chi Minh City, Vietnam, August 2-4, 2016, Proceedings
ISBN
978-3-319-42633-4
ISSN
—
e-ISSN
—
Number of pages
12
Pages from-to
405-416
Publisher name
Springer
Place of publication
Berlin
Event location
Ho Chi Minh City
Event date
Aug 2, 2016
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—

Similar results(10)