- 01 Apr, 2014 1 commit
-
-
Peter Bruin authored
fields after base extension
-
- 28 Mar, 2014 5 commits
-
-
Peter Bruin authored
-
Peter Bruin authored
-
Peter Bruin authored
-
Peter Bruin authored
Conflicts: src/sage/schemes/elliptic_curves/ell_number_field.py src/sage/schemes/elliptic_curves/ell_rational_field.py
-
Peter Bruin authored
-
- 27 Mar, 2014 5 commits
-
-
Peter Bruin authored
-
Peter Bruin authored
-
Marc Masdeu authored
Merge branch 'u/pbruin/16022-simon_two_descent_bug' of trac.sagemath.org:sage into gp_simon_relative Conflicts: src/sage/schemes/elliptic_curves/gp_simon.py
-
Marc Masdeu authored
-
Peter Bruin authored
-
- 26 Mar, 2014 3 commits
-
-
Marc Masdeu authored
-
Peter Bruin authored
Merge branch 'u/mmasdeu/9322-defaults-for-two-descent' of git://trac.sagemath.org/sage into ticket/9322-simon_two_descent_defaults Conflicts: src/sage/schemes/elliptic_curves/ell_rational_field.py
-
Marc Masdeu authored
-
- 25 Mar, 2014 7 commits
-
-
Peter Bruin authored
Merge branch 'u/mmasdeu/torsion_relative_number_fields' of git://trac.sagemath.org/sage into develop
-
Marc Masdeu authored
-
Marc Masdeu authored
-
Marc Masdeu authored
-
Marc Masdeu authored
-
Marc Masdeu authored
-
Marc Masdeu authored
-
- 23 Mar, 2014 1 commit
-
-
Volker Braun authored
-
- 22 Mar, 2014 12 commits
-
-
Release Manager authored
When the parameter reset is true, then not only the input but also the output alphabet is erased. URL: http://trac.sagemath.org/15975 Reported by: skropf Ticket author(s): Sara Kropf Reviewer(s): Clemens Heuberger, Daniel Krenn
-
Release Manager authored
This patch creates a file `latin_squares.py` in combinat/designs/, and implements several constructions of mutually orthogonal latin squares, as found in Douglas Stinson's book "Combinatorial Designs: Constructions and Analysis". Nathann URL: http://trac.sagemath.org/15286 Reported by: ncohen Ticket author(s): Nathann Cohen Reviewer(s): Vincent Delecroix
-
Release Manager authored
This patch provides some improvements for the affine factorization crystal. Before this patch {{{ sage: from sage.combinat.crystals.affine_factorization import AffineFactorizationCrystal sage: W = WeylGroup(['A',3], prefix='s') sage: w0 = W.long_element() sage: %timeit B = AffineFactorizationCrystal(w0,6) 1 loops, best of 3: 131 s per loop }}} After this patch {{{ sage: from sage.combinat.crystals.affine_factorization import AffineFactorizationCrystal sage: W = WeylGroup(['A',3], prefix='s') sage: w0 = W.long_element() sage: %timeit B = AffineFactorizationCrystal(w0,6) 1 loops, best of 3: 2.86 us per loop }}} URL: http://trac.sagemath.org/15907 Reported by: aschilling Ticket author(s): Anne Schilling Reviewer(s): Travis Scrimshaw
-
Release Manager authored
The attempt to create an embedded number field morphisms for non- embedded number fields currently fails (and should of course fail). {{{ sage: L.<i> = NumberField(x^2 + 1) sage: K = NumberField(L(i/2+3).minpoly(), names=('i0',), embedding=L(i/2+3)) sage: from sage.rings.number_field import number_field_morphisms sage: number_field_morphisms.EmbeddedNumberFieldMorphism(R, self) Traceback (most recent call last): ... RuntimeError: maximum recursion depth exceeded in __instancecheck__ }}} However, instead of running into an infinite recursion, a quick and simple `ValueError` (or perhaps `TypeError`) should be raised. URL: http://trac.sagemath.org/15331 Reported by: SimonKing Ticket author(s): Simon King, Marc Mezzarobba, Jean-Pierre Flori Reviewer(s): Marc Mezzarobba, Jean-Pierre Flori
-
Release Manager authored
For a non-deterministic automaton, just merging states which are indistinguishable for any suffix does not give a minimal non- deterministic automaton in every case (see e.g. http://cs.stackexchange.com/a/12712 ). This would be done by Moore's algorithm and only gives a smaller automaton. To obtain an equivalent minimal deterministic automaton, we use Brzozowski's algorithm, which first computes a determinisation of the non- deterministic automaton. URL: http://trac.sagemath.org/15925 Reported by: skropf Ticket author(s): Clemens Heuberger, Daniel Krenn, Sara Kropf Reviewer(s): Daniel Krenn
-
Release Manager authored
Previously, non-hashable output labels led to errors in {{{sage.combinat.finite_state_machine.FiniteStateMachine.prepone_output} }}. This is now corrected. URL: http://trac.sagemath.org/15924 Reported by: cheuberg Ticket author(s): Clemens Heuberger, Daniel Krenn Reviewer(s): Daniel Krenn
-
Release Manager authored
A TypeError occurring in the callback function {{{sage.combinat.finite_s tate_machine.FiniteStateMachine.add_from_transition_function}}} is incorrectly caught and leads to a misleading ValueError. Old behaviour: {{{ sage: def transition(state, where): sage: ... return (vector([0,0]),1) sage: Transducer(transition, input_alphabet=[0], initial_states=[0]) Traceback (click to the left of this block for traceback) ... ValueError: The callback function for add_from_transition is expected to return a pair (new_state, output_label) or a list of such pairs. For the state 0 and the input letter 0, it however returned [((0, 0), 1)], which is not acceptable. }}} New behaviour: {{{ sage: def transition(state, where): sage: ... return (vector([0,0]),1) sage: Transducer(transition, input_alphabet=[0], initial_states=[0]) Traceback (click to the left of this block for traceback) ... TypeError: mutable vectors are unhashable }}} URL: http://trac.sagemath.org/15923 Reported by: cheuberg Ticket author(s): Clemens Heuberger Reviewer(s): Daniel Krenn
-
Release Manager authored
The transition function callback in {{{sage.combinat.finite_state_machine.add_transistions_from_function}}} may now also return a list of transitions in order to add multiple transitions between a pair of states. URL: http://trac.sagemath.org/15922 Reported by: cheuberg Ticket author(s): Clemens Heuberger Reviewer(s): Daniel Krenn
-
Release Manager authored
{{{ sage: c = CartanType([["A",2]]) sage: c.is_irreducible() False }}} As a consequence, e.g. the cartan_matrix() method fails too. '''Updated:''' Patch submitted. Now: {{{ sage: c = CartanType([["A",2]]) sage: c.is_irreducible() True sage: c = CartanType(["A2"]) sage: c.is_irreducible() True }}} URL: http://trac.sagemath.org/13774 Reported by: JesusTorrado Ticket author(s): Jesús Torrado Reviewer(s): Travis Scrimshaw, Darij Grinberg
-
Release Manager authored
Consider the following code: {{{ ff.<z> = GF(2**8, 'z') poly.<c1,c2,c3> = PolynomialRing(ff, 3, 'c') r1,r2 = var('r1,r2') expression = -(c1*r2 - c2*r1)/c3 print expression.substitute(r1=z, r2=z) }}} This produces a TypeError: unsupported operand parent(s) for '*': 'Finite Field in z of size 2pow8' and 'Rational Field'. I know that 'expression' is not an element of the ring 'poly', but using a PolynomialRing is the only way I found to achieve symbolic arithmetic on finite fields. However, the interesting story is that if I replace the expression by {{{ expression = -(r2 - c2*r1)/c3 }}} it work perfectly well, but if instead the expression is {{{ expression = -(c1 + r2 - c2*r1)/c3 }}} then I get a segmentation fault. To make things a little bit more interesting I can rename r1 and r2 to a and b: {{{ ff.<z> = GF(2**8, 'z') poly.<c1,c2,c3> = PolynomialRing(ff, 3, 'c') a,b = var('a,b') expression = -(c1*b - c2*a)/c3 print expression.substitute(a=z, b=z) }}} Then it works fine, but produces a segmentation fault for, {{{ expression = -(c1 + b - c2*a)/c3 }}} so you can think that it might be a problem with the use of the names r1 and r2. But this is not the case, if I rename the PolynomialRing variables instead, from c's to x's: {{{ ff.<z> = GF(2**8, 'z') poly.<x1,x2,x3> = PolynomialRing(ff, 3, 'x') r1,r2 = var('r1,r2') expression = -(x1*r2 - x2*r1)/x3 print expression.substitute(r1=z, r2=z) }}} Then it works again for the first two expressions but produces a segmentation fault for the third too. Any idea of what is going wrong here? Apply [attachment:trac_13609-rebase.patch] URL: http://trac.sagemath.org/13609 Reported by: llpamies Ticket author(s): Burcin Erocal Reviewer(s): Jean-Pierre Flori
-
Release Manager authored
I don't know whether this affects any other platform... {{{ gcc -I. -I../.. -DCONFIG_H -I/Users/student/Desktop/sage-6.2.beta4/local/include -Wall -g -O2 -O2 -g -o sysfiles.o -c ../../src/sysfiles.c ../../src/sysfiles.c:3075:15: error: conflicting types for 'sys_errlist' In file included from ../../src/sysfiles.h:20:0, from ../../src/sysfiles.c:21: /usr/include/stdio.h:274:30: note: previous declaration of 'sys_errlist' was here make[4]: *** [sysfiles.o] Error 1 make[3]: *** [compile] Error 2 Error building GAP. real 11m47.329s user 7m23.375s sys 2m4.167s ************************************************************************ Error installing package gap-4.7.4 ************************************************************************ }}} Dima on [https://groups.google.com/forum/#!msg/sage- release/6Vh55hF7UXk/cITCg5T83EkJ this sage-release thread] gives the correct solution - to add -DHAVE_SYS_ERRLIST to the CFLAGS. There is another problem with an unknown `-no_pie` flag as well which is passed to the linker, which on 10.4 and 10.5 is not supported - see [http://trac.macports.org/ticket/34064 this Macports bug report]. URL: http://trac.sagemath.org/15973 Reported by: kcrisman Ticket author(s): Karl-Dieter Crisman Reviewer(s): Volker Braun
-
Release Manager authored
Removes deprecated code from #3794, #5460, #6094, #6115, #7852, #11603, #12840, #13012 and #13643. URL: http://trac.sagemath.org/15824 Reported by: aapitzsch Ticket author(s): André Apitzsch Reviewer(s): Ralf Stephan
-
- 20 Mar, 2014 6 commits
-
-
Daniel Krenn authored
-
Volker Braun authored
-
Release Manager authored
So we can do things like this: {{{ sage: RC = RiggedConfigurations(['A',3,1], [[2,2],[1,1],[1,1]]) sage: elt = RC(partition_list=[[3,1], [3], [1]]) sage: elt -3[ ][ ][ ]-3 -1[ ]-1 1[ ][ ][ ]1 -1[ ]-1 sage: RiggedConfigurations.global_options(display="horizontal", convention="french") sage: elt -1[ ]-1 1[ ][ ][ ]1 -1[ ]-1 -3[ ][ ][ ]-3 }}} URL: http://trac.sagemath.org/15940 Reported by: tscrim Ticket author(s): Travis Scrimshaw Reviewer(s): Ben Salisbury
-
Release Manager authored
There are 3 modules in {{{sage/misc}}} mixing both absolute and local imports in a single import statement. This is a problem with Python 3. Also, mixing standard library imports with application specific imports is not PEP8 compliant. URL: http://trac.sagemath.org/15952 Reported by: wluebbe Ticket author(s): Wilfried Luebbe Reviewer(s): Frédéric Chapoton
-
Release Manager authored
Provide a new convenience function {{{FiniteStateMachine.set_coordinates}}}: Set coordinates of the states for the LaTeX representation by a dictionary (or a function) mapping labels to coordinates. URL: http://trac.sagemath.org/15960 Reported by: cheuberg Ticket author(s): Clemens Heuberger, Daniel Krenn Reviewer(s): Clemens Heuberger, Daniel Krenn
-
Release Manager authored
Provided methods {{{sage.combinat.finite_state_machine.FSMState.__lt__}}} and {{{sage.combinat.finite_state_machine.FSMTransition.__lt__}}} in order to have default ordering. For instance, this helps enforcing a unique output in doctests. URL: http://trac.sagemath.org/15849 Reported by: cheuberg Ticket author(s): Clemens Heuberger, Daniel Krenn Reviewer(s): Daniel Krenn
-