Merge branch 'develop' into t/24889/enumerate_all_genera_of_given_sig…

…nature__determinant_and_bounded_scale_of_a_jordan_block_

VERSION.txt

@@ -1 +1 @@
-SageMath version 8.3.beta6, Release Date: 2018-06-17
+SageMath version 8.3.beta7, Release Date: 2018-06-23

build/pkgs/arb/checksums.ini

@@ -1,4 +1,4 @@
 tarball=arb-VERSION.tar.gz
-sha1=27476d0529e48a07d92da90bd0fb80dd18f443e3
-md5=733285d9705d10b8024e551ffa81952f
-cksum=2391183744
+sha1=44eda7bf8eaa666c45b1fc2c1b5bd08756d94b58
+md5=fa24de9fffe4394fb6a7a6792e2ecc5f
+cksum=3689220688

build/pkgs/arb/package-version.txt

@@ -1 +1 @@
-2.12.0.p0
+2.13.0

build/pkgs/configure/checksums.ini

@@ -1,4 +1,4 @@
 tarball=configure-VERSION.tar.gz
-sha1=0244ee31f4b688c2983e98eef9f2c2571786f853
-md5=9590095d755db99d996d5477d089a7d8
-cksum=440321807
+sha1=fe44cb984fbb8a5273117a4f2109c4ce0f37e427
+md5=ca2049c471b6ac34006e1715b8bfa5c5
+cksum=4130031718

build/pkgs/configure/package-version.txt

@@ -1 +1 @@
-269
+270

build/sage_bootstrap/tarball.py

@@ -136,23 +136,24 @@ def download(self):
         """
         Download the tarball to the upstream directory.
         """
-        destination = os.path.join(SAGE_DISTFILES, self.filename)
+        destination = self.upstream_fqn
         if os.path.isfile(destination):
             if self.checksum_verifies():
                 log.info('Using cached file {destination}'.format(destination=destination))
                 return
             else:
-                # Garbage in the upstream directory? Delete and re-download
-                log.info('Invalid checksum for cached file {destination}, deleting'
+                # Garbage in the upstream directory? Ignore it.
+                # Don't delete it because maybe somebody just forgot to
+                # update the checksum (Trac #23972).
+                log.warn('Invalid checksum; ignoring cached file {destination}'
                          .format(destination=destination))
-                os.remove(destination)
         successful_download = False
         log.info('Attempting to download package {0} from mirrors'.format(self.filename))
         for mirror in MirrorList():
             url = mirror + '/'.join(['spkg', 'upstream', self.package.name, self.filename])
             log.info(url)
             try:
-                Download(url, self.upstream_fqn).run()
+                Download(url, destination).run()
                 successful_download = True
                 break
             except IOError:

src/bin/sage-version.sh

@@ -1,5 +1,5 @@
 # Sage version information for shell scripts
 # This file is auto-generated by the sage-update-version script, do not edit!
-SAGE_VERSION='8.3.beta6'
-SAGE_RELEASE_DATE='2018-06-17'
-SAGE_VERSION_BANNER='SageMath version 8.3.beta6, Release Date: 2018-06-17'
+SAGE_VERSION='8.3.beta7'
+SAGE_RELEASE_DATE='2018-06-23'
+SAGE_VERSION_BANNER='SageMath version 8.3.beta7, Release Date: 2018-06-23'

src/doc/en/reference/references/index.rst

@@ -288,6 +288,10 @@ REFERENCES:
               and Applications - FQ9, volume 518 of Contemporary Mathematics,
               pages 33–42. AMS, 2010.
 
+.. [Bec1992] Bernhard Beckermann. "A reliable method for computing M-Padé
+             approximants on arbitrary staircases". J. Comput. Appl. Math.,
+             40(1):19-42, 1992. https://doi.org/10.1016/0377-0427(92)90039-Z.
+
 .. [BeCoMe] Frits Beukers, Henri Cohen, Anton Mellit,
    *Finite hypergeometric functions*,
    :arxiv:`1505.02900`
@@ -421,6 +425,14 @@ REFERENCES:
             (:arxiv:`0710.5614`) to appear in Ergodic Theory and
             Dynamical Systems.
 
+.. [BLV1999] Bernhard Beckermann, George Labahn, and Gilles Villard. "Shifted
+             normal forms of polynomial matrices". In ISSAC'99, pages 189-196.
+             ACM, 1999. https://doi.org/10.1145/309831.309929 .
+
+.. [BLV2006] Bernhard Beckermann, George Labahn, and Gilles Villard. "Normal
+             forms for general polynomial matrices". J. Symbolic Comput.,
+             41(6):708-737, 2006. https://doi.org/10.1016/j.jsc.2006.02.001 .
+
 .. [BM1940] Becker, M. F., and Saunders MacLane. The minimum number of
             generators for inseparable algebraic extensions. Bulletin of the
             American Mathematical Society 46, no. 2 (1940): 182-186.
@@ -1497,6 +1509,8 @@ REFERENCES:
             refined Demazure character formula, Duke Math. J. 71
             (1993), no. 3, 839--858.
 
+.. [Kai1980] Thomas Kailath. "Linear Systems", Prentice-Hall, 1980.
+
 .. [Kal1980] \T. Kaliath, "Linear Systems", Prentice-Hall, 1980,
              383--386.
 
@@ -2208,6 +2222,10 @@ REFERENCES:
 .. [Pon2010] \S. Pon. *Types B and D affine Stanley symmetric
              functions*, unpublished PhD Thesis, UC Davis, 2010.
 
+.. [Pop1972] \V. M. Popov. "Invariant description of linear, time-invariant
+             controllable systems". SIAM Journal on Control, 10(2):252-264,
+             1972. https://doi.org/10.1137/0310020 .
+
 .. [Pos2005] \A. Postnikov, Affine approach to quantum Schubert
              calculus, Duke Math. J. 128 (2005) 473-509
 
@@ -2706,6 +2724,11 @@ REFERENCES:
             Lattice: The Diamond-Cutting Algorithm*. IEEE Transactions
             on Information Theory, 1996.
 
+.. [VBB1992] Marc Van Barel and Adhemar Bultheel. "A general module theoretic
+             framework for vector M-Padé and matrix rational interpolation."
+             Numer. Algorithms, 3:451-462, 1992.
+             https://doi.org/10.1007/BF02141952
+
 .. [Vee1978] William Veech, "Interval exchange
              transformations", J. Analyse Math. 33 (1978), 222-272
 
@@ -2791,6 +2814,10 @@ REFERENCES:
              twist automorphism*. Int. Math. Res. Not. (2015) no. 22,
              12042--12069. :doi:`10.1093/imrn/rnv057`.
 
+.. [Wol1974] W. A. Wolovich. "Linear Multivariable Systems", Applied
+             Mathematical Sciences (volume 11). Springer-Verlag New-York, 1974.
+             doi.org/10.1007/978-1-4612-6392-0 .
+
 .. [Woo1998] \R. M. W. Wood, "Problems in the Steenrod algebra,"
              Bull. London Math. Soc. 30 (1998), no. 5, 449-517.
 

src/doc/en/thematic_tutorials/functional_programming.rst

@@ -302,7 +302,7 @@ out all items that satisfy some condition(s) defined in the given
 function. For example, you could use ``filter`` to filter out all
 primes between 1 and 50, inclusive. ::
 
-    sage: filter(is_prime, [1..50])
+    sage: list(filter(is_prime, [1..50]))
     [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47]
 
 For a given positive integer `n`, the
@@ -320,7 +320,7 @@ to 20. Then you could use ``filter`` instead of list comprehension
 to obtain all the required `a`'s. ::
 
     sage: is_coprime = lambda k: gcd(k, 20) == 1
-    sage: filter(is_coprime, range(1, 21))
+    sage: list(filter(is_coprime, range(1, 21)))
     [1, 3, 7, 9, 11, 13, 17, 19]
 
 The function ``primroots`` defined below returns all primitive roots

src/sage/algebras/affine_nil_temperley_lieb.py

@@ -143,8 +143,8 @@ def index_set(self):
 
     @cached_method
     def algebra_generators(self):
-        """
-        Returns the generators `a_i` for `i=0,1,2,\ldots,n-1`.
+        r"""
+        Return the generators `a_i` for `i=0,1,2,\ldots,n-1`.
 
         EXAMPLES::
 

src/sage/algebras/associated_graded.py

@@ -302,7 +302,7 @@ def degree_on_basis(self, x):
 
     @cached_method
     def one_basis(self):
-        """
+        r"""
         Return the basis index of the element `1` of
         `\operatorname{gr} A`.
 

src/sage/algebras/cellular_basis.py

@@ -108,10 +108,10 @@
 #*****************************************************************************
 
 from sage.misc.cachefunc import cached_method
-from sage.misc.lazy_attribute import lazy_attribute
 from sage.combinat.free_module import CombinatorialFreeModule
 from sage.categories.algebras import Algebras
 
+
 class CellularBasis(CombinatorialFreeModule):
     r"""
     The cellular basis of a cellular algebra, in the sense of
@@ -262,7 +262,7 @@ def cell_poset(self):
         return self._algebra.cell_poset()
 
     def cell_module_indices(self, la):
-        """
+        r"""
         Return the indices of the cell module of ``self``
         indexed by ``la`` .
 

src/sage/algebras/clifford_algebra.py

@@ -197,7 +197,7 @@ def support(self):
         return sorted(self._monomial_coefficients.keys(), key=lambda x: (-len(x), x))
 
     def reflection(self):
-        """
+        r"""
         Return the image of the reflection automorphism on ``self``.
 
         The *reflection automorphism* of a Clifford algebra is defined
@@ -319,7 +319,7 @@ def conjugate(self):
     # TODO: This is a general function which should be moved to a
     #   superalgebras category when one is implemented.
     def supercommutator(self, x):
-        """
+        r"""
         Return the supercommutator of ``self`` and ``x``.
 
         Let `A` be a superalgebra. The *supercommutator* of homogeneous
@@ -910,7 +910,7 @@ def dimension(self):
         return ZZ(2)**self._quadratic_form.dim()
 
     def pseudoscalar(self):
-        """
+        r"""
         Return the unit pseudoscalar of ``self``.
 
         Given the basis `e_1, e_2, \ldots, e_n` of the underlying
@@ -1645,7 +1645,7 @@ def lift_morphism(self, phi, names=None):
         return self.module_morphism(on_basis=f, codomain=E, category=cat)
 
     def volume_form(self):
-        """
+        r"""
         Return the volume form of ``self``.
 
         Given the basis `e_1, e_2, \ldots, e_n` of the underlying
@@ -1787,7 +1787,7 @@ def antipode_on_basis(self, m):
         return self.term(m, (-self.base_ring().one())**len(m))
 
     def counit(self, x):
-        """
+        r"""
         Return the counit of ``x``.
 
         The counit of an element `\omega` of the exterior algebra
@@ -1803,7 +1803,7 @@ def counit(self, x):
         return x.constant_coefficient()
 
     def interior_product_on_basis(self, a, b):
-        """
+        r"""
         Return the interior product `\iota_b a` of ``a`` with respect to
         ``b``.
 
@@ -2726,7 +2726,7 @@ def _repr_type(self):
         return "Coboundary"
 
     def _on_basis(self, m):
-        """
+        r"""
         Return the differential on the basis element indexed by ``m``.
 
         EXAMPLES:

src/sage/algebras/cluster_algebra.py

@@ -2052,7 +2052,7 @@ def seeds(self, **kwargs):
             # remember if we got a new seed
             gets_bigger = False
 
-            for cl in clusters.keys():
+            for cl in list(clusters):
                 sd, directions = clusters[cl]
                 while directions:
                     try:

src/sage/algebras/commutative_dga.py

@@ -1410,11 +1410,8 @@ def basis_coefficients(self, total=False):
                 raise ValueError('This element is not homogeneous')
 
             basis = self.parent().basis(self.degree(total))
-            F = self.parent().base()
             lift = self.lift()
-            monos = self.monomials()
-            c = [lift.monomial_coefficient(x.lift()) for x in basis]
-            return c
+            return [lift.monomial_coefficient(x.lift()) for x in basis]
 
 
 class GCAlgebra_multigraded(GCAlgebra):
@@ -2646,7 +2643,7 @@ def GradedCommutativeAlgebra(ring, names=None, degrees=None, relations=None):
     if degrees:
         try:
             for d in degrees:
-                _ = list(d)
+                list(d)
             # If the previous line doesn't raise an error, looks multi-graded.
             multi = True
         except TypeError:

src/sage/algebras/free_algebra_element.py

@@ -34,17 +34,14 @@
 #                  http://www.gnu.org/licenses/
 #*****************************************************************************
 from __future__ import print_function
+from six import iteritems
 
 from sage.misc.misc import repr_lincomb
 from sage.monoids.free_monoid_element import FreeMonoidElement
 from sage.modules.with_basis.indexed_element import IndexedFreeModuleElement
-from sage.combinat.free_module import CombinatorialFreeModule
 from sage.structure.element import AlgebraElement
 
 
-import six
-
-
 class FreeAlgebraElement(IndexedFreeModuleElement, AlgebraElement):
     """
     A free algebra element.
@@ -173,7 +170,7 @@ def extract_from(kwds,g):
         # I don't start with 0, because I don't want to preclude evaluation with
         # arbitrary objects (e.g. matrices) because of funny coercion.
         result = None
-        for m, c in six.iteritems(self._monomial_coefficients):
+        for m, c in iteritems(self._monomial_coefficients):
             if result is None:
                 result = c*m(x)
             else:

src/sage/algebras/free_algebra_quotient.py

@@ -272,6 +272,9 @@ def matrix_action(self):
 
     def monomial_basis(self):
         """
+        The free monoid of generators of the algebra as elements of a free
+        monoid.
+
         EXAMPLES::
 
             sage: sage.algebras.free_algebra_quotient.hamilton_quatalg(QQ)[0].monomial_basis()
@@ -312,18 +315,6 @@ def monoid(self):
         """
         return self.__free_algebra.monoid()
 
-    def monomial_basis(self):
-        """
-        The free monoid of generators of the algebra as elements of a free
-        monoid.
-
-       EXAMPLES::
-
-            sage: sage.algebras.free_algebra_quotient.hamilton_quatalg(QQ)[0].monomial_basis()
-            (1, i0, i1, i2)
-        """
-        return self.__monomial_basis
-
     def free_algebra(self):
         """
         The free algebra generating the algebra.

src/sage/algebras/iwahori_hecke_algebra.py

@@ -25,17 +25,16 @@
 from sage.misc.bindable_class import BindableClass
 from sage.structure.parent import Parent
 from sage.structure.unique_representation import UniqueRepresentation
-from sage.structure.element import parent
 from sage.categories.realizations import Realizations, Category_realization_of_parent
 from sage.categories.all import AlgebrasWithBasis, FiniteDimensionalAlgebrasWithBasis, CoxeterGroups
 from sage.rings.all import ZZ
 from sage.rings.polynomial.laurent_polynomial_ring import LaurentPolynomialRing
-from sage.rings.polynomial.polydict import ETuple
 from sage.arith.all import is_square
 from sage.combinat.root_system.coxeter_group import CoxeterGroup
 from sage.combinat.family import Family
 from sage.combinat.free_module import CombinatorialFreeModule
 
+
 def normalized_laurent_polynomial(R, p):
     r"""
     Return a normalized version of the (Laurent polynomial) ``p`` in the

src/sage/algebras/jordan_algebra.py

@@ -18,12 +18,11 @@
 from sage.structure.element import AlgebraElement
 from sage.categories.magmatic_algebras import MagmaticAlgebras
 from sage.misc.cachefunc import cached_method
-#from sage.misc.lazy_attribute import lazy_attribute
-from sage.rings.all import QQ
 from sage.structure.element import is_Matrix
 from sage.modules.free_module import FreeModule
 from sage.sets.family import Family
 
+
 class JordanAlgebra(Parent, UniqueRepresentation):
     r"""
     A Jordan algebra.