[sage-devel] Re: Sage 2.10.2.alpha0 released!
Craig Citro wrote: > Hi Jaap, > > I went ahead and fixed (I hope!) the doctest below. (I just added a > prec flag, and made the doctests use it, so this should avoid any sort > of architecture-dependent issues). Could you try this out and let me > know if it works, and then give the patch a positive review? Thanks! > > If anyone else is seeing this doctest failure, could you also try it > out? (I don't see it on my machine, so I'm guessing this works, but I > can't be sure.) > > Patch is here: > > http://trac.sagemath.org/sage_trac/ticket/2201 > Hi Craig, I couldn't apply this patch for some reason I don't understand! abort: outstanding uncommitted changes Jaap --~--~-~--~~~---~--~~ To post to this group, send email to sage-devel@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/sage-devel URLs: http://www.sagemath.org -~--~~~~--~~--~--~---
[sage-devel] Fwd: [Om] OpenMath @ SCIEnce
FYI
-- Forwarded message --
From: Peter Horn <[EMAIL PROTECTED]>
Date: Feb 17, 2008 2:37 PM
Subject: [Om] OpenMath @ SCIEnce
To: [EMAIL PROTECTED]
Hello to the OpenMath Community!
The SCIEnce project (Symbolic Computation Infrastructure for Europe,
http://www.symbolic-computation.org/) brings together the developers of
four powerful symbolic computation software packages (GAP, KANT, Maple
and MuPAD) and a major symbolic computation research institute
(RISC-Linz), and research groups expert in essential underpinning
technologies, to unite the European community of researchers in, and
users of, symbolic computation.
One of the current activitities focuses on connecting different Computer
Algebra Systems in a standardized way. The systems involved in this
activity are:
* GAP (system for computational discrete algebra, with particular
emphasis on Computational Group Theory), CIRCA, St. Andrews,
Scotland.
http://www.gap-system.org/
* KANT (software package for sophisticated computations in number
fields and in global function fields), TU Berlin.
http://www.math.tu-berlin.de/~kant/kash.html
* MuPAD (general purpose CAS, Paderborn)
http://www.sciface.com
* Maple (general purpose CAS, Waterloo, CA)
http://www.maplesoft.com
* Supported by the OpenMath experts at the TU Eindhoven
http://www.win.tue.nl/dw/dam/
The protocol used to communicate between the systems is called SCSCP
(Symbolic Computation Software Composability Protocol). The mathematical
objects are marshalled in XML using OpenMath (http://www.openmath.org).
Working prototypes exist for GAP, KANT, and MuPAD. Also, a Java
framework
was created in order to make it easy for third party developers to
expose
their code to other systems using SCSCP.
Furthermore, there is a web-proxy that offers the capabilities of one or
more of the above systems to SOAP-clients.
This is a demo-session in MuPAD:
**MuPAD Pro 4.5.0 -- The Open Computer Algebra System
/| /|
** |Copyright (c) 1997 - 2008 by SciFace Software
| *--|-* All rights reserved.
|/ |/
**
// load the package
>> package("OpenMath"):
// define some (simple) maths task. hold is required to prevent
// MuPAD from immediately computing the result.
>> A := hold(hold(_plus)(7, 8 ))
hold(_plus)(7, 8 )
// There are scscp-servers running on some remote machines.
// Note: in the setup of the connection, the type of the system is NOT
// specified. They all talk SCSCP.
>> gap := SCSCP("machine1.somewhere.org", 26133):
>> kant := SCSCP("machine2.somewhere-else.org", 26133):
>> mupad := SCSCP("machine3.differentplace.org", 26133):
// now, ask GAP, KANT and the remote MuPAD to compute the task:
>> gap::compute(A)
15
>> kant::compute(A)
15
>> mupad::compute(A)
15
// a slightly more advanced example (extended euclidean algorithm)
>> B := hold(hold(gcdex)(12, 14, 20))
hold(gcdex)(12,14,20)
>> kant::compute(B)
[2, -1, 1, 0]
- END SESSION -
OpenMath Package for MuPAD
--
In the last couple of months I've developed an OpenMath Package for
MuPAD for the purpose of his project
A rather early preview of the package can be found here:
* http://symcomp.mathematik.uni-kassel.de/~hornp/OpenMath.zip
* http://symcomp.mathematik.uni-kassel.de/~hornp/OpenMath.tbz
It's organized as a MuPAD package. So if it can be found on the
PACKAGEPATH, you can use it like this:
- BEGIN SESSION -
// load the package
>> package("OpenMath")
// generate::OpenMath creates an adt::XML representing the mathematical
// expression
>> generate::OpenMath(1+a)
1
// in OpenMath there are definitions how to represent different
// numbers as Complex...
>> generate::OpenMath(3+4*I)
3
4
// ...or Rationals.
>> generate::OpenMath(3/4)
3
4
// xml2text is a function to get a compact and fast
// string-representation of an adt::XML
>> xml2text(generate::OpenMath(sin(a+1)^2))
"12<\
/OMA>"
// OM::Parser::pase parses either the given file or the passed String
// if the Option 'String' is given
>> OM::Parser::parse(%, String)
OM::XML::OMOBJ([OM::XML::OMA([OM::XML::OMS(table("name" = "power", "c\
d" = "arith1")), OM::XML::OMA([OM::XML::OMS(table("name" = "sin", "cd\
" = "transc1")), OM::XML::OMA([OM::XML::OMS(table("name" = "plus", "c\
d" = "arith1")), OM::XML::OMV(table("name" = "a")), OM::XML::OMI([OM:\
:XML::Data("1")])])]), OM::XML::OMI([OM::XML::Data("2")])])], table("\
xmlns" = "http://www.openmath.org/OpenMath";))
// the result needs to be evaluated to get the proper MuPAD expression
// (This is done to simplify debugging during development.)
>> eval(%)
sin(a + 1)^2
- END SESSION -
Currently, only a couple of domains (mainly expressions, numbers,
polynomials and matrices) are supported.
This is not a stable version to any e
[sage-devel] Re: Sage 2.10.2.alpha0 released!
Craig Citro wrote: As follow up: > > If anyone else is seeing this doctest failure, could you also try it > out? (I don't see it on my machine, so I'm guessing this works, but I > can't be sure.) > > Patch is here: > > http://trac.sagemath.org/sage_trac/ticket/2201 > I applied the patch by hand. And got: copying build/lib.linux-i686-2.5/sage/rings/number_field/number_field.py -> /home/jaap/downloads/sage-2.10.2.alpha0/local/lib/python2.5/site-packages/sage/rings/number_field byte-compiling /home/jaap/downloads/sage-2.10.2.alpha0/local/lib/python2.5/site-packages/sage/rings/number_field/number_field.py to number_field.pyc running install_scripts changing mode of /home/jaap/downloads/sage-2.10.2.alpha0/local/bin/dsage_server.py to 775 changing mode of /home/jaap/downloads/sage-2.10.2.alpha0/local/bin/dsage_worker.py to 775 changing mode of /home/jaap/downloads/sage-2.10.2.alpha0/local/bin/dsage_setup.py to 775 running install_data running install_egg_info Removing /home/jaap/downloads/sage-2.10.2.alpha0/local/lib/python2.5/site-packages/sage-0.0.0-py2.5.egg-info Writing /home/jaap/downloads/sage-2.10.2.alpha0/local/lib/python2.5/site-packages/sage-0.0.0-py2.5.egg-info -- | SAGE Version 2.10.2.alpha0, Release Date: 2008-02-14 | | Type notebook() for the GUI, and license() for information.| -- sage: Exiting SAGE (CPU time 0m0.00s, Wall time 0m14.94s). [EMAIL PROTECTED] sage-2.10.2.alpha0]$ ./sage -t devel/sage-main/sage/rings/number_field/number_field.py sage -t devel/sage-main/sage/rings/number_field/number_field.py [21.3 s] -- All tests passed! Total time for all tests: 21.3 seconds I'll give the trac a positive review. Jaap --~--~-~--~~~---~--~~ To post to this group, send email to sage-devel@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/sage-devel URLs: http://www.sagemath.org -~--~~~~--~~--~--~---
[sage-devel] Re: mpoly factoring woes
Hi Joel, Well done on annihilating singular on the horror example you had. I've sat down to read the code a few times, but it is slow going for me, as I don't speak python well yet. But I'll make a few comments when I do get some spare moments to finish reading your code. That'll probably be tomorrow at this point. Over the summer I hope to have a student work on univariate factoring over Z/pZ to which multivariate factoring reduces. Hopefully by then I'll have more to say about the multivariate factoring in that case. Do you think you'll work on that in the near future? I'm still convinced that the specialisation technique works just as well there too. I'm quite sure it works for the example on the trac ticket anyway. First remove the content xz. Then specialise at y=1, z=1 and factor the univariate polynomial over GF5. Then lift that to a factorisation of (from memory) the polynomial specialised at z=1. Finally lift to a factorisation of the full polynomial. Does that sound sensible to you? In general one specialises at random points in GF5 and looks for information about the structure of any factors. In the example on the trac ticket it all works out pretty easy. There is also this paper which the Magma group says contains the algorithm they use (modulo a few improvements): BM97 Laurent Bernardin and Michael B. Monagan. Efficient Multivariate Factorization Over Finite Fields. In Proceedings of AAECC, volume 1255 of LNCS, pages 15--28. Springer-Verlag, 1997. I admit I haven't had time to actually read it. Bill. On 16 Feb, 20:52, "Joel B. Mohler" <[EMAIL PROTECTED]> wrote: > Hi, > > I've finally got around to polishing off the implementation I made over > Christmas of multi-variate factoring over ZZ. For small cases singular > (working over QQ) beats it by a large factor, but for some larger cases they > become much more comparable. My favorite horrific example (in which I > annihilate singular) is referenced in the ticket > athttp://trac.sagemath.org/sage_trac/ticket/2179 > > It's not immediately evident to me if the ideas in the patch are applicable > tohttp://trac.sagemath.org/sage_trac/ticket/2152 > However, I thought I would bring it to the attention of the mailing list if it > could be helpful there. It does seem more likely that a proper fix for 2152 > would provide a better implementation for my algorithm given the CRT. > > -- > Joel --~--~-~--~~~---~--~~ To post to this group, send email to sage-devel@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/sage-devel URLs: http://www.sagemath.org -~--~~~~--~~--~--~---
[sage-devel] Re: Fwd: [Om] OpenMath @ SCIEnce
On Feb 18, 1:34 pm, "David Joyner" <[EMAIL PROTECTED]> wrote:
> FYI
Hehe, this email does explain a couple things I did hear at SD7. All I
can say is good luck, if you wonder why have a look at the open math
discussion list.
Cheers,
Michael
> -- Forwarded message --
> From: Peter Horn <[EMAIL PROTECTED]>
> Date: Feb 17, 2008 2:37 PM
> Subject: [Om] OpenMath @ SCIEnce
> To: [EMAIL PROTECTED]
>
> Hello to the OpenMath Community!
>
> The SCIEnce project (Symbolic Computation Infrastructure for
> Europe,http://www.symbolic-computation.org/) brings together the developers of
> four powerful symbolic computation software packages (GAP, KANT, Maple
> and MuPAD) and a major symbolic computation research institute
> (RISC-Linz), and research groups expert in essential underpinning
> technologies, to unite the European community of researchers in, and
> users of, symbolic computation.
>
> One of the current activitities focuses on connecting different Computer
> Algebra Systems in a standardized way. The systems involved in this
> activity are:
>
> * GAP (system for computational discrete algebra, with particular
>emphasis on Computational Group Theory), CIRCA, St. Andrews,
> Scotland.
>http://www.gap-system.org/
> * KANT (software package for sophisticated computations in number
>fields and in global function fields), TU Berlin.
>http://www.math.tu-berlin.de/~kant/kash.html
> * MuPAD (general purpose CAS, Paderborn)
>http://www.sciface.com
> * Maple (general purpose CAS, Waterloo, CA)
>http://www.maplesoft.com
> * Supported by the OpenMath experts at the TU Eindhoven
>http://www.win.tue.nl/dw/dam/
>
> The protocol used to communicate between the systems is called SCSCP
> (Symbolic Computation Software Composability Protocol). The mathematical
> objects are marshalled in XML using OpenMath (http://www.openmath.org).
>
> Working prototypes exist for GAP, KANT, and MuPAD. Also, a Java
> framework
> was created in order to make it easy for third party developers to
> expose
> their code to other systems using SCSCP.
>
> Furthermore, there is a web-proxy that offers the capabilities of one or
> more of the above systems to SOAP-clients.
>
> This is a demo-session in MuPAD:
>
> **MuPAD Pro 4.5.0 -- The Open Computer Algebra System
>/| /|
> ** |Copyright (c) 1997 - 2008 by SciFace Software
> | *--|-* All rights reserved.
> |/ |/
> **
>
> // load the package
> >> package("OpenMath"):
>
> // define some (simple) maths task. hold is required to prevent
> // MuPAD from immediately computing the result.
> >> A := hold(hold(_plus)(7, 8 ))
> hold(_plus)(7, 8 )
>
> // There are scscp-servers running on some remote machines.
> // Note: in the setup of the connection, the type of the system is NOT
> // specified. They all talk SCSCP.
> >> gap := SCSCP("machine1.somewhere.org", 26133):
> >> kant := SCSCP("machine2.somewhere-else.org", 26133):
> >> mupad := SCSCP("machine3.differentplace.org", 26133):
>
> // now, ask GAP, KANT and the remote MuPAD to compute the task:
>
> >> gap::compute(A)
> 15
>
> >> kant::compute(A)
> 15
>
> >> mupad::compute(A)
> 15
>
> // a slightly more advanced example (extended euclidean algorithm)
> >> B := hold(hold(gcdex)(12, 14, 20))
> hold(gcdex)(12,14,20)
>
> >> kant::compute(B)
> [2, -1, 1, 0]
>
> - END SESSION -
>
> OpenMath Package for MuPAD
> --
>
> In the last couple of months I've developed an OpenMath Package for
> MuPAD for the purpose of his project
>
> A rather early preview of the package can be found here:
>
> *http://symcomp.mathematik.uni-kassel.de/~hornp/OpenMath.zip
> *http://symcomp.mathematik.uni-kassel.de/~hornp/OpenMath.tbz
>
> It's organized as a MuPAD package. So if it can be found on the
> PACKAGEPATH, you can use it like this:
>
> - BEGIN SESSION -
> // load the package
> >> package("OpenMath")
>
> // generate::OpenMath creates an adt::XML representing the mathematical
> // expression
> >> generate::OpenMath(1+a)
>
>
>
>
> 1
>
>
>
> // in OpenMath there are definitions how to represent different
> // numbers as Complex...
> >> generate::OpenMath(3+4*I)
>
>
>
> 3
> 4
>
>
>
> // ...or Rationals.
> >> generate::OpenMath(3/4)
>
>
>
> 3
> 4
>
>
>
> // xml2text is a function to get a compact and fast
> // string-representation of an adt::XML
> >> xml2text(generate::OpenMath(sin(a+1)^2))
> "12<\
> /OMA>"
>
> // OM::Parser::pase parses either the given file or the passed String
> // if the Option 'String' is given
> >> OM::Parser::parse(%, String)
> OM::XML::OMOBJ([OM::XML::OMA([OM::XML::OMS(table("name" = "power", "c\
> d" = "arith1")), OM::XML::OMA([OM::XML::OMS(table("name" = "sin", "cd\
> " = "transc1")), OM::XML::OMA([OM::XML::OMS(table("name" = "plus", "c\
> d" = "arith1")), OM::XML::OMV(tab
[sage-devel] Re: mpoly factoring woes
On Feb 18, 6:21 am, Bill Hart <[EMAIL PROTECTED]> wrote: > Laurent Bernardin and Michael B. Monagan. > Efficient Multivariate Factorization Over Finite Fields. If Sage has or can get fast LLL you should implement the new algorithm of Mark van Hoeij. --~--~-~--~~~---~--~~ To post to this group, send email to sage-devel@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/sage-devel URLs: http://www.sagemath.org -~--~~~~--~~--~--~---
[sage-devel] Fwd: Bug#741: Fwd: bug in PARI's mathnf function
Hi,
This is about a bug I found in PARI's Hermite Normal Form when testing my new
Hermite Normal Form, and a fix from them.
William
-- Forwarded message --
From: Karim Belabas <[EMAIL PROTECTED]>
Date: Feb 18, 2008 2:49 AM
Subject: Re: Bug#741: Fwd: bug in PARI's mathnf function
To: William Stein <[EMAIL PROTECTED]>, [EMAIL PROTECTED]
* William Stein [2008-02-16 23:47]:
> Package: pari
> Version: 2.3.3
[...]
> PARI sometimes puts negative numbers in the *output* of mathnf(a, 1)[0],
> which is a bug.
Indeed.
> * I didn't use mathnf(b) directly (the default option), since
> already for a 20x18 matrix it
> is too slow to be useful.
As documented.
[ Actually, I am going to change this: I don't see the point in defaulting
to a slow routine; let mathnf choose depending on the matrix size.
It should either call matdetint + mathnfmod, or mathnf(,1) ]
> * I'm guessing maybe mathnf(b, 1) uses the modular hnf modulo the
> determinant.
Actually, no; mathnfmod does that.
> If not, maybe you just need to add mutliples of rows until everything
> is correctly normalized.
We do that, with one optimization too many which sometimes cancelled the
normalization step ( when the kernel is non trivial and we are "lucky":
a coefficient which we want to set to 0 is already 0 ).
It is fixed in both stable and unstable branches. I am attaching the
(trivial) patch.
Thanks for your report !
K.B.
--
Karim Belabas Tel: (+33) (0)5 40 00 26 17
IMB, Universite Bordeaux 1 Fax: (+33) (0)5 40 00 69 50
351, cours de la Liberationhttp://www.math.u-bordeaux.fr/~belabas/
F-33405 Talence (France) http://pari.math.u-bordeaux.fr/ [PARI/GP]
--
William Stein
Associate Professor of Mathematics
University of Washington
http://wstein.org
--~--~-~--~~~---~--~~
To post to this group, send email to sage-devel@googlegroups.com
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit this group at http://groups.google.com/group/sage-devel
URLs: http://www.sagemath.org
-~--~~~~--~~--~--~---
Index: src/basemath/alglin2.c
===
--- src/basemath/alglin2.c (revision 9574)
+++ src/basemath/alglin2.c (working copy)
@@ -3082,11 +3082,9 @@
for (i=h[j]; i; i--)
{
a = gcoeff(A,i,j);
- if (!signe(a)) continue;
-
k = c[i];
- ZV_elem(a,gcoeff(A,i,k), A,B, j,k);
- ZM_reduce(A,B, i,k);
+ if (signe(a)) ZV_elem(a,gcoeff(A,i,k), A,B, j,k);
+ ZM_reduce(A,B, i,k); /* ensure non-negative entries, even if a = 0 */
if (low_stack(lim, stack_lim(av1,1)))
{
if (DEBUGMEM>1) pari_warn(warnmem,"hnfall[3], j = %ld", j);
[sage-devel] Re: mpoly factoring woes
On Feb 18, 2008 10:08 AM, Roman Pearce <[EMAIL PROTECTED]> wrote: > > On Feb 18, 6:21 am, Bill Hart <[EMAIL PROTECTED]> wrote: > > Laurent Bernardin and Michael B. Monagan. > > Efficient Multivariate Factorization Over Finite Fields. > > If Sage has or can get fast LLL you should implement the new algorithm > of Mark van Hoeij. Sage does have a very fast LLL implementation (fpLLL by Damien Stehle). However, I don't know of any new (or old) algorithm by Mark van Hoeij that addresses the problem of "Efficient Multivariate Factorization Over Finite Fields" using LLL. Could you please clarify. I am aware of Mark's algorithms for univariate polynomial factorization over global fields using LLL. -- William --~--~-~--~~~---~--~~ To post to this group, send email to sage-devel@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/sage-devel URLs: http://www.sagemath.org -~--~~~~--~~--~--~---
[sage-devel] Re: mpoly factoring woes
Mark uses LLL to solve the knapsack problem that arises from solving how the local factors should be bundled together to reconstruct the global factors. It's only used to tame the combinatorial explosion that you get if there are many local factors, but only very few global ones. This is completely analogous in the multivariate situation, where your specializations give local factorizations. (i.e., take a square-free multivariate polynomial f(x,y), find a y0 such that f(x,y0) is also square-free, determine the factorization of f(x,y0), lift it to a power-series factorization of f(x,y0+z), use LLL to see how these factors pack together to give a polynomial factorization of f(x,y). I can image that for polynomials, you can do something faster. However, if the combinatorial explosion is a problem there as well, Mark van Hoeij's trick should still apply. On Feb 18, 10:21 am, "William Stein" <[EMAIL PROTECTED]> wrote: > On Feb 18, 2008 10:08 AM, Roman Pearce <[EMAIL PROTECTED]> wrote: > > > > > On Feb 18, 6:21 am, Bill Hart <[EMAIL PROTECTED]> wrote: > > > Laurent Bernardin and Michael B. Monagan. > > > Efficient Multivariate Factorization Over Finite Fields. > > > If Sage has or can get fast LLL you should implement the new algorithm > > of Mark van Hoeij. > > Sage does have a very fast LLL implementation (fpLLL by Damien Stehle). > However, I don't know of any new (or old) algorithm by Mark van Hoeij > that addresses the problem of "Efficient Multivariate Factorization Over > Finite Fields" using LLL. Could you please clarify. > > I am aware of Mark's algorithms for univariate polynomial factorization > over global fields using LLL. > > -- William --~--~-~--~~~---~--~~ To post to this group, send email to sage-devel@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/sage-devel URLs: http://www.sagemath.org -~--~~~~--~~--~--~---
[sage-devel] Re: mpoly factoring woes
> However, I don't know of any new (or old) algorithm by Mark van Hoeij > that addresses the problem of "Efficient Multivariate Factorization Over > Finite Fields" using LLL. Could you please clarify. > I am aware of Mark's algorithms for univariate polynomial factorization > over global fields using LLL. Sorry, what is the issue with Sage ? You need evaluation/ interpolation and Hensel lifting ? --~--~-~--~~~---~--~~ To post to this group, send email to sage-devel@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/sage-devel URLs: http://www.sagemath.org -~--~~~~--~~--~--~---
[sage-devel] factor_list in SR returning different types for integer powers
In #2028, the following issue is brought up: sage: a=x^1 sage: a.factor_list() [(x, 1)] sage: type(a.factor_list()[0][1]) sage: a=x^2 sage: a.factor_list() [(x, 2)] sage: type(a.factor_list()[0][1]) Basically, the factoring routine differentiates between a power of 1 and any other power and returns an int or a SymbolicConstant. Is there a reason why we shouldn't return the integer 2 in the second case instead of a SymbolicConstant expression representing 2? Thanks, Jason --~--~-~--~~~---~--~~ To post to this group, send email to sage-devel@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/sage-devel URLs: http://www.sagemath.org -~--~~~~--~~--~--~---
[sage-devel] Re: mpoly factoring woes
Apparently van Hoeij's approach works (very well) for bivariate polynomials over ZZ. The Magma documentation doesn't seem to give any clue as to whether they use a van Hoeij like approach for finite fields. I at least cannot see how such a thing would work. I did sit down and browse the paper I linked to, today, and I seem to recall that there are suggestions for how to turn the exponential explosion into a polynomial time algorithm, but if I recall correctly, the people who wrote the paper seemed to think it wasn't worth doing. There are lots of suggestions that are worth looking at though, even some that might apply in the ZZ case. In contrast, we *definitely* need van Hoeij in the bivariate ZZ case. Bill. On 18 Feb, 19:42, Roman Pearce <[EMAIL PROTECTED]> wrote: > > However, I don't know of any new (or old) algorithm by Mark van Hoeij > > that addresses the problem of "Efficient Multivariate Factorization Over > > Finite Fields" using LLL. Could you please clarify. > > I am aware of Mark's algorithms for univariate polynomial factorization > > over global fields using LLL. > > Sorry, what is the issue with Sage ? You need evaluation/ > interpolation and Hensel lifting ? --~--~-~--~~~---~--~~ To post to this group, send email to sage-devel@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/sage-devel URLs: http://www.sagemath.org -~--~~~~--~~--~--~---
[sage-devel] Is there a way to bind the notebook to a specific IP?
Hello,
Is there a way to bind the notebook to a specific IP?
So when checking with netstat, I'd like to see
Active Internet connections (only servers)
Proto Recv-Q Send-Q Local Address Foreign Address
State PID/Program name
tcp0 0 1.2.3.4:83000.0.0.0:*
LISTEN 11282/python
instead of
tcp0 0 0.0.0.0:83000.0.0.0:*
LISTEN 11282/python
This is usually something any service offers in its options.
xinetd: { bind = }
sshd: ListenAddress
mysql: bind-address =
apache2: Listen :80
etc etc
Option "address" of notebook() didn't help.
Thanks!
--~--~-~--~~~---~--~~
To post to this group, send email to sage-devel@googlegroups.com
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit this group at http://groups.google.com/group/sage-devel
URLs: http://www.sagemath.org
-~--~~~~--~~--~--~---
[sage-devel] Re: Sage 2.10.2.alpha0 released!
Hi, all, On Feb 14, 2008, at 22:41 , mabshoff wrote: > here is the first alpha0 for 2.10.2. It has been greatly delayed by > SD7 > and then at least on my end by the cold I brought home from it that > put > me out of commission for two days. The big changes in this release > are > > * Debianization of the build system > * unramified and eisenstein extensions > * code for enumerating totally real fields > > The tarball [206MB] is available at the usual place: > > http://sage.math.washington.edu/home/mabshoff/release-cycles-2.10.2/ > sage-2.10.2.alpha0.tar The build fails on my Mac OS X system [10.4.11, Dual Quad Xeon]. The last part of the install log is appended. The full (7MB!!) install log is in sage.math.washington.edu:logs/2.10.2.alpha0.log. I built it with "-j6". I'm trying it now without parallelism, but in the meantime, any thoughts? Justin = *** TOUCHING ALL CYTHON (.pyx) FILES *** scons: `install' is up to date. -- sage: Building and installing modified SAGE library files. Installing c_lib scons: `install' is up to date. Traceback (most recent call last): File "setup.py", line 1207, in deps = create_deps(ext_modules) File "setup.py", line 1198, in create_deps deps_graph(deps, f, visited) File "setup.py", line 1165, in deps_graph this_deps = search_all_includes(f) File "setup.py", line 1089, in search_all_includes S = open(filename).readlines() IOError: [Errno 2] No such file or directory: 'sage-main/sage/modules/ free_module_element.pyx' sage: There was an error installing modified sage library code. ERROR installing SAGE -- Justin C. Walker, Curmudgeon-At-Large Institute for the Absorption of Federal Funds Men are from Earth. Women are from Earth. Deal with it. --~--~-~--~~~---~--~~ To post to this group, send email to sage-devel@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/sage-devel URLs: http://www.sagemath.org -~--~~~~--~~--~--~---
[sage-devel] plotting cube root function
-BEGIN PGP SIGNED MESSAGE- Hash: SHA1 This is really upsetting: sage: plot(lambda x: x^(1/3), -5, 5) - --- Traceback (most recent call last) /home/ghitza/colby/ma311/ in () /opt/sage/local/lib/python2.5/site-packages/sage/plot/plot.py in __call__(self, funcs, *args, **kwds) ~ 3349 xmax = args[1] ~ 3350 args = args[2:] - -> 3351 G = self._call(funcs, (xmin, xmax), *args, **kwds) ~ 3352 else: ~ 3353 print "there were %s extra arguments (besides %s)" % (n, funcs) /opt/sage/local/lib/python2.5/site-packages/sage/plot/plot.py in _call(self, funcs, xrange, parametric, polar, label, **kwds) ~ 3419 del options['plot_division'] ~ 3420 while i < len(data) - 1: - -> 3421 if abs(data[i+1][1] - data[i][1]) > max_bend: ~ 3422 x = (data[i+1][0] + data[i][0])/2 ~ 3423 try: : 'float' object is unsubscriptable - - Yes, it's related to tickets #2038 and #2045, but much worse, because in this case not only is the error message "unfriendly", but it's also unwarranted: the cube root is a well-defined function on all of RR, so it should be possible to get a plot of it on the interval [-5,5]. This probably got broken when (-1)^(1/3) stopped being -1. Alex - -- Alexandru Ghitza Assistant Professor Department of Mathematics Colby College Waterville, ME 04901 http://bayes.colby.edu/~ghitza/ -BEGIN PGP SIGNATURE- Version: GnuPG v2.0.7 (GNU/Linux) Comment: Using GnuPG with Mozilla - http://enigmail.mozdev.org iD8DBQFHulB+dZTaNFFPILgRApr2AJ4p1Vc9PimTKNsFUS/Lw32tSbAvDgCfYjsF ol3u1oW3kpRM9dK/o08+UAw= =ZkrJ -END PGP SIGNATURE- --~--~-~--~~~---~--~~ To post to this group, send email to sage-devel@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/sage-devel URLs: http://www.sagemath.org -~--~~~~--~~--~--~---
