GitHub PushEvent at 2014-07-20 01:18:49
Repository: sage
Actor: vbraun
Payload: {"shas":[["84067b74336b4762fff851f1875daf1ca760448a","01f561ac4ab15d6a23a57976bba4dbcc423b9cbb@sagemath.org","Trac #16620: Don't mention setup_latex_preamble in introductory documentation\n\nPreviously, the introductory documentation of {{{graph_latex}}}\nrecommended calling {{{setup_latex_preamble}}}. However, as pointed out\nin http://trac.sagemath.org/ticket/16557#comment:2, this is not\nnecessary: {{{graph._latex_}}} calls {{{setup_latex_preamble}}} anyway.\nTherefore, the corresponding text has now been removed from this\nintroduction.\n\nNote, however, that the tutorial\n(http://www.sagemath.org/doc/tutorial/latex.html#an-example-\ncombinatorial-graphs-with-tkz-graph) has not been touched: there, the\nuse of {{{setup_latex_preamble}}} rather seems to illustrate the\nbehaviour of the {{{latex}}} module.\n\nURL: http://trac.sagemath.org/16620\nReported by: cheuberg\nTicket author(s): Clemens Heuberger\nReviewer(s): Daniel Krenn","Release Manager",true],["375608948c1b35fe03a51916bdae439f12da5b96","01f561ac4ab15d6a23a57976bba4dbcc423b9cbb@sagemath.org","Trac #16666: Extend FiniteStateMachine.product_FiniteStateMachine and Transducer.cartesian_product to products of more than two machines\n\nPreviously, {{{FiniteStateMachine.product_FiniteStateMachine}}} and\n{{{Transducer.cartesian_product}}} were products of two finite state\nmachines {{{self}}} and {{{other}}}, i.e., a product of two machines.\n\nWe now allow {{{other}}} to be a list of machines such that products of\nseveral machines can now be computed.\n\nThat would have been possible before by successive products, but the\noutcome would have been nested pairs, which would then have required\nsome post-processing.\n\nAs a use case, think about looking for occurrences of several blocks\n(using {{{transducers.CountSubblockOccurrences}}}) simultaneously.\n\nURL: http://trac.sagemath.org/16666\nReported by: cheuberg\nTicket author(s): Clemens Heuberger\nReviewer(s): Daniel Krenn","Release Manager",true],["8079c3dd628b8048076682d934e60c4a28136923","01f561ac4ab15d6a23a57976bba4dbcc423b9cbb@sagemath.org","Trac #16680: Improve handling of \"algorithm\" parameter in EllipticCurve_finite_field.cardinality()\n\nThe following doctest in `ell_finite_field.py` can fail (by returning a\ncached result) because the same curve is used in an earlier doctest and\nmay be cached by the `UniqueFactory` from #11474:\n{{{\nsage:\nEllipticCurve(GF(10007),[1,2,3,4,5]).cardinality(algorithm='foobar')\nTraceback (most recent call last):\n...\nValueError: Algorithm is not known\n}}}\nA trivial solution is to use a different curve for this test.\n\nThis ticket also makes the handling of the `algorithm` parameter more\nconsistent and polishes the documentation a bit.\n\nURL: http://trac.sagemath.org/16680\nReported by: pbruin\nTicket author(s): Peter Bruin, Travis Scrimshaw\nReviewer(s): Travis Scrimshaw, Peter Bruin","Release Manager",true],["3f3ea84efca1dfaedd2274e3e5b347aa884bc31f","01f561ac4ab15d6a23a57976bba4dbcc423b9cbb@sagemath.org","Trac #16675: add function that checks if all elements of iterator are the equal\n\nAdds a function\n{{{\nsage: equal([1,1])\nTrue\n}}}\nto the finite state machines module (used in #16674).\n\nURL: http://trac.sagemath.org/16675\nReported by: dkrenn\nTicket author(s): Daniel Krenn\nReviewer(s): Clemens Heuberger, Daniel Krenn","Release Manager",true],["62aeb71182cee11aa677a2770d8b2d72413e2ead","01f561ac4ab15d6a23a57976bba4dbcc423b9cbb@sagemath.org","Trac #16674: add is_monochromatic to finite state machines\n\nAdds a function which tests if all states have the same color.\n\nURL: http://trac.sagemath.org/16674\nReported by: dkrenn\nTicket author(s): Daniel Krenn\nReviewer(s): Clemens Heuberger","Release Manager",true],["1f73f9f43b92b37284f3bbfe92745e5279ebf59e","01f561ac4ab15d6a23a57976bba4dbcc423b9cbb@sagemath.org","Trac #16646: Ordered Set Partitions of size 42\n\nI had the pleasure to remark that to generate '''ordered set partitions\nof size 42''' one has to use Word... and for some obscure reason...\n{{{\nsage: type(Word(Permutations(range(3,52)).first()))\n<class 'sage.combinat.words.word.InfiniteWord_iter_with_caching'>\nsage: type(Word(range(3,52)))\n<class 'sage.combinat.words.word.FiniteWord_list'>\n}}}\nfrom a permutation of size 42 (>39), the word associated is an infinite\nword...\n\n(NOTE: This ticket fix `set_partition_ordered` not `Words`!!)\n\nURL: http://trac.sagemath.org/16646\nReported by: elixyre\nTicket author(s): Jean-Baptiste Priez\nReviewer(s): Frédéric Chapoton","Release Manager",true],["1dfd8ad8b6deb61d6d10c520e5a9613cedba6116","01f561ac4ab15d6a23a57976bba4dbcc423b9cbb@sagemath.org","Trac #16158: Make Spec into a functor\n\nSage's `Spec` command currently produces a `Spec` object that derives\nfrom, but is not the same as, an `AffineScheme`.  The goal of this\nticket is\n- merge the existing `Spec` with `AffineScheme` by moving all existing\nmethods of `Spec` to `AffineScheme`;\n- upgrade `Spec` to a functor from `CommutativeRings` to `Schemes` (or\n`Schemes(A)` if a base ring ''A'' is specified), returning objects of\ntype `AffineScheme`.\n\nExample of the new functionality:\n{{{\nsage: A.<x,y> = QQ[]\nsage: Spec(A)\nSpectrum of Multivariate Polynomial Ring in x, y over Rational Field\nsage: type(Spec(A))\n<class 'sage.schemes.generic.scheme.AffineScheme_with_category'>\nsage: B.<t> = QQ[]\nsage: f = A.hom((t^2, t^3))\nsage: Spec(f)\nAffine Scheme morphism:\n  From: Spectrum of Univariate Polynomial Ring in t over Rational Field\n  To:   Spectrum of Multivariate Polynomial Ring in x, y over Rational\nField\n  Defn: Ring morphism:\n          From: Multivariate Polynomial Ring in x, y over Rational Field\n          To:   Univariate Polynomial Ring in t over Rational Field\n          Defn: x |--> t^2\n                y |--> t^3\n}}}\nTwo small user-visible changes had to be made to accommodate the new\nsituation:\n- If ''S'' = Spec(''A'') is an affine scheme, then the syntax `S(a_1,\n..., a_n)` to construct the topological point of ''S'' defined by the\nprime ideal ''P'' = (''a'',,1,,, ..., ''a,,n,,'') of ''A'' is no longer\nsupported.  The syntax `S(A.ideal(a_1, ..., a_n))` now has to be used\ninstead.  This is because it conflicts with the much more useful\napplication of this syntax to construct the point with coordinates\n(''a'',,1,,, ..., ''a,,n,,'') if ''S'' is (a subscheme of) an affine\nspace '''A'''^''n''^.\n- Given ''S'' = Spec(''A'') and another scheme ''X'', the result of\n`X(A)` is the same as before (a point homset), but `X(S)`, which used to\nbe identical to this, now returns the standard scheme homset.  To get\nthe point homset, one now has to type `X(A)` or\n`X(S.coordinate_ring())`.  This seems the \"principle of least surprise\"\nconvention to me, and it is consistent with the fact that\n`X.point_homset()` only accepts rings, not affine schemes.\n\nMore improvements to affine schemes are made in #7946.\n\nURL: http://trac.sagemath.org/16158\nReported by: pbruin\nTicket author(s): Peter Bruin\nReviewer(s): Travis Scrimshaw","Release Manager",true],["80ad0cec7745c895d9f144db68fc7f3f7ec546d5","01f561ac4ab15d6a23a57976bba4dbcc423b9cbb@sagemath.org","Trac #16617: simple echelon matrix iterator\n\nThe iteration over subspaces over a given vector space takes infinite\ntime (mainly because of complicated constructor in classes). We create\nan external \"echelon_matrix_iterator\" to be used for faster iteration...\n\nMore than incredible:\n{{{\nsage: from sage.matrix.echelon_matrix import echelon_matrix_iterator\nsage: timeit(\"for m in echelon_matrix_iterator(GF(3),3,5): pass\")\n125 loops, best of 3: 3.01 ms per loop\nsage: timeit(\"for _ in VectorSpace(GF(3),5).subspaces(3): pass\")\n5 loops, best of 3: 346 ms per loop\n}}}\nAnd there even a \"faster\" mode which avoids copy\n{{{\nsage: timeit(\"for m in echelon_matrix_iterator(GF(3),3,5,copy=False):\npass\")\n625 loops, best of 3: 392 µs per loop\n}}}\n\nURL: http://trac.sagemath.org/16617\nReported by: vdelecroix\nTicket author(s): Vincent Delecroix\nReviewer(s): Nathann Cohen","Release Manager",true]],"size":8,"ref":"refs/heads/develop","head":"80ad0cec7745c895d9f144db68fc7f3f7ec546d5"}