Merge branch 'develop' into fix/pr-template

Author: kwankyu

.github/dependabot.yml

@@ -0,0 +1,10 @@
+# Documentation for all configuration options:
+# https://docs.github.com/github/administering-a-repository/configuration-options-for-dependency-updates
+
+version: 2
+updates:
+  # Maintain dependencies for GitHub Actions
+  - package-ecosystem: "github-actions"
+    directory: "/"
+    schedule:
+      interval: "weekly"

.gitignore

@@ -19,6 +19,7 @@
 /config.status
 /configure
 /conftest*
+/confdefs.h
 
 /m4/sage_spkg_configures.m4
 

.zenodo.json

@@ -1,10 +1,10 @@
 {
     "description": "Mirror of the Sage https://sagemath.org/ source tree", 
     "license": "other-open", 
-    "title": "sagemath/sage: 10.0.beta1", 
-    "version": "10.0.beta1", 
+    "title": "sagemath/sage: 10.0.beta3", 
+    "version": "10.0.beta3", 
     "upload_type": "software", 
-    "publication_date": "2023-02-19", 
+    "publication_date": "2023-03-02", 
     "creators": [
         {
             "affiliation": "SageMath.org", 
@@ -15,7 +15,7 @@
     "related_identifiers": [
         {
             "scheme": "url", 
-            "identifier": "https://github.com/sagemath/sage/tree/10.0.beta1", 
+            "identifier": "https://github.com/sagemath/sage/tree/10.0.beta3", 
             "relation": "isSupplementTo"
         }, 
         {

VERSION.txt

@@ -1 +1 @@
-SageMath version 10.0.beta1, Release Date: 2023-02-19
+SageMath version 10.0.beta3, Release Date: 2023-03-02

build/pkgs/configure/checksums.ini

@@ -1,4 +1,4 @@
 tarball=configure-VERSION.tar.gz
-sha1=0897c667d1327d2a51ea3d3bd1d9e1a3f5ca2606
-md5=a1f271e5ffcf558d054028839296a072
-cksum=437557471
+sha1=b9a6c30f4f1c828ca611527d104643d8c0b89ed9
+md5=37a7a99a528efa8a4eea1beff33985db
+cksum=1112286999

build/pkgs/configure/package-version.txt

@@ -1 +1 @@
-08185d786047228caff879eba88a1f8148a49020
+a822a2132aa0e85069ec8b6efa48ad6db08cc044

build/pkgs/giac/checksums.ini

@@ -2,4 +2,3 @@ tarball=giac-VERSION.tar.bz2
 sha1=78c15badd19b49b7d111ac204b611a4378ce3d15
 md5=8fbd43a5c60848b6813b7fc8698a0199
 cksum=1923149665
-upstream_url=https://trac.sagemath.org/raw-attachment/ticket/31563/giac-VERSION.tar.bz2

build/pkgs/iml/checksums.ini

@@ -2,4 +2,3 @@ tarball=iml-VERSION.tar.bz2
 sha1=8aba468a62e6fb0584be9b014350b734663c0670
 md5=a8083e70c0c4378f69eb772c1eeed6f0
 cksum=2793221462
-upstream_url=https://trac.sagemath.org/raw-attachment/ticket/33195/iml-1.0.4p2.tar.bz2

build/pkgs/mathjax/checksums.ini

@@ -2,4 +2,3 @@ tarball=mathjax-VERSION.tar.gz
 sha1=3f7abecf8cacd7f5d7f9ae6c3baca7739101c17d
 md5=ba1a65ab58aaad6c84f39735c619bc34
 cksum=1142131398
-upstream_url=https://trac.sagemath.org/raw-attachment/ticket/25833/mathjax-3.2.0.tar.gz

build/pkgs/msolve/checksums.ini

@@ -2,4 +2,3 @@ tarball=msolve-VERSION.tar.gz
 sha1=5b227de8b222bfe8d143e1d7ea77ad71cd209dc8
 md5=2f34bd9ccb089688ae169201281108dc
 cksum=941373315
-upstream_url=https://trac.sagemath.org/raw-attachment/ticket/31664/msolve-VERSION.tar.gz

build/pkgs/sage_conf/install-requires.txt

@@ -1,2 +1,2 @@
 # This file is updated on every release by the sage-update-version script
-sage-conf ~= 10.0b1
+sage-conf ~= 10.0b3

build/pkgs/sage_docbuild/install-requires.txt

@@ -1,2 +1,2 @@
 # This file is updated on every release by the sage-update-version script
-sage-docbuild ~= 10.0b1
+sage-docbuild ~= 10.0b3

build/pkgs/sage_setup/install-requires.txt

@@ -1,2 +1,2 @@
 # This file is updated on every release by the sage-update-version script
-sage-setup ~= 10.0b1
+sage-setup ~= 10.0b3

build/pkgs/sage_sws2rst/install-requires.txt

@@ -1,2 +1,2 @@
 # This file is updated on every release by the sage-update-version script
-sage-sws2rst ~= 10.0b1
+sage-sws2rst ~= 10.0b3

build/pkgs/sagelib/install-requires.txt

@@ -1,2 +1,2 @@
 # This file is updated on every release by the sage-update-version script
-sagelib ~= 10.0b1
+sagelib ~= 10.0b3

build/pkgs/sagemath_categories/install-requires.txt

@@ -1,2 +1,2 @@
 # This file is updated on every release by the sage-update-version script
-sagemath-categories ~= 10.0b1
+sagemath-categories ~= 10.0b3

build/pkgs/sagemath_environment/install-requires.txt

@@ -1,2 +1,2 @@
 # This file is updated on every release by the sage-update-version script
-sagemath-environment ~= 10.0b1
+sagemath-environment ~= 10.0b3

build/pkgs/sagemath_objects/install-requires.txt

@@ -1,2 +1,2 @@
 # This file is updated on every release by the sage-update-version script
-sagemath-objects ~= 10.0b1
+sagemath-objects ~= 10.0b3

build/pkgs/sagemath_repl/install-requires.txt

@@ -1,2 +1,2 @@
 # This file is updated on every release by the sage-update-version script
-sagemath-repl ~= 10.0b1
+sagemath-repl ~= 10.0b3

pkgs/sage-conf/VERSION.txt

@@ -1 +1 @@
-10.0.beta1
+10.0.beta3

pkgs/sage-conf_pypi/VERSION.txt

@@ -1 +1 @@
-10.0.beta1
+10.0.beta3

pkgs/sage-docbuild/VERSION.txt

@@ -1 +1 @@
-10.0.beta1
+10.0.beta3

pkgs/sage-setup/VERSION.txt

@@ -1 +1 @@
-10.0.beta1
+10.0.beta3

pkgs/sage-sws2rst/VERSION.txt

@@ -1 +1 @@
-10.0.beta1
+10.0.beta3

pkgs/sagemath-categories/VERSION.txt

@@ -1 +1 @@
-10.0.beta1
+10.0.beta3

pkgs/sagemath-environment/VERSION.txt

@@ -1 +1 @@
-10.0.beta1
+10.0.beta3

pkgs/sagemath-objects/VERSION.txt

@@ -1 +1 @@
-10.0.beta1
+10.0.beta3

pkgs/sagemath-repl/VERSION.txt

@@ -1 +1 @@
-10.0.beta1
+10.0.beta3

src/VERSION.txt

@@ -1 +1 @@
-10.0.beta1
+10.0.beta3

src/bin/sage-version.sh

@@ -4,6 +4,6 @@
 # which stops "setup.py develop" from rewriting it as a Python file.
 :
 # This file is auto-generated by the sage-update-version script, do not edit!
-SAGE_VERSION='10.0.beta1'
-SAGE_RELEASE_DATE='2023-02-19'
-SAGE_VERSION_BANNER='SageMath version 10.0.beta1, Release Date: 2023-02-19'
+SAGE_VERSION='10.0.beta3'
+SAGE_RELEASE_DATE='2023-03-02'
+SAGE_VERSION_BANNER='SageMath version 10.0.beta3, Release Date: 2023-03-02'

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

@@ -624,7 +624,7 @@ REFERENCES:
                and variants*.
                :arxiv:`1810.00789`
 
-.. [BDKR2013] \D. Best, D.Z. Dokovic, H. Kharaghani and H. Ramp.
+.. [BDKR2013] \D. Best, D.Ž. Đoković, H. Kharaghani and H. Ramp.
               *Turyn-Type Sequences: Classification, Enumeration, and Construction*,
               Journal of Combinatorial Designs 21(1) (2013): 24-35.
               :doi:`10.1002/jcd.21318`
@@ -803,6 +803,10 @@ REFERENCES:
              Stein. strassen_window_multiply_c. strassen.pyx, Sage
              3.0, 2008. http://www.sagemath.org
 
+.. [BrHu2019] Petter Brändén, June Huh. *Lorentzian polynomials*.
+              Ann. Math. (2) 192, No. 3, 821-891 (2020).
+              :arxiv:`1902.03719`, :doi:`10.4007/annals.2020.192.3.4`.
+
 .. [BHNR2004] \S. Brlek, S. Hamel, M. Nivat, C. Reutenauer, On the
               Palindromic Complexity of Infinite Words,
               in J. Berstel, J.  Karhumaki, D. Perrin, Eds,
@@ -1216,6 +1220,11 @@ REFERENCES:
              Proc. London Math. Soc. (3) **77** (1998), 551–581.
              :mathscinet:`MR1643413`
 
+.. [BS1969] \D. Blatt, G. Szekeres.
+            *A Skew Hadamard Matrix of Order 52*,
+            Canadian Journal of Mathematics 21 (1969): 1319-1322.
+            :doi:`10.4153/CJM-1969-144-2`
+
 .. [BS1996] Eric Bach, Jeffrey Shallit. *Algorithmic Number Theory,
             Vol. 1: Efficient Algorithms*. MIT Press, 1996. ISBN
             978-0262024051.
@@ -1794,6 +1803,11 @@ REFERENCES:
             *Tracking p-adic precision*,
             LMS J. Comput. Math. **17** (2014), 274-294.
 
+.. [Connell1999] Ian Connell.
+                 *Elliptic Curve Handbook*.
+                 Online lecture notes, available at
+                 https://git.hackade.org/ben/tinycrypt/raw/branch/master/docs/Elliptic%20Curve%20Handbook.pdf
+
 .. [CS1986] \J. Conway and N. Sloane. *Lexicographic codes:
             error-correcting codes from game theory*, IEEE
             Trans. Infor. Theory **32** (1986) 337-348.
@@ -2041,15 +2055,40 @@ REFERENCES:
              and some constructions of de Luca and Rauzy*,
              Theoret. Comput. Sci.  255 (2001) 539--553.
 
-.. [Djo1992] \D. Đoković.
+.. [Djo1992a] \D. Đoković.
              *Construction of some new Hadamard matrices*,
              Bulletin of the Australian Mathematical Society 45(2) (1992): 327-332.
              :doi:`10.1017/S0004972700030185`
 
+.. [Djo1992b] \D. Đoković.
+             *Skew Hadamard matrices of order 4 x 37 and 4 x 43*,
+             Journal of Combinatorial Theory, Series A 61(2) (1992): 319-321.
+             :doi:`10.1016/0097-3165(92)90029-T`
+
+.. [Djo1992c] \D. Đoković.
+             *Ten New Orders for Hadamard Matrices of Skew Type*,
+             Publikacije Elektrotehničkog fakulteta. Serija Matematika 2 (1992): 47-59.
+
 .. [Djo1994] \D. Đoković.
              *Five New Orders for Hadamard Matrices of Skew Type*,
              Australasian Journal of Combinatorics  10 (1994): 259-264.
 
+.. [Djo2008a] \D. Đoković.
+            *Skew-Hadamard matrices of orders 188 and 388 exist*,
+            International Mathematical Forum 3 no.22 (2008): 1063-1068.
+            :arxiv:`0704.0640`
+
+.. [Djo2008b] \D. Đoković.
+            *Skew-Hadamard matrices of orders 436, 580 and 988 exist*,
+            Journal of Combinatorial Designs 16 (2008): 493-498.
+            :arxiv:`0706.1973`
+
+.. [Djo2023a]  \D. Đoković.
+            *Skew-Hadamard matrices of order 276*.
+            :arxiv:`10.48550/ARXIV.2301.02751`
+
+.. [Djo2023b] \D. Đoković, Email Communication. 26 January 2023.
+
 .. [DK2013] John R. Doyle and David Krumm, *Computing algebraic
             numbers of bounded height*, :arxiv:`1111.4963v4` (2013).
 
@@ -2397,6 +2436,11 @@ REFERENCES:
             code, by I.A.Faradjev (with contributions by A.E.Brouwer,
             D.V.Pasechnik). https://github.com/dimpase/coco
 
+.. [FKS2004] \R. J. Fletcher, C. Koukouvinos and J. Seberry.
+            *New skew-Hadamard matrices of order 4·59 and new D-optimal designs of order 2·59*,
+            Discrete Mathematics 286(3) (2004): 251-253.
+            :doi:`10.1016/j.disc.2004.05.009`
+
 .. [FL2001] David Forge and Michel Las Vergnas.
             *Orlik-Solomon type algebras*. European J. Combin.
             **22** (5), (2001). pp. 699-704.
@@ -3207,6 +3251,11 @@ REFERENCES:
             Designs, Codes and Cryptography 8 (1996) 145-157.
             :doi:`10.1023/A:1018037025910`.
 
+.. [HMMS2019] June Huh, Jacob P. Matherne, Karola Mészáros, Avery St. Dizier.
+              *Logarithmic concavity of Schur and related polynomials*.
+              Trans. Am. Math. Soc. 375, No. 6, 4411-4427 (2022).
+              :arxiv:`1906.09633`, :doi:`10.1090/tran/8606`.
+
 .. [Hutz2007] \B. Hutz. Arithmetic Dynamics on Varieties of dimension greater
               than one. PhD Thesis, Brown University 2007
 
@@ -5493,6 +5542,11 @@ REFERENCES:
              :doi:`10.1007/978-1-4684-9322-1`,
              ISBN 978-1-4684-9322-1.
 
+.. [Spe1977] \E. Spence.
+            *Skew-Hadamard matrices of order 2(q + 1)*,
+            Discrete Mathematics 18(1) (1977): 79-85.
+            :doi:`10.1016/0012-365X(77)90009-7`
+
 .. [Spe2013] \D. Speyer, *An infinitely generated upper cluster algebra*,
              :arxiv:`1305.6867`.
 
@@ -5842,6 +5896,10 @@ REFERENCES:
             Hall-Littlewood vertex operators and generalized Kostka polynomials.
             Adv. Math. 158 (2001), no. 1, 66-85.
 
+.. [Sze1988] \G. Szekeres.
+            *A note on skew type orthogonal ±1 matrices*,
+            Combinatorics, Colloquia Mathematica Societatis, Janos Bolyai, 52 (1988): 489-498.
+
 .. _ref-T:
 
 **T**
@@ -6122,6 +6180,11 @@ REFERENCES:
              pages 150--168, 1932,
              `available on JSTOR <http://www.jstor.org/stable/2371086>`_
 
+.. [Whi1971] \A. Whiteman.
+            *An infinite family of skew Hadamard matrices*,
+            Pacific Journal of Mathematics 38(3) (1971): 817-822.
+            :doi:`10.2140/pjm.1971.38.817`
+
 .. [White2015] Noah White.
                *The monodromy of real Bethe vectors for the Gaudin model*.
                J. Combin. Algebra, **2** no. 3 (2018). pp. 259-300.

src/sage/arith/long.pxd

@@ -1,3 +1,4 @@
+# sage.doctest: optional - sage.misc.cython
 r"""
 Fast conversion of Python objects to C long
 """
@@ -113,7 +114,7 @@ cdef inline bint integer_check_long(x, long* value, int* err) except -1:
 
     We create a pure Python wrapper of this function::
 
-        sage: cython('''  # optional - sage.misc.cython
+        sage: cython('''
         ....: from sage.arith.long cimport *
         ....: from sage.rings.integer cimport smallInteger
         ....: def check_long(x):
@@ -246,7 +247,7 @@ cdef inline bint integer_check_long_py(x, long* value, int* err):
 
     We create a pure Python wrapper of this function::
 
-        sage: cython('''  # optional - sage.misc.cython
+        sage: cython('''
         ....: from sage.arith.long cimport *
         ....: def check_long_py(x):
         ....:     cdef long value
@@ -270,6 +271,17 @@ cdef inline bint integer_check_long_py(x, long* value, int* err):
         sage: L += [-x for x in L] + [0, long_min()]
         sage: for v in L:
         ....:     assert check_long_py(int(v)) == v
+        sage: check_long_py(int(2^60))
+        1152921504606846976                 # 64-bit
+        'Overflow (...)'                    # 32-bit
+        sage: check_long_py(int(2^61))
+        2305843009213693952                 # 64-bit
+        'Overflow (...)'                    # 32-bit
+        sage: check_long_py(int(2^62))
+        4611686018427387904                 # 64-bit
+        'Overflow (...)'                    # 32-bit
+        sage: check_long_py(int(2^63))
+        'Overflow (...)'
         sage: check_long_py(int(2^100))
         'Overflow (...)'
         sage: check_long_py(int(long_max() + 1))
@@ -309,7 +321,12 @@ cdef inline bint integer_check_long_py(x, long* value, int* err):
 
     cdef long lead
     cdef long lead_2_overflow = (<long>1) << (BITS_IN_LONG - PyLong_SHIFT)
-    cdef long lead_3_overflow = (<long>1) << (BITS_IN_LONG - 2 * PyLong_SHIFT)
+    cdef long lead_3_overflow
+    if BITS_IN_LONG < 2 * PyLong_SHIFT:
+        # in this case 3 digit is always overflow
+        lead_3_overflow = 0
+    else:
+        lead_3_overflow = (<long>1) << (BITS_IN_LONG - 2 * PyLong_SHIFT)
     if size == 0:
         value[0] = 0
         err[0] = 0
@@ -371,7 +388,7 @@ cdef inline bint is_small_python_int(obj):
 
     EXAMPLES::
 
-        sage: cython('''  # optional - sage.misc.cython
+        sage: cython('''
         ....: from sage.arith.long cimport is_small_python_int
         ....: def is_small_wrapper(x):
         ....:     return is_small_python_int(x)

src/sage/categories/bialgebras.py

@@ -10,7 +10,8 @@
 # *****************************************************************************
 
 from sage.categories.category_types import Category_over_base_ring
-from sage.categories.all import Algebras, Coalgebras
+from sage.categories.algebras import Algebras
+from sage.categories.coalgebras import Coalgebras
 from sage.categories.super_modules import SuperModulesCategory
 from sage.misc.lazy_import import LazyImport
 

src/sage/categories/category.py

@@ -153,7 +153,7 @@ class Category(UniqueRepresentation, SageObject):
 
     This is achieved as follows::
 
-        sage: from sage.categories.all import Category
+        sage: from sage.categories.category import Category
         sage: class EuclideanDomains(Category):
         ....:     # operations on the category itself
         ....:     def super_categories(self):
@@ -201,7 +201,7 @@ class inheritance from ``C.parent_class``.
 
     ::
 
-        sage: from sage.categories.all import Category
+        sage: from sage.categories.category import Category
         sage: from sage.misc.lazy_attribute import lazy_attribute
         sage: class As (Category):
         ....:     def super_categories(self):

src/sage/categories/chain_complexes.py

@@ -46,7 +46,9 @@ def super_categories(self):
             [Category of modules over Ring of integers modulo 9]
 
         """
-        from sage.categories.all import Fields, Modules, VectorSpaces
+        from sage.categories.fields import Fields
+        from sage.categories.modules import Modules
+        from sage.categories.vector_spaces import VectorSpaces
         base_ring = self.base_ring()
         if base_ring in Fields():
             return [VectorSpaces(base_ring)]