Merge branch 'develop' into fix_some_cannot

.github/ISSUE_TEMPLATE.md

@@ -1,3 +1 @@
-Unfortunately we are not accepting issues on GitHub yet. To report an issue,
-please head over to https://trac.sagemath.org, log in with your GitHub account,
-and create a ticket there :)
+Details to be added shortly, meanwhile feel free to open issues and PRs

.github/PULL_REQUEST_TEMPLATE.md

@@ -1,8 +1,4 @@
-Thanks for contributing to Sage! Unfortunately we are not accepting pull
-requests on GitHub yet. To propose a change to Sage, please log in with your
-GitHub account at https://trac.sagemath.org, create a ticket, and push your
-changes to that ticket as explained in our
-[Developer's Guide](https://doc.sagemath.org/html/en/developer/manual_git.html).
+Thanks for contributing to Sage! Detailed instructions to be added shortly.
 
 Please make sure to also have a look at our
 [Code Style Conventions](https://doc.sagemath.org/html/en/developer/coding_basics.html).

build/pkgs/sagemath_doc_html/dependencies

@@ -1,4 +1,4 @@
-sagelib sphinx pplpy_doc | $(SAGERUNTIME) maxima networkx scipy sympy matplotlib pillow mathjax mpmath ipykernel jupyter_client conway_polynomials tachyon jmol ipywidgets jupyter_sphinx sage_docbuild elliptic_curves furo
+sagelib sphinx pplpy_doc | $(SAGERUNTIME) maxima networkx scipy sympy matplotlib pillow mathjax mpmath ipykernel jupyter_client conway_polynomials tachyon jmol ipywidgets jupyter_sphinx sage_docbuild elliptic_curves furo fpylll
 
 # Building the documentation has many dependencies, because all
 # documented modules are imported and because we use matplotlib to

src/sage/algebras/quantum_groups/quantum_group_gap.py

@@ -2689,4 +2689,3 @@ def _unpickle_generic_element(parent, data):
         ret.append(libgap(data[2 * i]))
         ret.append(one * libgap(data[2 * i + 1].subs(q=parent._libgap_q)))
     return parent.element_class(parent, F.ObjByExtRep(ret))
-

src/sage/combinat/vector_partition.py

@@ -333,4 +333,3 @@ def __iter__(self):
                             new_parts = self._parts[i+1:]
                     for vecpar in VectorPartitions(new_vec, min=self._min, parts=new_parts, distinct=self._distinct, is_repeatable=self._is_repeatable):
                         yield self.element_class(self, [list(part)] + list(vecpar))
-

src/sage/modular/modform/notes.py

@@ -1,4 +1,4 @@
-"""
+r"""
 Design notes
 
 The implementation depends on the fact that we have dimension formulas

src/sage/rings/generic.py

@@ -257,4 +257,3 @@ def __iter__(self):
             yield self.df
 
     return tuple(prod(_aux(*tup) for tup in pairs))
-

src/sage/sat/solvers/dimacs.py

@@ -357,7 +357,7 @@ def render_dimacs(clauses, filename, nlits):
         fh.close()
 
     def _run(self):
-        """
+        r"""
         Run 'command' and collect output.
 
         TESTS:
@@ -752,4 +752,3 @@ class Kissat(DIMACS):
     """
 
     command = "kissat -q {input}"
-

src/sage/schemes/elliptic_curves/ell_number_field.py

@@ -2301,9 +2301,9 @@ def gens(self, **kwds):
 
         Check that the the point found has infinite order, and that it is on the curve::
 
-            sage: P=gg[0]; P.order()
+            sage: P=gg[0]; P.order()  # long time
             +Infinity
-            sage: E.defining_polynomial()(*P)
+            sage: E.defining_polynomial()(*P)  # long time
             0
 
         Here is a curve of rank 2::