# Changeset 6031:18e45aa21972

Ignore:
Timestamp:
08/29/07 19:48:16 (6 years ago)
Branch:
default
Message:

2.8.3.rc1

Location:
sage
Files:
4 edited

Unmodified
Removed
• ## sage/groups/perm_gps/cubegroup.py

 r5991 This algorithm (a) constructs the free group on 6 generators then computes a \begin{enumerate} \item constructs the free group on 6 generators then computes a reasonable set of relations which they satisfy (b) computes a homomorphism from the cube group to this free \item computes a homomorphism from the cube group to this free group quotient (c) takes the cube position, regarded as a group element, \item takes the cube position, regarded as a group element, and maps it over to the free group quotient (d) using those relations and tricks from combinatorial group \item using those relations and tricks from combinatorial group theory (stabilizer chains), solves the "word problem" for that element. (e) uses python string parsing to rewrite that in cube notation. The Rubik's cube group has about 4.3x10^(19) elements, so this \item uses python string parsing to rewrite that in cube notation. \end{enumerate} The Rubik's cube group has about $4.3 \times 10^{19}$ elements, so this process is time-consuming. See http://www.gap-system.org/Doc/Examples/rubik.html
• ## sage/rings/integer.pyx

 r6014 def __mod__(self, modulus): r""" Returns \code{self % modulus}. Returns self modulo the modulus. EXAMPLES: ... ZeroDivisionError: Integer modulo by zero """ sage: -5 % 7 2 """ cdef Integer _modulus, _self _modulus = integer(modulus)
• ## sage/structure/element.pyx

 r6027 def generic_power(a, n, one=None): """ Computes a^n, where n is an integer, and a is an object which Computes $a^n$, where $n$ is an integer, and $a$ is an object which supports multiplication.  Optionally an additional argument, which is used in the case that n == 0:
• ## sage/version.py

 r6000 """nodoctests""" version='2.8.3.alpha5'; date='2007-08-29' version='2.8.3.rc1'; date='2007-08-29'
Note: See TracChangeset for help on using the changeset viewer.