1. 03 Jun, 2015 3 commits
  2. 02 Jun, 2015 3 commits
  3. 01 Jun, 2015 2 commits
  4. 29 May, 2015 6 commits
  5. 28 May, 2015 12 commits
  6. 27 May, 2015 14 commits
    • Release Manager's avatar
      Trac #18522: Add a couple git tutorials etc. · f123a95c
      Release Manager authored
      Some slight reorganization as well.
      
      URL: http://trac.sagemath.org/18522
      Reported by: kcrisman
      Ticket author(s): Karl-Dieter Crisman
      Reviewer(s): Nathann Cohen
      f123a95c
    • Release Manager's avatar
      Trac #18479: DirichletCharacter.minimize_base_ring() raises an error for some base rings · 3ef0bd93
      Release Manager authored
      The following bug was found in comment:13:ticket:18086:
      {{{
      sage: f = Newforms(Gamma1(25), names='a')[1]
      sage: eps = f.character()
      sage: eps.base_ring()
      Number Field in a1 with defining polynomial x^8 + 5*x^7 + 11*x^6 +
      10*x^5 + x^4 + 10*x^3 + 26*x^2 - 10*x + 1
      sage: eps.minimize_base_ring()
      Traceback (most recent call last):
      ...
      TypeError: No compatible natural embeddings found for Complex Lazy Field
      and Number Field in a1 with defining polynomial x^8 + 5*x^7 + 11*x^6 +
      10*x^5 + x^4 + 10*x^3 + 26*x^2 - 10*x + 1
      }}}
      This also causes
      {{{
      sage: ModularForms(eps, 2)
      Traceback (most recent call last):
      ...
      TypeError: No compatible natural embeddings found for Complex Lazy Field
      and Number Field in a1 with defining polynomial x^8 + 5*x^7 + 11*x^6 +
      10*x^5 + x^4 + 10*x^3 + 26*x^2 - 10*x + 1
      }}}
      This error is similar to #18436.
      
      The attached branch fixes the bug by wrapping the conversion to the
      smaller field in a `try` block.  We also improve the code in
      `DirichletCharacter.minimize_base_ring()` and the function
      `sage.modular.modsym.canonical_parameters()`, which uses
      `minimize_base_ring()`.
      
      URL: http://trac.sagemath.org/18479
      Reported by: pbruin
      Ticket author(s): Peter Bruin
      Reviewer(s): David Loeffler
      3ef0bd93
    • Volker Braun's avatar
      Updated Sage version to 6.8.beta1 · 0ce29a1e
      Volker Braun authored
      0ce29a1e
    • Release Manager's avatar
      Trac #18524: correct some bad formatting of INPUT · 9298ca47
      Release Manager authored
      There are a few instances of badly formatted "INPUT::"
      
      let us correct them all
      
      URL: http://trac.sagemath.org/18524
      Reported by: chapoton
      Ticket author(s): Frédéric Chapoton
      Reviewer(s): Jeroen Demeyer
      9298ca47
    • Release Manager's avatar
      Trac #18515: LatticePoset: add sublattice() · ee1ad5e6
      Release Manager authored
      Add a function to get smallest sublattice of the lattice containing
      given elements.
      
      URL: http://trac.sagemath.org/18515
      Reported by: jmantysalo
      Ticket author(s): Jori Mäntysalo, Nathann Cohen
      Reviewer(s): Nathann Cohen, Jori Mäntysalo
      ee1ad5e6
    • Release Manager's avatar
      Trac #18501: FAQ how-do-I-get-started typos · 829dc3f6
      Release Manager authored
      Fix typos at
      
      http://doc.sagemath.org/html/en/faq/faq-usage.html#how-do-i-get-started
      
      and remove references to sagenb.org, which has been deprecated.
      
      URL: http://trac.sagemath.org/18501
      Reported by: ursula
      Ticket author(s): Ursula Whitcher
      Reviewer(s): Rob Beezer
      829dc3f6
    • Release Manager's avatar
      Trac #18499: add documentation for symbolic series arithmetics · f6dff102
      Release Manager authored
      It is undocumented that expressions containing series (that result from
      operations with them) can be "expanded" by applying `series` again.
      {{{
      sage: (1/(1-x)).series(x, 3)+(1/(1+x)).series(x,3)
      (1 + (-1)*x + 1*x^2 + Order(x^3)) + (1 + 1*x + 1*x^2 + Order(x^3))
      sage: _.series(x,3)
      2 + 2*x^2 + Order(x^3)
      sage: (1/(1-x)).series(x, 3)*(1/(1+x)).series(x,3)
      (1 + (-1)*x + 1*x^2 + Order(x^3))*(1 + 1*x + 1*x^2 + Order(x^3))
      sage: _.series(x,3)
      1 + 1*x^2 + Order(x^3)
      }}}
      
      GiNaC quote:
      "...if you want to work with series, i.e. multiply two series, you need
      to call the method ex::series again to convert it to a series object
      with the usual structure (expansion plus order term)."
      
      URL: http://trac.sagemath.org/18499
      Reported by: rws
      Ticket author(s): Karen Kohl
      Reviewer(s): Ralf Stephan
      f6dff102
    • Release Manager's avatar
      Trac #18474: Python 3: The semantic of map() function is changed (part3) · af1cdc3f
      Release Manager authored
      This ticket is part of #16073 to simplify review.
      
      In Py2 {{{map()}}} returns a list, while in Py3 {{{map()}}} returns an
      iterator.
      
      URL: http://trac.sagemath.org/18474
      Reported by: aapitzsch
      Ticket author(s): André Apitzsch
      Reviewer(s): Wilfried Lübbe
      af1cdc3f
    • Release Manager's avatar
      Trac #18473: Python 3: The semantic of map() function is changed (part2) · 87393b4d
      Release Manager authored
      This ticket is part of #16073 to simplify review.
      
      In Py2 {{{map()}}} returns a list, while in Py3 {{{map()}}} returns an
      iterator.
      
      URL: http://trac.sagemath.org/18473
      Reported by: aapitzsch
      Ticket author(s): André Apitzsch
      Reviewer(s): Wilfried Lübbe
      87393b4d
    • Release Manager's avatar
      Trac #18467: PolynomialRealDense.quo_rem() returns zero polynomials with wrong degree · bd6987cf
      Release Manager authored
      In Sage 6.7, the following is correct:
      {{{
      sage: R.<x> = QQ[]
      sage: z = R.zero()
      sage: z.degree()
      -1
      sage: q, r = z.quo_rem(x)
      sage: q.degree()
      -1
      }}}
      The following (`QQ` -> `RR`) is not:
      {{{
      sage: S.<x> = RR[]
      sage: z = S.zero()
      sage: z.degree()
      -1
      sage: q, r = z.quo_rem(x)
      sage: q.degree()
      -2
      }}}
      The last result should be `-1`; the given answer implies for example
      {{{
      sage: q == z
      False
      }}}
      which is nonsense since `q` and `z` are both the zero polynomial.
      
      URL: http://trac.sagemath.org/18467
      Reported by: pbruin
      Ticket author(s): Peter Bruin
      Reviewer(s): Bruno Grenet
      bd6987cf
    • Release Manager's avatar
      Trac #18375: Drop the NetworkX graph backend · e1dd16e2
      Release Manager authored
      This branch deprecates the `NetworkX` backend for graphs. Indeed, while
      it made
      sense to keep a `NetworkXGraphBackend` when Sage's default data
      structure
      switched from `networkx` to `c_graphs`, we do not *need* it anymore.
      
      This does not mean that Sage should not have a `NetworkX` data structure
      (though
      there is little use). On the other hand, `NetworkX` is the only reason
      why we
      have a `Backend` layer in Sage's graph data structures, as all others
      are
      `CGraph` backends.
      
      Thus, in order to simplify the hierarchy of classes for graph data
      structures,
      it is easier to uniformize our data structures first. When this series
      of
      patches will be finished and when the graph backends will be in a
      clearer and
      simpler state, it will be possible to implement a new `NetworkX`
      backend.
      
      It makes little sense, however, to rewrite the current networkx backend
      as a
      `c_graph` backend when it will have to be rewritten again later during
      the
      refactoring.
      
      Technical info:
      
      - The main problem in this branch was the handling of (old) graph
      pickles. As
        the classes themselves are being deprecated, the `__setstate__`
      functions
        detect whenever an attribute uses a deprecated class, and in this case
      convert
        it into a non-deprecated data structure (sparse graph, by default).
      
      - Two `random_stress` functions are removed, as they work by comparing
      the
        behaviour of `c_graph` and `networkx` backend. This is not as terrible
      as it
        sounds, for graphs are tested extensively in many places of Sage (I am
      often
        surprised to find out where they are used when code breaks)
      
      URL: http://trac.sagemath.org/18375
      Reported by: ncohen
      Ticket author(s): Nathann Cohen
      Reviewer(s): David Coudert
      e1dd16e2
    • Release Manager's avatar
      Trac #17633: Cygwin numerical noise · 2934f008
      Release Manager authored
      Many doctests fail on cygwin64 only because of numerical noise. For
      instance, `RDF(e)` yields `2.718281828459045` on linux, but
      `2.7182818284590455` on cygwin.
      
      This patch adds numerical tolerance to the failing doctests, to let them
      pass.
      
      URL: http://trac.sagemath.org/17633
      Reported by: gouezel
      Ticket author(s): Sebastien Gouezel
      Reviewer(s): Jean-Pierre Flori
      2934f008
    • Release Manager's avatar
      Trac #17492: Speedup k-closed check · 7da58bd2
      Release Manager authored
      Right now, checking for k-closed is slow because it uses Sage sets
      whereas we only need python sets.
      
      URL: http://trac.sagemath.org/17492
      Reported by: tscrim
      Ticket author(s): Travis Scrimshaw
      Reviewer(s): Rudi Pendavingh
      7da58bd2
    • Ben Salisbury's avatar
      Documentation changes per review · 3ddc20b6
      Ben Salisbury authored
      3ddc20b6