The Rubik's Cube group is a group that represents the structure of the Rubik's Cube mechanical puzzle. Each element of the set corresponds to a cube move, which is the effect of any sequence of rotations of the cube's faces. With this representation, not only can any cube move be represented, but any position of the cube as well, by detailing the cube moves required to rotate the solved cube into that position. Indeed with the solved position as a starting point, there is a one-to-one correspondence between each of the legal positions of the Rubik's Cube and the elements of . The group operation is the composition of cube moves, corresponding to the result of performing one cube move after another.
The Rubik's Cube group is constructed by labeling each of the 48 non-center facets with the integers 1 to 48. Each configuration of the cube can be represented as a permutation of the labels 1 to 48, depending on the position of each facet. Using this representation, the solved cube is the identity permutation which leaves the cube unchanged, while the twelve cube moves that rotate a layer of the cube 90 degrees are represented by their respective permutations. The Rubik's Cube group is the subgroup of the symmetric group generated by the six permutations corresponding to the six clockwise cube moves. With this construction, any configuration of the cube reachable through a sequence of cube moves is within the group. Its operation refers to the composition of two permutations; within the cube, this refers to combining two sequences of cube moves together, doing one after the other. The Rubik's Cube group is non-abelian as composition of cube moves is not commutative; doing two sequences of cube moves in a different order can result in a different configuration.
A Rubik's Cube consists of faces, each with colored squares called facets, for a total of facets. A solved cube has all of the facets on each face having the same color.
A cube move rotates one of the faces: or (half-turn metric).
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.
Ce cours permet l'acquisition des notions essentielles relatives à la structure de la matière, aux équilibres et à la réactivité chimique en liaison avec les propriétés mécaniques, thermiques, électri
In group theory, the wreath product is a special combination of two groups based on the semidirect product. It is formed by the action of one group on many copies of another group, somewhat analogous to exponentiation. Wreath products are used in the classification of permutation groups and also provide a way of constructing interesting examples of groups. Given two groups and (sometimes known as the bottom and top), there exist two variations of the wreath product: the unrestricted wreath product and the restricted wreath product .
In mathematics, specifically in group theory, the direct product is an operation that takes two groups G and H and constructs a new group, usually denoted G × H. This operation is the group-theoretic analogue of the Cartesian product of sets and is one of several important notions of direct product in mathematics. In the context of abelian groups, the direct product is sometimes referred to as the direct sum, and is denoted .
In mathematics, specifically group theory, a subgroup H of a group G may be used to decompose the underlying set of G into disjoint, equal-size subsets called cosets. There are left cosets and right cosets. Cosets (both left and right) have the same number of elements (cardinality) as does H. Furthermore, H itself is both a left coset and a right coset. The number of left cosets of H in G is equal to the number of right cosets of H in G. This common value is called the index of H in G and is usually denoted by [G : H].
Thévenaz [6] made an interesting observation that the number of conjugacy classes of cyclic subgroups in a finite group G is equal to the rank of the matrix of the numbers of double cosets in G. We give another proof of this fact and present a fusion syste ...
In an application of the notion of twisting structures introduced by Hess and Lack, we define twisted composition products of symmetric sequences of chain complexes that are degreewise projective and finitely generated. Let Q be a cooperad and let BP be th ...
We study different symbolic algorithms to solve two related reconfiguration problems on graphs: the token swapping problem and the permutation routing via matchings problem. Input to both problems is a connected graph with labeled vertices and a token in e ...