passagemath-repl 10.5.28__py3-none-any.whl → 10.5.30__py3-none-any.whl

sage/tests/books/judson-abstract-algebra/actions-sage.py

@@ -0,0 +1,174 @@
+# sage_setup: distribution = sagemath-repl
+# sage.doctest: needs sage.graphs sage.groups
+##          Sage Doctest File         ##
+#**************************************#
+#*    Generated from PreTeXt source   *#
+#*    on 2017-08-24T11:43:34-07:00    *#
+#*                                    *#
+#*   http://mathbook.pugetsound.edu   *#
+#*                                    *#
+#**************************************#
+##
+"""
+Please contact Rob Beezer (beezer@ups.edu) with
+any test failures here that need to be changed
+as a result of changes accepted into Sage.  You
+may edit/change this file in any sensible way, so
+that development work may procede.  Your changes
+may later be replaced by the authors of "Abstract
+Algebra: Theory and Applications" when the text is
+updated, and a replacement of this file is proposed
+for review.
+"""
+##
+## To execute doctests in these files, run
+##   $ $SAGE_ROOT/sage -t <directory-of-these-files>
+## or
+##   $ $SAGE_ROOT/sage -t <a-single-file>
+##
+## Replace -t by "-tp n" for parallel testing,
+##   "-tp 0" will use a sensible number of threads
+##
+## See: http://www.sagemath.org/doc/developer/doctesting.html
+##   or run  $ $SAGE_ROOT/sage --advanced  for brief help
+##
+## Generated at 2017-08-24T11:43:34-07:00
+## From "Abstract Algebra"
+## At commit 26d3cac0b4047f4b8d6f737542be455606e2c4b4
+##
+## Section 14.7 Sage
+##
+r"""
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: D = DihedralGroup(8)
+    sage: C = D.center(); C
+    Subgroup generated by [(1,5)(2,6)(3,7)(4,8)]
+    of (Dihedral group of order 16 as a permutation group)
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: C.list()
+    [(), (1,5)(2,6)(3,7)(4,8)]
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: a = D("(1,2)(3,8)(4,7)(5,6)")
+    sage: C1 = D.centralizer(a); C1.list()
+    [(), (1,2)(3,8)(4,7)(5,6), (1,5)(2,6)(3,7)(4,8), (1,6)(2,5)(3,4)(7,8)]
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: b = D("(1,2,3,4,5,6,7,8)")
+    sage: C2 = D.centralizer(b); C2.order()
+    8
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: CCR = D.conjugacy_classes_representatives(); CCR
+    [(), (2,8)(3,7)(4,6), (1,2)(3,8)(4,7)(5,6), (1,2,3,4,5,6,7,8),
+     (1,3,5,7)(2,4,6,8), (1,4,7,2,5,8,3,6), (1,5)(2,6)(3,7)(4,8)]
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: r = CCR[2]; r
+    (1,2)(3,8)(4,7)(5,6)
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: conj = []
+    sage: x = [conj.append(g^-1*r*g) for g in D if not g^-1*r*g in conj]
+    sage: conj
+    [(1,2)(3,8)(4,7)(5,6),
+     (1,6)(2,5)(3,4)(7,8),
+     (1,8)(2,7)(3,6)(4,5),
+     (1,4)(2,3)(5,8)(6,7)]
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: sizes = [D.order()/D.centralizer(g).order()
+    ....:              for g in D.conjugacy_classes_representatives()]
+    sage: sizes
+    [1, 4, 4, 2, 2, 2, 1]
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: D.order() == sum(sizes)
+    True
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: Q = graphs.CubeGraph(3)
+    sage: Q.plot(layout='spring')   # not tested
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: A = Q.automorphism_group()
+    sage: A.order()
+    48
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: a = A("('000','001')('010','011')('110','111')('100','101')")
+    sage: a in A
+    True
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: A.orbits()        # random
+    [['000', '001', '010', '100', '011', '101', '110', '111']]
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: A.is_transitive()
+    True
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: S = A.stabilizer('000')
+    sage: S.list()          # random
+    [(),
+     ('001','100','010')('011','101','110'),
+     ('010','100')('011','101'),
+     ('001','010','100')('011','110','101'),
+     ('001','100')('011','110'),
+     ('001','010')('101','110')]
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: P = graphs.PathGraph(11)
+    sage: P.plot()   # not tested
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: A = P.automorphism_group()
+    sage: A.list()
+    [(), (0,10)(1,9)(2,8)(3,7)(4,6)]
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: A.is_transitive()
+    False
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: A.orbits()
+    ((0, 10), (1, 9), (2, 8), (3, 7), (4, 6), (5,))
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: A.stabilizer(2).list()
+    [()]
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: A.stabilizer(5).list()
+    [(), (0,10)(1,9)(2,8)(3,7)(4,6)]
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: G = SymmetricGroup(4)
+    sage: S = G.stabilizer(4)
+    sage: S.orbits()
+    ((1, 2, 3), (4,))
+"""

sage/tests/books/judson-abstract-algebra/algcodes-sage.py

@@ -0,0 +1,131 @@
+# sage_setup: distribution = sagemath-repl
+# sage.doctest: needs sage.libs.pari sage.modules
+##          Sage Doctest File         ##
+#**************************************#
+#*    Generated from PreTeXt source   *#
+#*    on 2017-08-24T11:43:34-07:00    *#
+#*                                    *#
+#*   http://mathbook.pugetsound.edu   *#
+#*                                    *#
+#**************************************#
+##
+"""
+Please contact Rob Beezer (beezer@ups.edu) with
+any test failures here that need to be changed
+as a result of changes accepted into Sage.  You
+may edit/change this file in any sensible way, so
+that development work may procede.  Your changes
+may later be replaced by the authors of "Abstract
+Algebra: Theory and Applications" when the text is
+updated, and a replacement of this file is proposed
+for review.
+"""
+##
+## To execute doctests in these files, run
+##   $ $SAGE_ROOT/sage -t <directory-of-these-files>
+## or
+##   $ $SAGE_ROOT/sage -t <a-single-file>
+##
+## Replace -t by "-tp n" for parallel testing,
+##   "-tp 0" will use a sensible number of threads
+##
+## See: http://www.sagemath.org/doc/developer/doctesting.html
+##   or run  $ $SAGE_ROOT/sage --advanced  for brief help
+##
+## Generated at 2017-08-24T11:43:34-07:00
+## From "Abstract Algebra"
+## At commit 26d3cac0b4047f4b8d6f737542be455606e2c4b4
+##
+## Section 8.8 Sage
+##
+r"""
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: codes.   # not tested
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: H = codes.HammingCode(GF(2), 3); H
+    [7, 4] Hamming Code over GF(2)
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: H.dimension()
+    4
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: H.list()
+    [(0, 0, 0, 0, 0, 0, 0), (1, 0, 0, 0, 0, 1, 1), (0, 1, 0, 0, 1, 0, 1),
+     (1, 1, 0, 0, 1, 1, 0), (0, 0, 1, 0, 1, 1, 0), (1, 0, 1, 0, 1, 0, 1),
+     (0, 1, 1, 0, 0, 1, 1), (1, 1, 1, 0, 0, 0, 0), (0, 0, 0, 1, 1, 1, 1),
+     (1, 0, 0, 1, 1, 0, 0), (0, 1, 0, 1, 0, 1, 0), (1, 1, 0, 1, 0, 0, 1),
+     (0, 0, 1, 1, 0, 0, 1), (1, 0, 1, 1, 0, 1, 0), (0, 1, 1, 1, 1, 0, 0),
+     (1, 1, 1, 1, 1, 1, 1)]
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: H.minimum_distance()
+    3
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: C = H.parity_check_matrix(); C
+    [1 0 1 0 1 0 1]
+    [0 1 1 0 0 1 1]
+    [0 0 0 1 1 1 1]
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: G = H.generator_matrix(); G
+    [1 0 0 0 0 1 1]
+    [0 1 0 0 1 0 1]
+    [0 0 1 0 1 1 0]
+    [0 0 0 1 1 1 1]
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: C*G.transpose() == zero_matrix(3, 4)
+    True
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: H.systematic_generator_matrix()
+    [1 0 0 0 0 1 1]
+    [0 1 0 0 1 0 1]
+    [0 0 1 0 1 1 0]
+    [0 0 0 1 1 1 1]
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: r = vector(GF(2), [1, 1, 1, 1, 0, 0, 1]); r
+    (1, 1, 1, 1, 0, 0, 1)
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: C*r
+    (1, 1, 0)
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: H.decode_to_code(r)
+    (1, 1, 0, 1, 0, 0, 1)
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: message = vector(GF(2), [1, 1, 0, 1, 0, 0, 1])
+    sage: errors = vector(GF(2), [0, 0, 1, 0, 1, 1, 0])
+    sage: received = message + errors
+    sage: received
+    (1, 1, 1, 1, 1, 1, 1)
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: H.decode_to_code(received) == message
+    False
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: H.decode_to_code(received) == received
+    True
+"""

sage/tests/books/judson-abstract-algebra/boolean-sage.py

@@ -0,0 +1,270 @@
+# sage_setup: distribution = sagemath-repl
+# sage.doctest: needs sage.graphs sage.modules
+##          Sage Doctest File         ##
+#**************************************#
+#*    Generated from PreTeXt source   *#
+#*    on 2017-08-24T11:43:34-07:00    *#
+#*                                    *#
+#*   http://mathbook.pugetsound.edu   *#
+#*                                    *#
+#**************************************#
+##
+"""
+Please contact Rob Beezer (beezer@ups.edu) with
+any test failures here that need to be changed
+as a result of changes accepted into Sage.  You
+may edit/change this file in any sensible way, so
+that development work may procede.  Your changes
+may later be replaced by the authors of "Abstract
+Algebra: Theory and Applications" when the text is
+updated, and a replacement of this file is proposed
+for review.
+"""
+##
+## To execute doctests in these files, run
+##   $ $SAGE_ROOT/sage -t <directory-of-these-files>
+## or
+##   $ $SAGE_ROOT/sage -t <a-single-file>
+##
+## Replace -t by "-tp n" for parallel testing,
+##   "-tp 0" will use a sensible number of threads
+##
+## See: http://www.sagemath.org/doc/developer/doctesting.html
+##   or run  $ $SAGE_ROOT/sage --advanced  for brief help
+##
+## Generated at 2017-08-24T11:43:34-07:00
+## From "Abstract Algebra"
+## At commit 26d3cac0b4047f4b8d6f737542be455606e2c4b4
+##
+## Section 19.7 Sage
+##
+r"""
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: X = (24).divisors()
+    sage: X
+    [1, 2, 3, 4, 6, 8, 12, 24]
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: R = [(a,b) for a in X for b in X if a.divides(b)]; R
+    [(1, 1), (1, 2), (1, 3), (1, 4), (1, 6), (1, 8), (1, 12), (1, 24),
+     (2, 2), (2, 4), (2, 6), (2, 8), (2, 12), (2, 24), (3, 3), (3, 6),
+     (3, 12), (3, 24), (4, 4), (4, 8), (4, 12), (4, 24), (6, 6),
+     (6, 12), (6, 24), (8, 8), (8, 24), (12, 12), (12, 24), (24, 24)]
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: D = Poset([X, R])
+    sage: D.plot()   # not tested
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: divisible = lambda x, y: x.divides(y)
+    sage: L = Poset([X, divisible])
+    sage: L == D
+    True
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: L.plot()   # not tested
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: Q = Posets.PentagonPoset()
+    sage: Q.plot()   # not tested
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: S = Posets.BooleanLattice(4)
+    sage: S.plot()   # not tested
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: T = Posets.RandomPoset(20,0.05)
+    sage: T.plot()   # not tested
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: D.is_lequal(4, 8)
+    True
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: D.is_lequal(4, 4)
+    True
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: D.is_less_than(4, 8)
+    True
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: D.is_less_than(4, 4)
+    False
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: D.is_lequal(6, 8)
+    False
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: D.is_lequal(8, 6)
+    False
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: D.is_gequal(8, 4)
+    True
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: D.is_greater_than(4, 8)
+    False
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: X = range(20)
+    sage: C = [[18, 7],  [9, 11], [9, 10], [11, 8], [6, 10],
+    ....:      [10, 2],   [0, 2],  [2, 1],  [1, 8], [8, 12],
+    ....:      [8, 3],  [3, 15], [15, 7], [7, 16],  [7, 4],
+    ....:      [16, 17], [16, 13], [4, 19], [4, 14], [14, 5]]
+    sage: P = Poset([X, C])
+    sage: P.plot()   # not tested
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: P.minimal_elements()
+    [18, 9, 6, 0]
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: P.maximal_elements()
+    [5, 19, 13, 17, 12]
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: P.level_sets()
+    [[18, 9, 6, 0], [11, 10], [2], [1], [8], [3, 12],
+     [15], [7], [4, 16], [14, 19, 13, 17], [5]]
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: linear = P.linear_extension(); linear
+    [18, 9, 11, 6, 10, 0, 2, 1, 8, 3, 15,
+     7, 4, 14, 5, 19, 16, 13, 17, 12]
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: level = P.level_sets()
+    sage: bottomhalf = sum([level[i] for i in range(5)], [])
+    sage: B = P.subposet(bottomhalf)
+    sage: B.plot()   # not tested
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: Pdual = P.dual()
+    sage: Pdual.plot()   # not tested
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: Ddual = D.dual()
+    sage: Ddual.plot()   # not tested
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: P = Posets.AntichainPoset(8)
+    sage: P.is_lattice()
+    False
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: LatticePoset(P)
+    Traceback (most recent call last):
+    ...
+    ValueError: not a meet-semilattice: no bottom element
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: CP = Posets.IntegerCompositions(5)
+    sage: C = LatticePoset(CP)
+    sage: C.plot()   # not tested
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: par = C.an_element().parent()
+    sage: a = par([1, 1, 1, 2])
+    sage: b = par([2, 1, 1, 1])
+    sage: a, b
+    ([1, 1, 1, 2], [2, 1, 1, 1])
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: C.meet(a, b)
+    [2, 1, 2]
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: c = par([1, 4])
+    sage: d = par([2, 3])
+    sage: c, d
+    ([1, 4], [2, 3])
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: C.join(c, d)
+    [1, 1, 3]
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: C.is_distributive()
+    True
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: C.top()
+    [1, 1, 1, 1, 1]
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: C.bottom()
+    [5]
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: comp = C.complements()
+    sage: comp[par([1, 1, 1, 2])]
+    [[4, 1]]
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: comp   # not tested
+    {[1, 1, 1, 1, 1]: [[5]],
+     [1, 1, 1, 2]: [[4, 1]],
+     [1, 1, 2, 1]: [[3, 2]],
+     [1, 1, 3]: [[3, 1, 1]],
+     [1, 2, 1, 1]: [[2, 3]],
+     [1, 2, 2]: [[2, 2, 1]],
+     [1, 3, 1]: [[2, 1, 2]],
+     [1, 4]: [[2, 1, 1, 1]],
+     [2, 1, 1, 1]: [[1, 4]],
+     [2, 1, 2]: [[1, 3, 1]],
+     [2, 2, 1]: [[1, 2, 2]],
+     [2, 3]: [[1, 2, 1, 1]],
+     [3, 1, 1]: [[1, 1, 3]],
+     [3, 2]: [[1, 1, 2, 1]],
+     [4, 1]: [[1, 1, 1, 2]],
+     [5]: [[1, 1, 1, 1, 1]]}
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: [len(e[1]) for e in comp.items()]
+    [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: C.is_complemented()
+    True
+"""

sage/tests/books/judson-abstract-algebra/cosets-sage-exercises.py

@@ -0,0 +1,88 @@
+# sage_setup: distribution = sagemath-repl
+# sage.doctest: needs sage.libs.pari
+##          Sage Doctest File         ##
+#**************************************#
+#*    Generated from PreTeXt source   *#
+#*    on 2017-08-24T11:43:34-07:00    *#
+#*                                    *#
+#*   http://mathbook.pugetsound.edu   *#
+#*                                    *#
+#**************************************#
+##
+"""
+Please contact Rob Beezer (beezer@ups.edu) with
+any test failures here that need to be changed
+as a result of changes accepted into Sage.  You
+may edit/change this file in any sensible way, so
+that development work may procede.  Your changes
+may later be replaced by the authors of "Abstract
+Algebra: Theory and Applications" when the text is
+updated, and a replacement of this file is proposed
+for review.
+"""
+##
+## To execute doctests in these files, run
+##   $ $SAGE_ROOT/sage -t <directory-of-these-files>
+## or
+##   $ $SAGE_ROOT/sage -t <a-single-file>
+##
+## Replace -t by "-tp n" for parallel testing,
+##   "-tp 0" will use a sensible number of threads
+##
+## See: http://www.sagemath.org/doc/developer/doctesting.html
+##   or run  $ $SAGE_ROOT/sage --advanced  for brief help
+##
+## Generated at 2017-08-24T11:43:34-07:00
+## From "Abstract Algebra"
+## At commit 26d3cac0b4047f4b8d6f737542be455606e2c4b4
+##
+## Exercises 6.6 Sage Exercises
+##
+r"""
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: a = 5
+    sage: b = 10
+    sage: c = 6
+    sage: d = 13
+    sage: a.divides(b)
+    True
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: not (b in [c,d])
+    True
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: a.divides(b) and not (b in [c,d])
+    True
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: a = 20
+    sage: b = 6
+    sage: a.mod(b)
+    2
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: prime_range(50, 100)
+    [53, 59, 61, 67, 71, 73, 79, 83, 89, 97]
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: all([True, True, True, True])
+    True
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: all([True, True, False, True])
+    False
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: [a/b for a in srange(9) for b in srange(1,a) if gcd(a,b)==1]
+    [2, 3, 3/2, 4, 4/3, 5, 5/2, 5/3, 5/4, 6, 6/5,
+     7, 7/2, 7/3, 7/4, 7/5, 7/6, 8, 8/3, 8/5, 8/7]
+"""