{"push_id":725999556,"size":17,"distinct_size":17,"ref":"refs/heads/develop","head":"94888f982d2af27fd48a61950998803809b06a05","before":"00dd1e2993205e56bd3d5a12f7c477329c862746","commits":[{"sha":"e89bf4d44a760b2c006b3c1557438e57dfd5a846","author":{"email":"01f561ac4ab15d6a23a57976bba4dbcc423b9cbb@sagemath.org","name":"Release Manager"},"message":"Trac #18880: Doctests of database_gap happen to depend on gap_packages\n\nStarting with 6.8beta8, these two doctests :\n{{{\nsage -t --long --warn-long 65.9\nsrc/sage/groups/perm_gps/permgroup_named.py  # 2 doctests failed\nsage -t --long --warn-long 65.9 src/sage/tests/gap_packages.py  # 1\ndoctest failed\n}}}\nfail with {{{database_gap}}} installed but succeed after installation of\n{{{gap_packages}}}.\nhttps://github.com/sagemath/sage/pull/43\n\nURL: http://trac.sagemath.org/18880\nReported by: github/dimpase\nTicket author(s): Dima Pasechnik\nReviewer(s): Volker Braun","distinct":true,"url":"https://api.github.com/repos/vbraun/sage/commits/e89bf4d44a760b2c006b3c1557438e57dfd5a846"},{"sha":"eddb17d6dca9888340f0334eae2ce18f59453afe","author":{"email":"01f561ac4ab15d6a23a57976bba4dbcc423b9cbb@sagemath.org","name":"Release Manager"},"message":"Trac #18881: Remove comparison boilerplate - part 1\n\nNow that #18329 is merged, we can remove\n{{{\n    def __richcmp__(left, right, int op):\n        return (<Element>left)._richcmp(right, op)\n\n    def __cmp__(left, right):\n        return (<Element>left)._cmp(right)\n}}}\n\nSince there are a lot of changes like this to be made, this ticket only\ndoes part of them (in directories where just a few changes needed to be\nmade).\n\nURL: http://trac.sagemath.org/18881\nReported by: jdemeyer\nTicket author(s): Jeroen Demeyer\nReviewer(s): Ralf Stephan","distinct":true,"url":"https://api.github.com/repos/vbraun/sage/commits/eddb17d6dca9888340f0334eae2ce18f59453afe"},{"sha":"18f22f600fb7cea8ddccc978160134b9108a2cb0","author":{"email":"01f561ac4ab15d6a23a57976bba4dbcc423b9cbb@sagemath.org","name":"Release Manager"},"message":"Trac #16773: Analytic Rank Bound\n\nImplement functionality to bound from above the analytic rank of a\nrational elliptic curve. This uses the zero sum method as described in\n[http://msp.org/obs/2013/1-1/obs-v1-n1-p07-s.pdf]. Because this avoids\ncomputing with the curve's L-function directly, it is often faster than\ntraditional analytic rank techniques.\n\nThe enhancement also includes functionality to compute more general zero\nsums for an elliptic curve L-function, as well as computing with the\nlogarithmic derivative. The elliptic_curves object in Sage has also been\nmodified to contain examples of elliptic curves up to rank 28. To this\nend the elliptic_curves spkg has been updated to version 0.8. The zipped\ndata file for the spkg can be obtained at\n[http://www.math.washington.edu/~mlungu/files/elliptic_curves-0.8.tar.bz\n2]\n\nComplete working sage install with docs built:\n[https://cloud.sagemath.com/projects/8499bab7-d4a5-4956-acd2-248b5550731\nd/files/sage/]\n\nBuilt HTML documentation files (as public, this will work later this\nweek, but not now...)\n\n[https://cloud.sagemath.com/8499bab7-d4a5-4956-acd2-248b5550731d/raw/sag\ne/src/doc/output/html/en/reference/lfunctions/sage/lfunctions/zero_sums.\nhtml#sage.lfunctions.zero_sums.LFunctionZeroSum]\n[https://cloud.sagemath.com/8499bab7-d4a5-4956-acd2-248b5550731d/raw/sag\ne/src/doc/output/html/en/reference/plane_curves/sage/schemes/elliptic_cu\nrves/ell_rational_field.html#sage.schemes.elliptic_curves.ell_rational_f\nield.EllipticCurve_rational_field.analytic_rank_upper_bound]\n\nURL: http://trac.sagemath.org/16773\nReported by: spice\nTicket author(s): Simon Spicer\nReviewer(s): William Stein","distinct":true,"url":"https://api.github.com/repos/vbraun/sage/commits/18f22f600fb7cea8ddccc978160134b9108a2cb0"},{"sha":"68108369ca8d8b89efde89bf422c70ac2bfa2c81","author":{"email":"01f561ac4ab15d6a23a57976bba4dbcc423b9cbb@sagemath.org","name":"Release Manager"},"message":"Trac #18748: Python library to bootstrap Sage\n\nMove the logic behind package handling and I/O for Python scripts into a\nseparate Python library for code reuse and automated testing.\n\nURL: http://trac.sagemath.org/18748\nReported by: vbraun\nTicket author(s): Volker Braun\nReviewer(s): John Palmieri","distinct":true,"url":"https://api.github.com/repos/vbraun/sage/commits/68108369ca8d8b89efde89bf422c70ac2bfa2c81"},{"sha":"4f5c894399e230420a3d4089b26bd3b64fc3ac87","author":{"email":"01f561ac4ab15d6a23a57976bba4dbcc423b9cbb@sagemath.org","name":"Release Manager"},"message":"Trac #18784: Tutte connectors for matroids\n\nTutte's linking theorem states that if   `S`, `T` are disjoint subsets\nof the ground set of a matroid `M`, then\n `\\min\\{\\lambda_M(X): S\\subseteq X, X\\cap T =\\emptyset\\}`\nequals\n `\\max\\{\\lambda_N(S): E(N)=S\\cup T, N= M/I\\setminus J\\}`\nHere `\\lambda_M(X):=r_M(X)+r_M(E-X)-r_M(E)` is the connectivity of `X`\nin `M`.\n\nWrite a function that  outputs both an optimal `X` (a  min separation)\nand an optimal `I` (a max connector) as in Tutte's linking theorem.\n\nURL: http://trac.sagemath.org/18784\nReported by: Rudi\nTicket author(s): Rudi Pendavingh\nReviewer(s): Chao Xu","distinct":true,"url":"https://api.github.com/repos/vbraun/sage/commits/4f5c894399e230420a3d4089b26bd3b64fc3ac87"},{"sha":"985c201c586ed736140b682c161d1c86d8d6adc8","author":{"email":"01f561ac4ab15d6a23a57976bba4dbcc423b9cbb@sagemath.org","name":"Release Manager"},"message":"Trac #18618: sandpile revisions\n\nSummary of sandpile.py changes from version 2.3 to 2.4\nJune 11, 2015\n\n 1. Eliminated dependence on 4ti2, substituting the use of Polyhedron\nmethods.  Thus, no optional packages are necessary.\n 2. Fixed bug in Sandpile.__init__ so that now multigraphs are handled\ncorrectly.\n 3. Created `sandpiles` to handle examples of Sandpiles in analogy with\n`graphs`, `simplicial_complexes`, and `polytopes`.  In the process, we\nimplemented a much faster way of producing the sandpile grid graph.\n 4. Added support for open and closed sandpile Markov chains.\n 5. Added support for Weierstrass points.\n 6. Implemented the Cori-Le Borgne algorithm for computing ranks of\ndivisors on complete graphs.\n\nNEW METHODS\n\n**Sandpile**\n * avalanche_polynomial      -- the avalance polynomial\n * genus                     -- genus of the sandpile graph (undirected\ncase only)\n * group_gens                -- minimal set of generators for the\nsandpile group\n * help                      -- list of Sandpile-specific methods\n * jacobian_representatives  -- representatives for elements of the\nJacobian group\n * markov_chain              -- open and closed sandpile Markov chain\n * picard_representatives    -- representatives for elements of the\nPicard group\n * smith_form                -- Smith normal from for transpose of the\nLaplacian\n * stable_configs            -- iterator for all stable configurations\n * stationary_density        -- the stationary density for the closed\nsandpile Markov chain\n * tutte_polynomial          -- Tutte polynomial of underlying graph\n(undirected case only)\n\n**!SandpileConfig**\n * burst_size                -- statistic for sandpile Markov chain\n * help                      -- list of !SandpileConfig methods\n\n**!SandpileDivisor**\n * help                      -- list of !SandpileDivisor methods\n * is_linearly_equivalent    -- Is the divisor linearly equivalent to a\ngiven divisor?\n * is_q_reduced              -- Is the divisor q-reduced (q=sink)\n * is_weierstrass_pt         -- Is the given vertex a Weierstrass pt for\nthe divisor?\n * polytope                  -- polytope determining the complete linear\nsystem\n * polytope_integer_pts      -- integer points inside the divisor's\npolytope\n * q_reduced                 -- linearly equiv. q-reduced divisor\n * rank                      -- the rank of the divisor\n * simulate_threshold        -- simulate closed sandpile Markov chain\nuntil threshold\n * stabilize                 -- stabilize, if possible\n * weierstrass_div           -- the Weierstrass divisor\n * weierstrass_gap_seq       -- the Weierstrass gap sequence for the\ngiven vertex\n * weierstrass_pts           -- all Weierstrass points (vertices) for\nthe divisor\n * weierstrass_rank_seq      -- the rank sequence at a Weierstrass point\n\nDEPRECATED\n * !SandpileDivisor.linear_system -- uses 4ti2.  Replaced by\n!SandpileDivisor.polytope.\n * !SandpileDivisor.r_of_D -- uses 4ti2.  Replaced by\n!SandpileDivisor.rank.\n * sandlib method -- replaced by `sandpiles`\n * complete_sandpile -- replaced by sandpiles.Complete\n * grid_sandpile -- replaced by sandpiles.Grid\n * triangle_sandpile -- Not used much.  Will still be able to import.\n * aztec_sandpile -- Not used much.  Will still be able to import.\n * random_digraph -- Duplicates methods from graphs and digraphs, more\nor less.\n * random_tree -- Duplicates method from graphs and digraphs, more or\nless.\n * glue_graphs -- Not used much.  Will still be able to import.\n * admissible_partitions -- Not used much.  Will still be able to\nimport.\n * firing_vector -- Replaced by !SandpileDivisor.is_linearly_equivalent.\n * min_cycles -- Not used much.  Will still be able to import.\n\nMINOR CHANGES\n * The `sink` argument to Sandpile.__init__ now defaults to the first\nvertex.\n * A !SandpileConfig or !SandpileDivisor may now be multiplied by an\ninteger.\n * Sped up __add__ method for !SandpileConfig and !SandpileDivisor.\n * Enhanced string representation of a Sandpile (via _repr_ and the\n`name` method).\n * Recurrents for complete graphs and cycle graphs are computed more\nquickly.\n * The stabilization code for !SandpileConfig has been made more\nefficient.\n * Added optional probability distribution arguments to `add_random`\nmethods.\n\nURL: http://trac.sagemath.org/18618\nReported by: dperkinson\nTicket author(s): David Perkinson\nReviewer(s): Qiaoyu Yang, Kaui Yu","distinct":true,"url":"https://api.github.com/repos/vbraun/sage/commits/985c201c586ed736140b682c161d1c86d8d6adc8"},{"sha":"ebfaf96ca9ca9081aa6906ef1272d2302709cc1f","author":{"email":"01f561ac4ab15d6a23a57976bba4dbcc423b9cbb@sagemath.org","name":"Release Manager"},"message":"Trac #18782: DejterGraph, F26AGraph, HarborthGraph, Klein3RegularGraph, Klein7RegularGraph, LocalMcLaughlinGraph\n\nThis branch adds the following graph constructors:\n\n!DejterGraph\n!F26AGraph\n!HarborthGraph\n!Klein3RegularGraph\n!Klein7RegularGraph\n!LocalMcLaughlinGraph\n\nNathann\n\nURL: http://trac.sagemath.org/18782\nReported by: ncohen\nTicket author(s): Nathann Cohen\nReviewer(s): David Coudert","distinct":true,"url":"https://api.github.com/repos/vbraun/sage/commits/ebfaf96ca9ca9081aa6906ef1272d2302709cc1f"},{"sha":"111e20c5ae1b20b37c7a61a66c03e0b20fba8f73","author":{"email":"01f561ac4ab15d6a23a57976bba4dbcc423b9cbb@sagemath.org","name":"Release Manager"},"message":"Trac #18884: Remove comparison boilerplate - part 2\n\nURL: http://trac.sagemath.org/18884\nReported by: jdemeyer\nTicket author(s): Jeroen Demeyer\nReviewer(s): Ralf Stephan","distinct":true,"url":"https://api.github.com/repos/vbraun/sage/commits/111e20c5ae1b20b37c7a61a66c03e0b20fba8f73"},{"sha":"b74ea09fbc2ce4f5d1585c376be7d7c15d8d15d4","author":{"email":"01f561ac4ab15d6a23a57976bba4dbcc423b9cbb@sagemath.org","name":"Release Manager"},"message":"Trac #18893: Fix \"start\" dependencies\n\nURL: http://trac.sagemath.org/18893\nReported by: jdemeyer\nTicket author(s): John Palmieri\nReviewer(s): Jeroen Demeyer","distinct":true,"url":"https://api.github.com/repos/vbraun/sage/commits/b74ea09fbc2ce4f5d1585c376be7d7c15d8d15d4"},{"sha":"41183d782a8c203a3fc0bd4f0404ade5fe8b4cba","author":{"email":"01f561ac4ab15d6a23a57976bba4dbcc423b9cbb@sagemath.org","name":"Release Manager"},"message":"Trac #18642: Wrong sys.path order in sagedoc\n\nSee https://groups.google.com/d/msg/sage-\nsupport/tlK249DKaMs/uMIzWIVpVXYJ\n\nSteps to reproduce\n{{{\n$ touch conf.py\n$ sage\n[...]\nsage: PolynomialRing?\n[...]\n/usr/lib/python2.7/site-packages/sage/misc/sagedoc.pyc in\nprocess_extlinks(s, embedded)\n    354     oldpath = sys.path\n    355     sys.path = oldpath + [os.path.join(SAGE_DOC, 'common')]\n--> 356     from conf import pythonversion, extlinks\n    357     sys.path = oldpath\n    358     for key in extlinks:\n\nImportError: No module named conf\n}}}\n\nURL: http://trac.sagemath.org/18642\nReported by: vbraun\nTicket author(s): Volker Braun\nReviewer(s): Jeroen Demeyer","distinct":true,"url":"https://api.github.com/repos/vbraun/sage/commits/41183d782a8c203a3fc0bd4f0404ade5fe8b4cba"},{"sha":"8a0a97efd132bfef8b30f880384d56206b843c9f","author":{"email":"01f561ac4ab15d6a23a57976bba4dbcc423b9cbb@sagemath.org","name":"Release Manager"},"message":"Trac #18788: Reorganize /build\n\nProposal: Make /build the root for the `sage_bootstrap` Python module\n* /build/sage_bootstrap/...\n* /build/setup.py\n* /build/tox.ini\n* /build/bin/sage-package\n* /build/bin/sage-spkg\n\nKeep the current package metadata at\n* /build/pkgs/...\n\nMove the makefile stuff to\n* /build/make/Makefile\n* /build/make/deps\n* /build/make/pipestatus\n* /build/make/install\n* /build/make/...\n\nURL: http://trac.sagemath.org/18788\nReported by: vbraun\nTicket author(s): Volker Braun\nReviewer(s): Jeroen Demeyer","distinct":true,"url":"https://api.github.com/repos/vbraun/sage/commits/8a0a97efd132bfef8b30f880384d56206b843c9f"},{"sha":"4ae1b3ab51f75a0d4b7b4c68b08427cbb4d089b9","author":{"email":"01f561ac4ab15d6a23a57976bba4dbcc423b9cbb@sagemath.org","name":"Release Manager"},"message":"Trac #18795: Fix parent class of a base extension of formal sums\n\nThe following is a bug that becomes critical in #18758:\n{{{\nsage: FormalSums(ZZ).base_extend(GF(7))\nAbelian Group of all Formal Finite Sums over Finite Field of size 7\nsage: isinstance(_, _.category().parent_class)\nFalse\n}}}\n\nURL: http://trac.sagemath.org/18795\nReported by: SimonKing\nTicket author(s): Simon King\nReviewer(s): Travis Scrimshaw","distinct":true,"url":"https://api.github.com/repos/vbraun/sage/commits/4ae1b3ab51f75a0d4b7b4c68b08427cbb4d089b9"},{"sha":"77b3bbb6d042f8e5d4d60d9ef71a596420b85ee7","author":{"email":"01f561ac4ab15d6a23a57976bba4dbcc423b9cbb@sagemath.org","name":"Release Manager"},"message":"Trac #18796: Python 3 preparation: Cleaning up the bit rot that occurred  to a number of Python 3 fixes\n\nA number of the Python 3 tickets that are tracked in #15980 and that had\nbeen closed have to be addressed again: instances of the migration\nproblems that they fixed have surfaced again.\n\nURL: http://trac.sagemath.org/18796\nReported by: wluebbe\nTicket author(s): Wilfried Luebbe\nReviewer(s): Jeroen Demeyer","distinct":true,"url":"https://api.github.com/repos/vbraun/sage/commits/77b3bbb6d042f8e5d4d60d9ef71a596420b85ee7"},{"sha":"d40ec96f076f8b73712599a928b82401e01cb342","author":{"email":"01f561ac4ab15d6a23a57976bba4dbcc423b9cbb@sagemath.org","name":"Release Manager"},"message":"Trac #18841: giacpy and giac spkg update\n\n. The giacpy 0.4.8 interface has a bad sig_on() in Pygen {{{__iter__}}}\n. dependencies files were missing for giac and giacpy\n\nthe new upstream tar ball of giacpy is:\n[http://webusers.imj-\nprg.fr/~frederic.han/xcas/giacpy/sage/giacpy-0.5.1.tar.gz]\n\nThe giac 1.2.0-15 or later upstream source has an interesting fix for\ngroebner basis: in 1.2.0-13 the answer of gbasis could contain some\nextra null terms.\n\nthe giac tarball to put in upstream/ is here. (it was generated with\nspkg-src from giac 1.2.0-19)\n[http://webusers.imj-\nprg.fr/~frederic.han/xcas/sage/giac-1.2.0.19.tar.gz]\n\n-------\n\nNB: to see the modifications about giacpy, the git repository of giacpy\nis:\n[https://gitlab.math.univ-paris-diderot.fr/han/giacpy-sage]\n\nURL: http://trac.sagemath.org/18841\nReported by: frederichan\nTicket author(s): Frederic Han\nReviewer(s): Jeroen Demeyer","distinct":true,"url":"https://api.github.com/repos/vbraun/sage/commits/d40ec96f076f8b73712599a928b82401e01cb342"},{"sha":"c8827a2d3e821e0ff6515ae2f2ff3b73b0c6f8ed","author":{"email":"01f561ac4ab15d6a23a57976bba4dbcc423b9cbb@sagemath.org","name":"Release Manager"},"message":"Trac #18872: Pari workarond for Perl regex deprecation\n\nPerl 5.21.1 throws warnings for unescaped '{', and pari treats warnings\nas errors by default. Patch taken from\n\nhttps://projects.archlinux.org/svntogit/community.git/tree/trunk/no_warn\nings_fatal.patch?h=packages/pari-sage\n\n'''Upstream report''': [http://pari.math.u-bordeaux.fr/cgi-\nbin/bugreport.cgi?bug=1726]\n\nURL: http://trac.sagemath.org/18872\nReported by: vbraun\nTicket author(s): Volker Braun, Jeroen Demeyer\nReviewer(s): Volker Braun","distinct":true,"url":"https://api.github.com/repos/vbraun/sage/commits/c8827a2d3e821e0ff6515ae2f2ff3b73b0c6f8ed"},{"sha":"9e8169d852616ec6d1b786a191b22ea981b33a5a","author":{"email":"01f561ac4ab15d6a23a57976bba4dbcc423b9cbb@sagemath.org","name":"Release Manager"},"message":"Trac #18887: latte_int does not build with NTL 9\n\nThe upgrade in #18875 has broken building of latte_int.\n\nURL: http://trac.sagemath.org/18887\nReported by: dimpase\nTicket author(s): Dima Pasechnik\nReviewer(s): Jeroen Demeyer","distinct":true,"url":"https://api.github.com/repos/vbraun/sage/commits/9e8169d852616ec6d1b786a191b22ea981b33a5a"},{"sha":"94888f982d2af27fd48a61950998803809b06a05","author":{"email":"01f561ac4ab15d6a23a57976bba4dbcc423b9cbb@sagemath.org","name":"Release Manager"},"message":"Trac #16124: dev scripts can not handle merged tickets\n\nMerging dependencies fails when one of the tickets has already been\nmerged. In\nthis case the branch field of the ticket does not contain an actual\nbranch but\na commit hash.\n\nURL: http://trac.sagemath.org/16124\nReported by: saraedum\nTicket author(s): Julian Rueth\nReviewer(s): Volker Braun","distinct":true,"url":"https://api.github.com/repos/vbraun/sage/commits/94888f982d2af27fd48a61950998803809b06a05"}]}