On Aug 25, 10:33 am, Martin Albrecht
wrote:
> Excuse my ignorance, I am sure this was answered a long time ago but I can't
> find it right now: why don't you just steal the memory manager back from GMP,
> i.e. why does ECL require the GMP memory manager to use its garbage collected
> memory?
Yes
On Aug 25, 12:59 pm, Jason Moxham wrote:
> GMP will still need to allocate memory for internal needs using its
> allocator,
> but it is freed again . If the destination operand has enough memory for the
> largest possible output +1 then this should be enough , although I dont know
> if we can
On Aug 26, 2:53 pm, John Cremona wrote:
> Interesting -- can you supply more details (and or a reference)?
>
> I have used hg_sage.apply() many times; how does import_patch() differ?
>
I can. And so can you :-)
sage: hg_sage.apply?
Type: instancemethod
Base Class:
String Form:
On Aug 26, 5:19 pm, Jason Moxham wrote:
> I think you mean you allready know the size that is big enough to hold the
> answer , which is not the same as what GMP needs to allocate to calculate the
> answer. For example to multiply two ints of 2000 limbs and 3000limbs , the
> result may fit in 499
On Aug 26, 7:06 pm, Nils Bruin wrote:
OK, so r and d would probably get allocated using
mpz_t *r
mp_ptr d
r = (mpz_t) ecl_alloc(sizeof(mpz_t)+(c->_mp_size )*sizeof(limb))
d = (mp_ptr) (r+1)
r->_mp_size = c->_mp_size
r->_mp_d = d
r->_mp_alloc = c ->_mp_size
Look
On Aug 27, 3:46 am, Jason Moxham wrote:
> the source arguments to the mpz_* functions are const pointers so the memory
> they point to will not change (thru that pointer) , ie as long as c does not
> alias a or b then GMP will not change a or b . The above code will work.
Excellent. So that giv
On Aug 27, 9:07 am, rjf wrote:
> Let GMP do its own memory allocation. After Lisp has itself allocated
> a structure S with a pointer to a GMP-allocated object, it knows what
> to do: either S is
> used or not, determined by a garbage collection. When S is
> determined to be not used, mpz_clea
On Aug 27, 5:16 pm, Juanjo
wrote:
> I have just uploaded some patches to our source repositories that
> allow ECL coexist with a GMP library which uses other memory
> allocation functions. The changes are available in the CVS and git
> repositorieshttp://ecls.sf.net/download.html
> and will under
On Sep 3, 2:32 pm, Ralf Hemmecke wrote:
> That seems to extract and then starts doing something, but without
> success. I have sage 4.1. Do I really need 4.1.1?
>
> Is it relevant whether or not I run on a 32bit system?
>
> I don't have ecl on my system. Shouldn't the fricas spkg just use the
>
On Sep 4, 12:30 pm, Maurizio wrote:
> I beg your pardon for asking silly questions... would you please
> explain which is the reason for having different variables with the
> same name... and even more, with different domains?
In an interactive session this would probably be a bad idea. However,
Thanks to some very helpful changes to the way that ECL uses GMP made
by Juanjo, it is now possible to interface ECL cleanly with SAGE as a
library. I have constructed a prototype. Patch is available at:
http://sage.math.washington.edu/home/nbruin/eclmax.patch
but you do need the CVS version of
On Sep 5, 12:22 pm, Nils Bruin wrote:
> You can do something like:
>
> sage: init_libmax()
oops. sorry. Before that you need a
sage: from sage.libs.ecl import *
of course.
--~--~-~--~~~---~--~~
To post to this group, send an email to sage-devel@googleg
On Sep 5, 1:55 pm, Golam Mortuza Hossain wrote:
> Thanks for you great work! I am interested in trying out your patches.
> I have a rather naive question: is it possible to put your library interface
> in parallel with the current interface? I mean does the pexpect interface
> need to be taken d
On Sep 5, 2:56 pm, William Stein wrote:
> So did it turn out to be impossible to just write some sort of layer
> that just passes strings back and forth to *maxima* but via a C
> library-level interface? Just curious.
No, that is quite possible. Some of the earlier examples basically did
that.
On Sep 6, 2:28 am, Juanjo
wrote:
> On Sep 5, 9:22 pm, Nils Bruin wrote:
>
> > couldn't convince the C compiler that two mpz_t's were really of the
> > same type)
>
> mpz_t's are not designed to be copied around.
Well, mpz_t is a pointer to a certain struc
On Sep 7, 3:58 am, Golam Mortuza Hossain wrote:
> IMO, minimal but functional library would be the right way to go.
> From my personal experience, trying to do one small step at a time leads
> to much further distance in long run rather than trying to do everything
> at one go.
and on Sep 7, 4:1
On Sep 8, 7:13 am, Golam Mortuza Hossain wrote:
> However, it is done under an assumption (documented with examples)
> that arguments of the function are independent for the purpose of
> applying chain rule.
>
> An example situation where above assumption is violated, is
>
> sage: f(x,x)
On Sep 8, 9:40 am, Golam Mortuza Hossain wrote:
> The issue is what to do when a user explicitly ask to apply chain rule
> by over-riding default setting but provides f(x,x) as the function?
Ah, I see. You are applying the wrong chain rule. You need
multivariate calculus. f(x,x) is a composition
Inspired by a little experiment we did to see if there is room to
improve to ECL's bignum performance, we ran a little experiment
computing fibonacci numbers (we wanted to test addition because it was
mainly ECL's memory management that was under consideration)
with the following defs:
def fibo(
On Sep 13, 2:38 pm, William Stein wrote:
> > This tip should be fleshed out and included somewhere in the release
> > management wiki page at
>
> >http://wiki.sagemath.org/release
>
> > I feel ashamed to admit that I'm not able to do this fleshing out work
> > as I hardly use the notebook.
>
> I'
On Sep 14, 3:47 pm, Sebastian Pancratz wrote:
> 1.
>
> Given rational polynomials a and b, what should gcd(a,b) return? The
> problem arises since the gcd is only defined up to rational units. I
> think the two sound options are either the monic normalisation, or a
I think any mathematician wo
On Sep 8, 3:38 am, Jason Grout wrote:
> Would it be pythonic enough to have n(pi/2,pi,2*pi) return a list of
> three values? That way we could do:
>
> n(*my_list)
>
> Note that min, max, and other functions work something like this, in
> that they accept a variable number of arguments.
They do,
Just a datapoint that might provide useful feedback for those who are
trying to make binary installs a smooth experience:
I tried to install 4.1.2 on a Fedora 10 (i686) laptop. I tried both
the Fedora 9 and the Fedora 11 image. With either I got errors:
ImportError: /usr/lib/libstdc++.so.6: vers
On Oct 21, 10:08 am, William Stein wrote:
> Would you be willing to test taking a fresh install of the fedora 11
> binary and dropping
> libstdc++ from Fedora 11 (etc.) into your local/bin/?
$sage_root/local/lib I presume.
Sure. Can I get the appropriate libstdc++ from somewhere? Is there an
i
I dropped the file into $sageroot/local/lib, made the symbolic link
ln -s libstdc++.so.6.0.12 libstdc++.so.6
and ran sage in my by now weird hybrid binary install with a few spkgs
compiled from source and, surprisingly,
NO ERRORS! So apparently, the locally compiled files run quite happily
with th
On Oct 21, 8:42 pm, William Stein wrote:
> Did you run "make test"? I'm curious if everything works.
yes, one error:
File "/usr/local/sage/4.1.2/devel/sage/sage/modules/
vector_double_dense.pyx", line 663:
sage: v.stats_kurtosis()
Expected:
-1.23
Got:
doctest:106: SyntaxWarning: a
First,
http://trac.sagemath.org/sage_trac/ticket/6781
now has a reviewable patch attached to it. This ticket deals with
adding ECL as a library to Python.
Since LISP and Python are actually rather closely related in how they
view data, one can map over
a lot of the data in a rather faithful fash
On Oct 26, 11:49 am, kcrisman wrote:
> This could be wonderful news! Have you done any experimentation thus
> far comparing timings on Maxima-lib (with the not-yet-submitted code)
> versus Maxima pexpect? Say, for integrate(x^3+5*sin(x),x) or
> something. I remember threads from long ago on t
On Oct 27, 7:17 pm, Jason Grout wrote:
> What is the reason for insisting that the
> thing must be a RingElement (as opposed to, say, an Element)?
One reason I could see is because elements of the SymbolicRing are
supposed to be ring elements, and vectors generally are not. However,
there are a
On Nov 2, 8:48 am, William Stein wrote:
> * After one year we are allowed to remove deprecated code, but we
> only actually do so at major releases (e.g., 5.0, 6.0, 7.0 etc.)
> Thus Sage-5.0 *will* remove deprecated code that was deprecated at
> least a year ago.
I think this is a very clear p
As a proof of concept, there is now some code attached to:
http://trac.sagemath.org/sage_trac/ticket/7377
It is just a separate python module, not explicitly placed in the sage
tree. It depends on two tickets that are ready for review. Kcrisman
has already looked at them, but they could use some
On Nov 4, 10:38 am, William Stein wrote:
> It would be really, really awesome in anybody could figure out how to
> produce i686 binaries that work on all machines. Nobody has ever
> done so successfully. The only two packages in the Sage that cause
> problems are MPIR (fork of GMP) and ATLAS
On Nov 14, 10:03 am, Jason Grout wrote:
> William Stein wrote:
> > Burcin -- does this needs to be added? I can't figure out how to do
> > it either? It used to be easy with the old symbolics, but not with
> > the new ones.
What you are looking for is is_SymbolicVariable(), I think.
I think c
On Nov 21, 4:42 pm, ghtdak wrote:
> In particular, where I'm getting bitten hard is svn and git. Neither
> will run with sage's libgnutls.
>
> I "almost" had it beat by doing everything without the Sage
> environment which uses general Ubuntu tools until it came to the
> Enthought suite's "ets" c
On Nov 25, 10:39 am, Pat LeSmithe wrote:
> An open-ended query, naive in several ways:
>
> Is it possible to generalize Cython
>
> http://www.cython.org/http://en.wikipedia.org/wiki/Cython
>
> to Cilk / Cilk++
According to Cilk's description, Cilk is simply "C" plus some extra
keywords. What you
On Dec 2, 11:47 am, John H Palmieri wrote:
> sage: ed # or %ed or %edit
>
> then it opens up your favorite editor (whatever is set by the $EDITOR
> shell variable). Then in the editor you can type
>
> sage: ed FF
>
> and it will let you modify your code. This is an ipython feature, it
> seems.
On Dec 12, 4:24 pm, Jason Grout wrote:
> [f(x) for x in [1..10] if f(x)>0]
This is actually bad style. It means that f gets evaluated twice for
all the values that end up in the list.
The magma language solves this with modified semantics for the "where"
clause. One would write:
[ v : x in [1..1
On Dec 12, 5:56 pm, Jason Grout wrote:
> There's apparently a lot more overhead than I would have imagined:
>
> sage: %timeit [v for v in (x for x in range(10) ) if v > 0]
> 10 loops, best of 3: 5.4 s per loop
> sage: %timeit [v for v in range(10) if v>0]
> 10 loops, best of 3: 2.98 s per
This is in sage 4.2.1 (obtained from upgrading from 4.1.1)
after doing
sage -clone trac128
I get
[...]
real0m51.392s
user0m46.849s
sys 0m3.354s
After cloning, if you change any Sage library files and want to
rebuild
the html version of the reference manual, use the command
sag
On Mon, Dec 22, 2008 at 10:23 AM, Robert Bradshaw
wrote:
> > On Dec 22, 2008, at 6:20 AM, John Cremona wrote:
>
> >> You can do K(r.lift()), but it would be nicer if this was handled by
> >> coercion magic.
>
> > This isn't really a coercion issue per se, it's a question of adding
> > another ca
On Jan 30, 10:46 am, Jason Grout wrote:
> Add a warnings handler which traps the Matplotlib deprecation
> warning. This handler will compare the matplotlibrc with the one that
> was distributed in the last release (maybe by checking a hash value).
> If it is identical (i.e., the user hasn't mod
I noticed a slight blemish on the index page that appears on the
mirrors:
The problem is the height of the frame. It's given in px rather than
em. So, if someone selects a font that is higher than 16px, the text
does not fit in the frame. Firefox 2.0.0.14 (and a lot of others as
well, I bet) re
Given the resolution of
http://trac.sagemath.org/sage_trac/ticket/3936
it may be too hard to solve this one:
A=GF(7)['h','k']
B=RealField()['x','y']
C=Integers()
Ahttp://groups.google.com/group/sage-devel
URLs: http://www.sagemath.org
-~--~~~~--~~--~--~---
If I do search_doc("orbit") in sage 3.4 (in the notebook), I get
(amongst others) a link:
https://localhost:8000/doc/live/html/en/reference/genindex-F.html
which leads to a "resource cannot be found". The appropriate link
seems to be
https://localhost:8000/doc/live/reference/genindex-F.html
It
http://trac.sagemath.org/sage_trac/ticket/5593
has a trivial patch attached to change the returned range to something
that works in srange(*CremonaDB().conductor_range()).
--~--~-~--~~~---~--~~
To post to this group, send email to sage-devel@googlegroups.com
To uns
On Jan 7, 1:26 pm, "Dr. David Kirkby" wrote:
> > In the new version of sage-env, there are two "if" statements
> > involving "$SAGE_PRINT_ENVIRONMENT". It makes a lot of sense not to
> > print these by default (for example, when starting Sage), but maybe
> > the second group of statements, summar
On Jan 15, 7:00 am, kcrisman wrote:
> Maybe Nils has a comment on whether library use of Maxima would make
> it easier to work around this problem? I know he's hoping to do
> something with this at the Bug Days.
If we use maxima via a library interface and communicate exclusive
In sage's symbolic module, forget() is supposed to forget all
assumptions. It mainly does this by passing "forget(facts())" to the
calculus instance of the maxima-interface. However, forget(facts());
is often not valid in maxima: facts also reports facts that have been
introduced by "declare();", a
On Jan 18, 11:27 pm, Burcin Erocal wrote:
> I'm not familiar with the maxima interface, but the comment by Robert
> Dodier reproduced here
>
> http://trac.sagemath.org/sage_trac/ticket/7507
>
> seems to suggest we need to call remove() in some cases.
Thanks! very relevant indeed. That just means
On Jan 28, 1:01 pm, Mike Hansen wrote:
> You can easily create SVG plots as it is now:
>
> sage: p = plot(x^2, -2, 2)
> sage: p.save('xsquared.svg')
Interesting. In firefox 3.5.2, this actually does not work in the
notebook:
If I do this example, I end up with an "Additional plugins are
required"
On Feb 5, 8:24 am, "Dr. David Kirkby" wrote:
> If I run
>
> ./sage -t devel
>
> where is the log file kept? In particular, where is it kept if you use a
> global
> install of Sage, and so don't have write access to any directories under
> $SAGE_ROOT?
I do ./sage -t devel > /my/testlog/dir/test.l
On Feb 7, 9:19 am, Pat LeSmithe wrote:
> I've published spkg dependency graphs for Sage 4.3.2 at
>
> http://www.sagenb.org/home/pub/1530/
>
> Comments, corrections, etc., are welcome!
A very nice picture, but it made me notice something about the default
graph lay-out:
There are cases where a ver
I noticed that "keepfloat: true" does not get always get honoured by
maxima. A symptom:
sage: integrate(cos(1.17*x),x)
0.854700854701*sin(1.17*x)
(works as expected)
sage: S=integrate(cos(1.17*x^2),x)
sage: S
-1/156*((5*I + 5)*sqrt(2)*sqrt(13)*erf((3/20*I -
3/20)*sqrt(2)*sqrt(13)*x) + (5*I - 5)*
On Feb 8, 5:29 am, Burcin Erocal wrote:
> If we use number fields for algebraic numbers, then the degree of the
> extension over QQ grows to unreasonable values rather quickly. E.g.,
> if we add \sqrt{2}, \sqrt[3]{2}, sqrt[5]{2}, ... the degree will be
> proportional to factorial(n). Though, I wou
Finally we got to the cool stuff of running maxima in an embedded
lisp: direct expression tree translation between SR and maxima. See:
http://trac.sagemath.org/sage_trac/ticket/7377
Timing improvements are disappointingly little: The translation of the
expressions simply isn't all that big of a bot
On Feb 8, 10:22 pm, William Stein wrote:
> Yes it does.
Sorry for slandering the expect interface. I noticed that the expect
interface has a facility for reusing variables and that the maxima
expect interface doesn't use it. But you show that deletion does
happen, so no memorial benefit should be
On Feb 10, 1:39 am, Stan Schymanski wrote:
> Dear all,
>
> I suppose that the below is not possible yet, so I am forwarding this
> to sage-devel. I think it would be great if one was able to access
> parts of an expression in a nested way, e.g.
>
> expr1 = (a*x^3 + b*x)/(1 - Sqrt((1 - x)/(x - c)))
Just from a purely pragmatic perspective, I would love if for binary
builds the libraries (especially libstdc++) used during building would
be *available* (not necessarily linked to) by default. Several times I
ran into a situation where I quickly wanted to test something with a
new version of sage
On Feb 24, 2:48 pm, William Stein wrote:
> What happened last year, by the way, was that several people wanted to
> write a GSOC application. However, nobody volunteered to mentor any
> Sage-related GSOC projects at all. As a result, we did not even apply
> to have Sage as a mentoring organizati
On Mar 6, 1:49 am, Robert Bradshaw
wrote:
> We're talking about adding and scaling colors here--there arguably
> isn't a "right" answer here, though we do want what we do to be good
> and consistent, and it is documented what it does.
That is probably true, but surprisingly, there are "wrong
On Mar 28, 9:10 pm, William Stein wrote:
> I'm for allowing the use of Python in the Sage build system.
It seems to me that with a little care one could have python used in
some parts of the build system and avoid declaring python a
prerequisite for python.
If a package "requires" another spkg,
On Apr 21, 12:37 pm, Simon King wrote:
> Hi!
>
> I am trying to translate "coercion" to German. In dictionaries and
> Wikipedia, I only found the legal notion of a coercion, but I doubt
> that "kanonische Nötigung" and "Nötigungsmodell" are good translations
> for "canonical coercion" and "coercio
On May 4, 5:08 pm, Ondrej Certik wrote:
> I was bitten by this too in FEMhub. setuptools simply sometimes want
> to download things from the net. Is there some way to disable it? I
> want the build to just fail, if I accidentally switch the order of
> packages. Otherwise it's easy for me to miss i
I would expect that when one evaluates a polynomial, only the coercion
properties of the *base ring* of the polynomial ring relative to the
ring of definition of the evaluation point are important, but the
example below gave me an unexpected negative answer.
The fact that R is has an automatic coe
On Jun 11, 12:44 pm, John Cremona wrote:
> Nils,
>
> Seehttp://trac.sagemath.org/sage_trac/ticket/8502. I had found that,
> depending on the base ring, the result of evaluating all the variables
> was sometimes in the coefficient ring and sometimes a (constant)
> polynomial.
On Jun 11, 12:59 pm, John Cremona wrote:
> All I really meant was that the function giving your problem has also
> given other problems, which have been fixed in it, but that is
> certainly the place to look for someone fixing your bug.
It looks like other people consider this a bug as well then
The following ticket has been marked as fixed and merged in 4.4.2:
http://trac.sagemath.org/sage_trac/ticket/8645
however, I have just built 4.4.3 from source and the orginally
reported problem still occurs (i.e., "maxima.fasb" cannot be copied,
but maxima-5.20.1.p0 happily reports successful ins
On Jun 15, 5:05 pm, kcrisman wrote:
> invalid/wontfix means yet another thing.
"... than fixed" I presume. But #8645 is closed as "fixed", not as
"invalid" or "wontfix". I observed that the issue is not "fixed", so
that's why I suspected a misfiling. I don't know how important it is
to keep an acc
On Jun 17, 10:32 am, Robert Dodier wrote:
> On Jun 16, 11:24 am, Tom Coates wrote:
>
> > A) factorial(x) should raise an error;
>
> > B) factorial(x) should return gamma(x+1).
>
> More generally, the question is what to do with something
> which doesn't make sense according to whatever rules ha
On Jun 17, 12:51 pm, William Stein wrote:
> In Sage, the behavior of sqrt(2) versus sqrt(4) is considered very reasonable
> to most users. And it does exactly what you claim is "rather bad form".
>
> sage: sqrt(2)
> sqrt(2)
> sage: sqrt(4)
> 2
> sage: type(sqrt(2))
>
> sage: type(sqrt(4))
>
Th
On Jun 18, 8:12 am, "Dr. David Kirkby"
wrote:
> Sorry, it was the original purpose of #8951, but now #8951 has been expanded -
> perhaps too much, as now it has a whole new version of ECL which seems to be
> stalled because of maxima
http://trac.sagemath.org/sage_trac/ticket/8645 has a minimally
One of my students observed that if you type an expression in the
notebook on one line, the resulting value is printed:
{{{
(x+1)
///
x+1
}}}
but if you put a new line inside the paretheses (which in python does
not change the semantics) the resulting value is no longer printed:
{{{
(x+
1)
///
}}}
I tried building sage 4.4.4 with
export SAGE_PARALLEL_SPKG_BUILD="yes"
export MAKE="make -j4"
make
but got:
"""
- use the `-Wl,--rpath -Wl,LIBDIR' linker flag
- have your system administrator add LIBDIR to `/etc/ld.so.conf'
See any operating system documentation about shared libraries for
On Jun 27, 7:41 pm, John H Palmieri wrote:
> But there is now also a directory spkg/logs/ in which the output for
> each package gets written into a separate file. So you can use those
> for troubleshooting.
That is not present (does that get cleaned up by make clean?) so
perhaps I didn't do eve
It seems that executing a python script via sage-native-execute can
cause problems, because not everything gets reset:
$ sage -sh
Starting subshell with Sage environment variables set.
Be sure to exit when you are done and do not do anything
with other copies of Sage!
Bypassing shell configurati
This is now http://trac.sagemath.org/sage_trac/ticket/9386
I found that the symptom (with magma) is recent: It's due to the
merger of http://trac.sagemath.org/sage_trac/ticket/8560
--
To post to this group, send an email to sage-devel@googlegroups.com
To unsubscribe from this group, send an email
On Jun 29, 4:13 pm, François Bissey wrote:
> sage doesn't assume that the patch command is installed but rely on cp being
> there. That's why patch aren't used.
> I agree not ideal but that's a lowest common denominator issue.
Perhaps compare the md5sum of the original and bail if it's not the
ex
Setting ulimits is generally a good idea, because excessive memory
use is usually a sign of a bug, and it is better if the program
crashes before it forces the system to thrash its swapspace
(especially on multi-user machines)
One can set "soft" ulimits, which are generally the right thing: The
u
This is something peculiar to sage. The python shipped with sage does
not have this problem:
sh-3.2$ ulimit -S -v 100
sh-3.2$ sage -python
Python 2.6.4 (r264:75706, Jun 27 2010, 16:50:30)
[GCC 4.1.2 20080704 (Red Hat 4.1.2-48)] on linux2
Type "help", "copyright", "credits" or "license" for more
Ah, found it.
devel/sage-main/sage/all.py, line 179:
# maximize memory resources
try:
import resource # unix only...
resource.setrlimit(resource.RLIMIT_AS, (-1,-1))
except:
pass
This seems rather rude to me. Perhaps this should simply not be done?
--
To post to this group, send a
Patch up at http://trac.sagemath.org/sage_trac/ticket/9398
ready for review.
--
To post to this group, send an email to sage-devel@googlegroups.com
To unsubscribe from this group, send an email to
sage-devel+unsubscr...@googlegroups.com
For more options, visit this group at http://groups.google.
I am not completely sure that I understand how William's proposal
affects the procedure for making spkgs. What I have done the last
couple of times that I made an spkg update is:
1. sage -sh
2. tar xjf package.p0.spkg
3. replace src with the new version
4. (re)place files in package.p0/patches
Indeed, in python/src/Objects/intobject.c we have:
-
#ifndef NSMALLPOSINTS
#define NSMALLPOSINTS 257
#endif
#ifndef NSMALLNEGINTS
#define NSMALLNEGINTS 5
#endif
#if NSMALLNEGINTS + NSMALLPOSINTS
On Jul 29, 9:51 am, Simon King wrote:
> 4)
> sage: SR(p)
> BOOM
shouldn't there at least be some consistency in the *characteristic*
of the symbolic ring? I can see how someone might want to make a
"symbolic ring of characteristic p", but mixing different
characteristics can't possibly lead to g
In characteristic 0 are there problems:
sage: T=SR(pAdicField(5)(1/3))
sage: T.pyobject()
2 + 3*5 + 5^2 + 3*5^3 + 5^4 + 3*5^5 + 5^6 + 3*5^7 + 5^8 + 3*5^9 + 5^10
+ 3*5^11 + 5^12 + 3*5^13 + 5^14 + 3*5^15 + 5^16 + 3*5^17 + 5^18 +
3*5^19 + O(5^20)
(fair enough - it just gets wrapped)
sage: T=SR(pAdi
The problem of "<" not providing a total ordering seems to come up
again and again in different situations. There are two cases now
already where it is clear that even in Python "<" does not signify a
total ordering anymore:
- python complex numbers ( < gives an error)
- python sets ( < denotes
On Aug 4, 4:23 am, Robert Miller wrote:
> I'm not sure what the point of a comparison function is if we don't
> implement a total ordering. The main place cmp methods get used is in
> sorting.
But it is a fact that Python has already abandoned total ordering
semantics for "<".
> If you have a la
On Aug 4, 1:16 pm, Robert Miller wrote:
> So you want Sage Sets to implement "a < b" to mean "a is a subset of
> b"? I'll admit that that is reasonable, and it is a fact that it
> follows Python convention.
My initial reaction for this is affirmative: If python makes a choice,
then sage must foll
On Aug 4, 3:14 pm, Robert Miller wrote:
> If Python jumped off a cliff...
Then Sage might as well :-). Or be reimplemented in CL.
> So then you would rather have Sage sets give an error rather than sort
> in a list? I can't imagine why this is a good thing. You seem to be
> ignoring the sorted()
On Aug 4, 4:20 pm, Nils Bruin wrote:
> O(len(L)*len(V)*log(len(V)))
sorry. That was a typo. Binary search means
O(log(len(L))*len(V)*log(len(V)))
--
To post to this group, send an email to sage-devel@googlegroups.com
To unsubscribe from this group, send an email to
sage-devel+unsub
On Aug 4, 3:44 pm, mda_ wrote:
> >http://docs.python.org/py3k/whatsnew/3.1.html#pep-372-ordered-diction...
Thanks! That makes me want to use Python 3.1.
--
To post to this group, send an email to sage-devel@googlegroups.com
To unsubscribe from this group, send an email to
sage-devel+unsubscr..
When I paste the following code into a notebook worksheet in magma
mode, I consistently get "Syntax Error". When I paste the same code
directly into magma, it works properly:
{{{
_:=PolynomialRing(Rationals());
repeat
g:=3*b*x^4+18*c*x^3-6*b^2*x^2-6*b*c*x-b^3-9*c^2 where
b:=Random([-10..10]) whe
http://trac.sagemath.org/sage_trac/ticket/9705
exact traceback in ticket.
--
To post to this group, send an email to sage-devel@googlegroups.com
To unsubscribe from this group, send an email to
sage-devel+unsubscr...@googlegroups.com
For more options, visit this group at http://groups.google.co
On Aug 10, 10:29 am, Bill Hart wrote:
> Just in case this is being missed here, a problem is by definition in
> NP only if it has been shown equivalent to one of the other NP-
> complete problems.
I assume that with "equivalent" you mean "polynomially equivalent".
With your definition, P subset N
On Aug 27, 7:29 am, kcrisman wrote:
> Usually the dummy variables (like in solve()) don't have this
> problem. I don't think they have a ? in front of them, though. It
> would be possible to add this to the Maxima parser, I suppose.
This is *much* easier to deal with in library mode :-). You ju
On Sep 1, 11:00 am, Simon King wrote:
> But then, what can one do? I.e., how can one safely doctest the
> contents of a dictionary D?
If the default choice of "sorted" is not portable, make sure to tell
the system to sort on something that is portable, like you suggest:
> At least in this examp
On Sep 6, 4:55 am, Simon King wrote:
> It seems that due to this problem, my package may compute a different
> (though isomorphic) ring presentation for a cohomology ring on
> different machines.
>
> But in some tests, I create elements with certain properties, and for
> that purpose I need a comp
This might do what you want (but it's not in sage as far as I know):
http://pypi.python.org/pypi/bidict/
--
To post to this group, send an email to sage-devel@googlegroups.com
To unsubscribe from this group, send an email to
sage-devel+unsubscr...@googlegroups.com
For more options, visit this g
This is tracked on http://trac.sagemath.org/sage_trac/ticket/9774
--
To post to this group, send an email to sage-devel@googlegroups.com
To unsubscribe from this group, send an email to
sage-devel+unsubscr...@googlegroups.com
For more options, visit this group at http://groups.google.com/group/s
On Oct 24, 9:08 am, Simon King wrote:
> My impression is that a big change in the category framework,
> infiltrating many parts of Sage, should be discussed here. Do people
> think that a gain in flexibility provided by my additions to the
> category framework would justify a performance loss of 1
101 - 200 of 1748 matches
Mail list logo
