|
Size: 11981
Comment: Summarize #4290, #6083
|
← Revision 35 as of 2024-08-19 22:17:01 ⇥
Size: 0
Comment: migrated to https://github.com/sagemath/sage/releases/tag/4.1 (including attachments)
|
| Deletions are marked like this. | Additions are marked like this. |
| Line 1: | Line 1: |
| = Sage 4.1 Release Tour = Sage 4.1 was released on July 09, 2009. For the official, comprehensive release note, please refer to [[http://www.sagemath.org/src/announce/sage-4.1.txt|sage-4.1.txt]]. A nicely formatted version of this release tour can be found at FIXME. The following points are some of the foci of this release: * Upgrade to Python 2.6.x * Support for building Singular with GCC 4.4 * Optimized integer division * Combinatorics: irreducible matrix representations of symmetric groups; and Yang-Baxter Graphs * Cryptography: Mini Advanced Encryption Standard for educational purposes * Graph theory: back-end for graph theory with Cython (c_graph); and improve accuracy of graph eigenvalues * Linear algebra: a general package for finitely generated, not-necessarily free R-modules; and multiplicative order for matrices over finite fields * Miscellaneous: optimized Sudoku solver; a decorator for declaring abstract methods; and support Unicode in LaTeX cells (notebook) * Number theory: improved random element generation for number field orders and ideals; support Michael Stoll's ratpoints package; and elliptic exponential * Numerical: computing numerical values of constants using mpmath * Update, upgrade 18 packages to latest upstream releases == Algebraic Geometry == * Construct an elliptic curve from a plane curve of genus one (Lloyd Kilford, John Cremona ) -- New function {{{EllipticCurve_from_plane_curve()}}} in the module {{{sage/schemes/elliptic_curves/constructor.py}}} to allow the construction of an elliptic curve from a smooth plane cubic with a rational point. Currently, this function uses Magma and it will not work on machines that do not have Magma installed. Assuming you have Magma installed on your computer, we can use the function {{{EllipticCurve_from_plane_curve()}}} to first check that the Fermat cubic is isomorphic to the curve with Cremona label "27a1": {{{#!python numbers=off sage: x, y, z = PolynomialRing(QQ, 3, 'xyz').gens() # optional - magma sage: C = Curve(x^3 + y^3 + z^3) # optional - magma sage: P = C(1, -1, 0) # optional - magma sage: E = EllipticCurve_from_plane_curve(C, P) # optional - magma sage: E # optional - magma Elliptic Curve defined by y^2 + y = x^3 - 7 over Rational Field sage: E.label() # optional - magma '27a1' }}} Here is a quartic example: {{{#!python numbers=off sage: u, v, w = PolynomialRing(QQ, 3, 'uvw').gens() # optional - magma sage: C = Curve(u^4 + u^2*v^2 - w^4) # optional - magma sage: P = C(1, 0, 1) # optional - magma sage: E = EllipticCurve_from_plane_curve(C, P) # optional - magma sage: E # optional - magma Elliptic Curve defined by y^2 = x^3 + 4*x over Rational Field sage: E.label() # optional - magma '32a1' }}} == Basic Arithmetic == * Speed-up integer division (Robert Bradshaw ) -- In some cases, integer division is now up to 31% faster than previously. The following timing statistics were obtained using the machine sage.math: {{{#!python numbers=off # BEFORE sage: a = next_prime(2**31) sage: b = Integers(a)(100) sage: %timeit a % b; 1000000 loops, best of 3: 1.12 µs per loop sage: %timeit 101 // int(5); 1000000 loops, best of 3: 215 ns per loop sage: %timeit 100 // int(-3) 1000000 loops, best of 3: 214 ns per loop sage: a = ZZ.random_element(10**50) sage: b = ZZ.random_element(10**15) sage: %timeit a.quo_rem(b) 1000000 loops, best of 3: 454 ns per loop # AFTER sage: a = next_prime(2**31) sage: b = Integers(a)(100) sage: %timeit a % b; 1000000 loops, best of 3: 1.02 µs per loop sage: %timeit 101 // int(5); 1000000 loops, best of 3: 201 ns per loop sage: %timeit 100 // int(-3) 1000000 loops, best of 3: 194 ns per loop sage: a = ZZ.random_element(10**50) sage: b = ZZ.random_element(10**15) sage: %timeit a.quo_rem(b) 1000000 loops, best of 3: 313 ns per loop }}} == Combinatorics == 1. '''Irreducible matrix representations of symmetric groups (Ticket #5878)'''. FrancoSaliola, based on the [[http://www-igm.univ-mlv.fr/~al|Alain Lascoux]] article [[http://phalanstere.univ-mlv.fr/~al/ARTICLES/ProcCrac.ps.gz|Young representations of the symmetric group]], added support for constructing irreducible representations of the symmetric group. Three types of representations have been implemented. * '''Specht representations'''. The matrices have integer entries. {{{#!python numbers=off sage: chi = SymmetricGroupRepresentation([3,2]) Specht representation of the symmetric group corresponding to [3, 2] sage: chi([5,4,3,2,1]) [ 1 -1 0 1 0] [ 0 0 -1 0 1] [ 0 0 0 -1 1] [ 0 1 -1 -1 1] [ 0 1 0 -1 1] }}} * '''Young's seminormal representation'''. The matrices have rational entries. {{{#!python numbers=off sage: snorm = SymmetricGroupRepresentation([2,1], "seminormal") sage: snorm Seminormal representation of the symmetric group corresponding to [2, 1] sage: snorm([1,3,2]) [-1/2 3/2] [ 1/2 1/2] }}} * '''Young's orthogonal representation''' (the matrices are orthogonal). These matrices are defined over Sage's {{{Symbolic Ring}}}. {{{#!python numbers=off sage: ortho = SymmetricGroupRepresentation([3,2], "orthogonal") sage: ortho Orthogonal representation of the symmetric group corresponding to [3, 2] sage: ortho([1,3,2,4,5]) [ 1 0 0 0 0] [ 0 -1/2 1/2*sqrt(3) 0 0] [ 0 1/2*sqrt(3) 1/2 0 0] [ 0 0 0 -1/2 1/2*sqrt(3)] [ 0 0 0 1/2*sqrt(3) 1/2] }}} One can also create the {{{CombinatorialClass}}} of all irreducible matrix representations of a given symmetric group. Then particular representations can be created by providing partitions. For example: {{{#!python numbers=off sage: chi = SymmetricGroupRepresentations(5) sage: chi Specht representations of the symmetric group of order 5! over Integer Ring sage: chi([5]) # the trivial representation Specht representation of the symmetric group corresponding to [5] sage: chi([5])([2,1,3,4,5]) [1] sage: chi([1,1,1,1,1]) # the sign representation Specht representation of the symmetric group corresponding to [1, 1, 1, 1, 1] sage: chi([1,1,1,1,1])([2,1,3,4,5]) [-1] sage: chi([3,2]) Specht representation of the symmetric group corresponding to [3, 2] sage: chi([3,2])([5,4,3,2,1]) [ 1 -1 0 1 0] [ 0 0 -1 0 1] [ 0 0 0 -1 1] [ 0 1 -1 -1 1] [ 0 1 0 -1 1] }}} See the documentation {{{SymmetricGroupRepresentation?}}} and {{{SymmetricGroupRepresentations?}}} for more information and examples. 1. '''Yang-Baxter Graphs (Ticket #5878)'''. Ticket #5878 (irreducible matrix representations of the symmetric group) also introduced support for Yang-Baxter graphs. Besides being used for constructing those representations, they can also be used to construct the Cayley graph of a finite group: {{{#!python numbers=off sage: def left_multiplication_by(g): ... return lambda h : h*g sage: G = AlternatingGroup(4) sage: operators = [ left_multiplication_by(gen) for gen in G.gens() ] sage: Y = YangBaxterGraph(root=G.identity(), operators=operators); Y Yang-Baxter graph with root vertex () sage: Y.plot(edge_labels=False) }}} and to construct the permutahedron: {{{#!python numbers=off sage: from sage.combinat.yang_baxter_graph import SwapIncreasingOperator sage: operators = [SwapIncreasingOperator(i) for i in range(3)] sage: Y = YangBaxterGraph(root=(1,2,3,4), operators=operators); Y Yang-Baxter graph with root vertex (1, 2, 3, 4) sage: Y.plot() }}} See the documentation {{{YangBaxterGraph?}}} for more information and examples. == Commutative Algebra == == Cryptography == * FIXME: summarize #6164 == Geometry == == Graph Theory == 1. FIXME: summarize #6085 1. '''Improve accuracy of graph eigenvalues (Ticket #6258)''', Rob Beezer. New routines compute eigenvalues and eigenvectors of integer matrices more precisely than before. Rather than convert adjacency matrices of graphs to computations over the reals or complexes, this patch retains adjacency matrices as matrices over the integers, yielding more accurate and informative results for eigenvalues, eigenvectors, and eigenspaces. * Examples follow for a circuit on 8 vertices: {{{#!python numbers=off g = graphs.CycleGraph(8) }}} * Integer eigenvalues are exact, irrational eigenvalues are more precise, making multiplicities easier to determine. {{{#!python numbers=off sage: g.spectrum() [2, 1.414213562373095?, 1.414213562373095?, 0, 0, -1.414213562373095?, -1.414213562373095?, -2] }}} * Similar comments apply to eigenvectors. {{{#!python numbers=off sage: g.eigenvectors() [(2, [ (1, 1, 1, 1, 1, 1, 1, 1) ], 1), (-2, [ (1, -1, 1, -1, 1, -1, 1, -1) ], 1), (0, [ (1, 0, -1, 0, 1, 0, -1, 0), (0, 1, 0, -1, 0, 1, 0, -1) ], 2), (-1.414213562373095?, [(1, 0, -1, 1.414213562373095?, -1, 0, 1, -1.414213562373095?), (0, 1, -1.414213562373095?, 1, 0, -1, 1.414213562373095?, -1)], 2), (1.414213562373095?, [(1, 0, -1, -1.414213562373095?, -1, 0, 1, 1.414213562373095?), (0, 1, 1.414213562373095?, 1, 0, -1, -1.414213562373095?, -1)], 2)] }}} * Eigenspaces are exact, in that they can be expressed as vector spaces over number fields. When the defining polynomial has several roots, the eigenspaces are not repeated. Previously eigenspaces were "fractured" owing to slight computational differences in identical eigenvalues. In concert with {{{eigenvectors()}}} this command illuminates the structure of a graph's eigenspaces more than purely numerical results. {{{#!python numbers=off sage: g.eigenspaces() [ (2, Vector space of degree 8 and dimension 1 over Rational Field User basis matrix: [1 1 1 1 1 1 1 1]), (-2, Vector space of degree 8 and dimension 1 over Rational Field User basis matrix: [ 1 -1 1 -1 1 -1 1 -1]), (0, Vector space of degree 8 and dimension 2 over Rational Field User basis matrix: [ 1 0 -1 0 1 0 -1 0] [ 0 1 0 -1 0 1 0 -1]), (a3, Vector space of degree 8 and dimension 2 over Number Field in a3 with defining polynomial x^2 - 2 User basis matrix: [ 1 0 -1 -a3 -1 0 1 a3] [ 0 1 a3 1 0 -1 -a3 -1]) }}} * Complex eigenvalues (of digraphs) previously were missing their imaginary parts. This bug has been fixed as part of this ticket. == Graphics == * FIXME: summarize #6162 == Group Theory == == Interfaces == * FIXME: summarize #4313 == Linear Algebra == * FIXME: summarize #6261 * FIXME: summarize #5882 == Miscellaneous == * FIXME: summarize #3084 * FIXME: summarize #6097 * FIXME: summarize #6417 == Modular Forms == == Notebook == * FIXME: summarize #5637 == Number Theory == * FIXME: summarize #6273 * FIXME: summarize #5854 * FIXME: summarize #6386 == Numerical == * FIXME: summarize #6200 == Packages == * Upgrade [[http://www.singular.uni-kl.de|Singular]] to version singular-3-1-0-2-20090620 with support for compiling with GCC 4.4. * FIXME: summarize #6359 * FIXME: summarize #6196 * FIXME: summarize #6276 * FIXME: summarize #5517 * FIXME: summarize #5854 * FIXME: summarize #5866 * FIXME: summarize #5867 * FIXME: summarize #5868 * FIXME: summarize #5869 * FIXME: summarize #5870 * FIXME: summarize #5872 * FIXME: summarize #5874 * FIXME: summarize #5875 * FIXME: summarize #6281 * FIXME: summarize #6470 * FIXME: summarize #6470 * FIXME: summarize #6492 * FIXME: summarize #6408 == P-adics == == Quadratic Forms == == Symbolics == * FIXME: summarize #6421 == Topology == |
