Is there a reason you can't use finite cyclotomic fields? These exist in
Sage and are reasonably well optimized. And GAP supports matrix groups over
them, though as David Joyner mentioned, I don't think that functionality is
wrapped from Sage. Defining matrix groups over finite cyclotomic
Cool. I'd be happy to review that after Wednesday (when I have an
application due). I can provide the perspective of someone who works mostly
within sage.rings rather than sage.combinat.
David
On Sat, Oct 16, 2010 at 18:17, Christian Stump christian.st...@gmail.comwrote:
Is there a reason
See
http://groups.google.com/group/sage-devel/browse_thread/thread/198fd3db9631e5bf?pli=1
David
On Wed, Oct 13, 2010 at 21:03, S helm.sh...@gmail.com wrote:
Hi group,
I'm new, and not sure how new components are added to the SAGE
package, but recently Google open-sourced it's python-based
reviewed). So if people want speedups for coercion between Integers and
IntegerMods and between lists and Polynomial_zmod_flint, someone should
review the finite field patches. :-)
David
On Thu, Sep 9, 2010 at 20:53, David Roe r...@math.harvard.edu wrote:
There are some implemented coercion maps
Recently I've been running into NameError: name 'sage_jsmath_macros_easy'
is not defined whenever I make a mistake that generates an error during
sage's import. I tracked this down to the following section of code in
sagenb.misc.misc:
try:
import sage.all
from sage.misc.latex_macros
There are some implemented coercion maps already (see
sage.rings.finite_rings.integer_mod.Integer_to_IntegerMod). Many of these
tickets can be solved by writing optimized coercion and conversion morphisms
and including appropriate section() functions on some of them. See the
patch at #9814,
For A and B Parents, should A == B ever differ from A is B? This came up in
tracking down a p-adics bug, but there's at least one place that assumes the
equivalence of these conditions. The place I'm thinking of is in
sage.categories.hom_set.Hom, where it checks a cache to see if the Homset
has
So, I have a patch up at #9814 which improves the situation. One thing to
note is that addition actually puts off the mpz_remove until later: the x
you obtain from x = y + z has x._normalized = False, so that repeated
additions don't require multiple mpz_removes. You can argue with this
design
So, I haven't looked at profiling for p-adics for quite a while. But one
way to speed up this kind of item creation is to implement a morphism from
ZZ to Qp and then write a super-fast _call_ method. I can't do it right
now, but I can provide advice if someone else wants to.
David
On Fri, Aug
I use both clone and queues: if I'm working on multiple projects
simultaneously I would prefer to have a clone for each instead of just using
queues. This is especially important if some of my patches touch low level
.pxd files (e.g. sage/structure/element.pxd): I really don't want to be
pushing
I agree. I'm looking at it now.
David
On Wed, Jun 23, 2010 at 2:11 PM, Robert Bradshaw
rober...@math.washington.edu wrote:
On Jun 23, 2010, at 10:32 AM, Robert Miller wrote:
I'm curious about the following behavior:
sage: E = EllipticCurve('37a')
sage: R = E.padic_regulator(7)
sage:
I think Robert's said it fairly well. Which is good, since I'll have
spotty internet for the next couple weeks, and my battery is about to
run out.
On 5/15/10, Robert Bradshaw rober...@math.washington.edu wrote:
On May 14, 2010, at 11:13 AM, Simon King wrote:
Hi Robert!
On 14 Mai, 18:34,
Marshall's right that you need to change where the import comes from, but
you actually want
from sage.rings.finite_rings.constructor import FiniteField
The class in sage.rings.finite_rings.finite_field_base is the base class,
whereas FiniteField in constructor is the UniqueFactory that makes
Try wrapping 171 with Integer and int, and 1.0 with float and RR in various
combinations. My guess is that Python's treating 1.0 as a float.
David
On Sun, Mar 7, 2010 at 10:15 AM, mhampton hampto...@gmail.com wrote:
One clue is that factorial(171) is too big to fit as a long int in
python.
2) Macbook Pro, circa 2009
2.66GHz Intel Core 2 Duo
Fairly loaded (Activity Monitor reports about 70% idle CPU, 635MB/4GB free
memory)
But the conclusion seems fairly clear.
Median time of 5 runs:
real0m2.390s
Maximum of the 5 runs:
real0m22.064s
The maximum was first, and afterward all
+1 to Robert's arguments. Using class inheritance as much as you can is the
way to go.
David
On Mon, Mar 1, 2010 at 3:18 PM, Robert Miller r...@rlmiller.org wrote:
A. Change BipartiteGraph so that it doesn't inherit from Graph.
B. Make BipartiteGraph handling an integral part of the Graph
I agree, subject to changing SageObject in 1 to Element and
CategoryObject.
David
On Sat, Feb 27, 2010 at 6:14 AM, Florent Hivert
florent.hiv...@univ-rouen.fr wrote:
Hi Robert,
In order to sanitize the behavior of objects, parents and elements in
sage,
I'm about to add some tests
No idea. They're all timeout failures, but the other timings seem
reasonable. If it doesn't pop up again I wouldn't worry about it too much.
David
On Fri, Feb 26, 2010 at 5:46 AM, ErwinJunge erwinju...@gmail.com wrote:
Hi again,
I tried running the failed tests again, and now they all
On Fri, Feb 26, 2010 at 3:59 PM, Florent Hivert
florent.hiv...@univ-rouen.fr wrote:
Hi there,
In order to sanitize the behavior of objects, parents and elements in sage,
I'm about to add some tests to the framework. I think they are all
reasonable
but I may be asking to much. Please
+1 from me.
David
On Fri, Feb 26, 2010 at 1:41 PM, David Kirkby david.kir...@onetel.netwrote:
If one runs 'make test' it creates a file test.log in $HOME/.sage/tmp
If would be useful if that file had the date and time in its name, or
even the PID so one could test multiple versions of Sage
See
http://groups.google.com/group/sage-devel/browse_thread/thread/b559a8a6abf228ed/e190520404bb58c8?lnk=gstq=Tab+Completion+Broken+in+4.3.2#e190520404bb58c8
And #8223.
David
On Thu, Feb 25, 2010 at 8:26 AM, Simon King simon.k...@nuigalway.ie wrote:
Hi!
I just found that introspection for
Go for it. Note that 8335 changes squarefree_decomposition (adding code for
characteristic p; there are no material changes to the characteristic 0
code. But there will be a merge conflict with any change you make.
David
On Wed, Feb 24, 2010 at 2:13 AM, Dima Pasechnik dimp...@gmail.com wrote:
Hey all,
I have two series of patches I've been working on and need some help
reviewing them.
The first implements coercion within lattices of finite fields. So you can
now do the following:
sage: k = GF(9)
sage: l = GF(27)
sage: x = k.gen() + l.gen(); x
z6^5 + 2*z6^4 + 2*z6^3 + z6^2 + 2*z6 + 1
PM, William Stein wst...@gmail.com wrote:
On Tue, Feb 23, 2010 at 10:18 AM, David Roe r...@math.harvard.edu wrote:
Hey all,
I have two series of patches I've been working on and need some help
reviewing them.
The first implements coercion within lattices of finite fields. So you
can
If you're calling the functions from cython code, and your variables are
cdef'd properly (so that the cython compiler knows the type of the object),
and the function you're calling is cdef'd, it will use C function calls and
you can pass in C types.
David
On Sat, Feb 20, 2010 at 7:46 AM, Nathann
More generally, The % operator tends to return the remainder term, in the
same ring. mod(a, b) constructs an element of the quotient ring. So, the
behavior you're observing is intended, though perhaps a bit unexpected.
David
On Sun, Feb 21, 2010 at 11:32 AM, John Cremona
I think that the reason for having mod behave the way it does is that the
percent operator is defined by __mod__.
Personally, I have no strong preference as to whether a.mod(b) behaves like
a % b (ie a.__mod__(b)) or like mod(a, b).
David
On Sun, Feb 21, 2010 at 4:08 PM, slabbe sla...@gmail.com
as the global function mod, or the same as the method
__mod__ that defines the % operator.
David
On Sun, Feb 21, 2010 at 6:05 PM, John Cremona john.crem...@gmail.comwrote:
On 21 February 2010 22:22, David Roe r...@math.harvard.edu wrote:
I think that the reason for having mod behave the way it does
Maybe try
cimport sage.numerical.mip_coin
from sage.numerical.mip_coin cimport osi_solve
David
On Thu, Feb 18, 2010 at 8:22 AM, Nathann Cohen nathann.co...@gmail.comwrote:
Hello everybody
I have been spending hours on the same Cython problem, which I hope
you can solve instantly :-)
Option 2: the goal is to eventually eliminate ParentWithGens and
ParentWithBase, and rewrite all classes in Sage that use their functionality
to instead use the functions defined by sage.structure.parent.Parent and
sage.structure.category_object.CategoryObject.
This transition will take quite a
K.a = GF(9)
K.TAB
is also broken.
But it's not just parents:
ZZ.TAB works
and it's not just the .a syntax:
R.p = Qp(5)
R.TAB works
David
On Tue, Feb 9, 2010 at 3:15 PM, Tom Boothby tomas.boot...@gmail.com wrote:
It seems to work for some objects but not others...
sage: P.x,y = QQ[]
sage:
AttributeError:
'sage.rings.polynomial.multi_polynomial_libsingular.MPolynomialRing_libsingular'
object has no attribute '__dict__'
Looks like William's hypothesis is right.
David
On Tue, Feb 9, 2010 at 3:36 PM, Nick Alexander ncalexan...@gmail.comwrote:
On 9-Feb-10, at 12:11 PM, Martin
Note that the OpenSSL license is in the section of that page outlining
licenses incompatible with the GPL. Here's the summary of OpenSSL on that
page:
The license of OpenSSL is a conjunction of two licenses, one of them being
the license of SSLeay. You must follow both. The combination results
I agree that it's awesome. I'm not sure if I'm using it right though. If I
remove a vertex from Williams example below, and then click Save, it changes
the cell, but the graph that it then creates is the same as before I removed
the vertex. The same problem seems to occur for most changes I
in the editor is saved under the name in variable name box.
When you say Save changes the cell, is the adjacency list in the cell
the new one or the original one?
Rado
On Jan 21, 2:40 pm, David Roe r...@math.harvard.edu wrote:
I agree that it's awesome. I'm not sure if I'm using it right though
to have it applied very early in the 4.3.2
release cycle.
Robert M/B, David Roe, Craig, or someone else: any chances for you to
review it shortly?
Thanks much in advance!
Cheers,
Nicolas
--
Nicolas M. Thiéry Isil nthi...@users.sf.net
http://Nicolas.Thiery.name
+1.
I'm trying to coercions between finite fields to behave automatically, which
leads to needing nth roots in finite fields for large n (exactly the
situation Yann is talking about). Not having to worry about factoring p^k-1
would be really nice: I'm already having to worry about various speed
I think that requiring them for every single function is excessive,
for example many functions don't take any parameters but self, or
don't return output.
OK, good point. How about requiring INPUT if there are any inputs
beyond self, and requiring OUTPUT if there are any outputs?
This
Currently we don't require documentation for __cinit__, __dealloc__ and
__new__. Are there any other functions we want to add to that list? I
could see an argument for _add_ and other arithmetic functions too.
David
On Sat, Dec 19, 2009 at 1:41 PM, David Roe r...@math.harvard.edu wrote:
I
Sounds good. That's the current requirement.
David
On Sat, Dec 19, 2009 at 3:30 PM, Simon King simon.k...@nuigalway.ie wrote:
Hi!
On 19 Dez., 21:23, Robert Bradshaw rober...@math.washington.edu
wrote:
A TESTS block is certainly a good thing to have for the arithmetic
operators.
+1
I can easily see why it would be faster to do real arithmetic. I'll include
a corresponding function for the reals.
David
On Fri, Dec 18, 2009 at 12:58 AM, William Stein wst...@gmail.com wrote:
On Thu, Dec 17, 2009 at 9:35 PM, David Roe r...@math.harvard.edu wrote:
Hey John,
I worked
I'd be happy to help you optimize it, but likely won't get around to it
until this evening. If someone else wants to do so before then, go for it.
David
On Thu, Dec 17, 2009 at 6:54 AM, John Cremona john.crem...@gmail.comwrote:
I would welcome some comments or help on the patch at #7719. I
Any time writing in pure python causes a segfault is a serious bug.
Glancing briefly at the code, I have a few ideas for what might have caused
it: I'll take a more detailed look in an hour or two.
Regardless of what's causing the crash, I'd suggest you use the methods
described at
I've updated the sage-coverage script, and one of the new features is the
ability to determine input and output coverage. Here are some statistics:
Current doctest coverage*: 80.0%
Functions with valid INPUT specification**: 49.4%
Functions with parameters completely described***: 46.8%
Hey Nathan,
I was wondering what the status of the Siegel modular forms code was. I
found some of the code that you and Skoruppa wrote a year and a half ago in
his directory on sage.math (
http://sage.math.washington.edu/home/nils/Siegel-Modular-Forms/code/siegel_modular_forms.sage).
Have you
I agree that the results are inconsistent, but it is true that 0*d = 1 (mod
1). And as a number theorist, I like the current behavior better than your
proposed solution, which would translate x into the interval [0,d).
I would suggest changing 4705 of integer.pyx to:
if mpz_cmp_ui(m.value,
[X] Yes, give me $'s!
[ ] No, this doesn't bug me; let's keep ReST/Sphinx in Sage pure.
David
--~--~-~--~~~---~--~~
To post to this group, send an email to sage-devel@googlegroups.com
To unsubscribe from this group, send an email to
I'm not sure what the right plan for variables is, but if you're rewriting
polynomial printing, take a look at sage/rings/padics/padic_printing.pyx. I
think that having a printer object attached to a parent, allowing for a
different inheritance tree for the printing objects and more flexibility
Currently there are no classes in sage inheriting form PowerSeries other
than PowerSeries_poly. But one could write a lazy power series class that
used the same basic interface as PowerSeries, using lists or python
functions, and define class PowerSeries_lazy(PowerSeries). I think that's
the
Yep. I don't have time tomorrow, but I can be on IRC Sunday afternoon.
David
On Fri, Jul 10, 2009 at 4:34 PM, Nicolas M. Thiery nicolas.thi...@u-psud.fr
wrote:
and source introspection for dynamic classes. Someone should
review these (along with the rest of my changes)
I will
-categories-nt.patch.
Afterwards David Roe took the lead; so I need to know what he has
done.
I am waiting for his feedback; but he is only working on
categories-framework-nt.patch, so this is independent. In fact, the
only interaction with the other reviewers about
categories-categories-nt.patch
One interesting design decision with rational polynomials is whether to use
a common denominator or individual denominators for each coefficient. The
second choice is generally slower, but the first can cause explosion in
coefficient size in some examples (eg x + x^2/2 + x^3/3 + x^4/4 + ... +
I have an old patch sitting around on trac that did this: #1795. If you
want to pick up from there, it fixes a lot of these problems.
David
On Tue, Jun 23, 2009 at 3:50 AM, Simon King simon.k...@uni-jena.de wrote:
Hi David,
On Jun 23, 12:49 am, David Roe r...@math.harvard.edu wrote
+1 from me as well.
David
On Tue, Jun 23, 2009 at 4:29 AM, Franco Saliola sali...@gmail.com wrote:
On Tue, Jun 23, 2009 at 8:05 AM, Robert
Bradshawrober...@math.washington.edu wrote:
On Jun 22, 2009, at 11:44 AM, Nicolas M. Thiery wrote:
On Thu, Jun 18, 2009 at 09:29:46AM -0700,
One way would be to have a vertical ray that doesn't change the scaling of
the rest of the graph (just goes to the top of the viewing window). Not
precisely accurate, but better than nothing.
David
On Tue, Jun 23, 2009 at 6:57 PM, Tim Lahey tim.la...@gmail.com wrote:
On Jun 23, 2009, at 5:46
On Tue, Jun 23, 2009 at 7:08 PM, Nicolas M. Thiery nicolas.thi...@u-psud.fr
wrote:
On Tue, Jun 23, 2009 at 10:29:34AM +0200, Franco Saliola wrote:
I'm also in favor of _test_X to avoid cluttering up the tab
completion. Another option to increase visibility would be to have a
test
So, I can certainly do that by Wednesday. I think much of the difficulty
will be getting the code up to 100% doctest coverage. It's not really
feasible for Nicolas to write all those doctests. I'm happy to contribute
doctests for my section; do we need to get a secondary reviewer in that
case?
The problem is probably the space between ngens and the parenthesis.
David
On Mon, Jun 22, 2009 at 1:30 PM, Simon King simon.k...@uni-jena.de wrote:
Hi William,
On Jun 22, 6:33 pm, William Stein wst...@gmail.com wrote:
It's not a proper parser. It's just a quick hack that goes through
Indeed. You've done an amazing job, and we're all really grateful for the
work and expertise you've shared with Sage.
Have a nice vacation. :-)
David
On Mon, May 25, 2009 at 11:34 AM, gsw georgswe...@googlemail.com wrote:
On 25 Mai, 16:45, mabshoff mabsh...@googlemail.com wrote:
Hello
Bill Page wrote:
How does it related to the concept of parent - which seems equally
ill-defined to me?
On Jun 3, 2008, at 10:04 PM, Robert Bradshaw wrote:
A Parent is an Object in the category of Sets,
David Harvey wrote:
huh? Don't you mean to say something more like a parent is
:37 PM, William Stein wst...@gmail.com wrote:
On Sun, May 24, 2009 at 4:30 PM, David Roe r...@math.harvard.edu wrote:
Bill Page wrote:
How does it related to the concept of parent - which seems equally
ill-defined to me?
On Jun 3, 2008, at 10:04 PM, Robert Bradshaw wrote
+1 from me as well.
On Thu, May 21, 2009 at 12:07 PM, William Stein wst...@gmail.com wrote:
On Thu, May 21, 2009 at 12:03 PM, Robert Miller rlmills...@gmail.com
wrote:
John,
On May 21, 9:38 am, John Cremona john.crem...@gmail.com wrote:
2009/5/21 Robert Miller rlmills...@gmail.com:
I think that adding a section to
http://www.sagenb.org/doc/live/developer/conventions.html#documentation-stringsfor
TEST and SEE ALSO would be good. Encouraging people to reference
other
functions that they user might be looking for, and providing an example of
how to hyperlink between
Fixes the issues I was having. Thanks!
David
On Sun, May 17, 2009 at 11:40 AM, Nick Alexander ncalexan...@gmail.comwrote:
If you remember, please let me know that everything's good. I have
some fixes to pyrex mode to make for David Roe and I'd like to release
a 0.6.1 sometime soon.
Hi
I've taken a look at most of these. I'll send Nicolas comments off list
(though I probably won't get to that until later tonight). But I agree with
Robert that a global picture wiki page would be good.
David
On Thu, May 14, 2009 at 4:25 PM, Robert Bradshaw
rober...@math.washington.edu wrote:
Hey all,
There's a set of patches needing review. It brings doctest coverage of the
p-adics folder from 28.3% to 100%, restructures the files so that the
directory is less cluttered, deletes a number of files (some due to the
restructuring, some getting rid of lazy p-adics which are currently not
I also think that an interactive graph editor would be a very cool feature.
Perhaps a good project to work on at Sage Days 15?
David
On Thu, Apr 30, 2009 at 5:14 PM, Rob Beezer goo...@beezer.cotse.net wrote:
On Apr 30, 12:05 am, Rado rki...@gmail.com wrote:
I decided to see how hard it
+1 from me as a good goal for 4.0. But I don't have a whole lot of
experience with dealing with spkgs, and I'll be working on improving
p-adics, so I probably won't be helping much.
David
2009/4/23 Tim Abbott tabb...@mit.edu
I'd like to add as a goal that Sage 4.0 works with versions of its
I can work on that tomorrow, in addition to p-adics.
David
On Fri, Apr 10, 2009 at 1:38 AM, William Stein wst...@gmail.com wrote:
On Thu, Apr 9, 2009 at 7:41 PM, Alex Ghitza aghi...@gmail.com wrote:
We will have a docday this Saturday, with the insanely ambitious goal
of getting to
On Fri, Apr 10, 2009 at 11:40 AM, John Cremona john.crem...@gmail.comwrote:
2009/4/10 William Stein wst...@gmail.com:
On Fri, Apr 10, 2009 at 7:43 AM, John Cremona john.crem...@gmail.com
wrote:
2009/4/10 William Stein wst...@gmail.com:
On Fri, Apr 10, 2009 at 3:09 AM, John Cremona
On Thu, Apr 9, 2009 at 5:19 AM, Robert Bradshaw
rober...@math.washington.edu wrote:
On Apr 9, 2009, at 1:49 AM, John Cremona wrote:
Can we at the same time convert more files to ReST and hence get them
included in the Reference manual? Although that manual is long, there
is a whole lot
If you're editing files in the sage library, you need to type
sage -br
from the command line in order for your changes to be incorporated into the
copy of sage that you're running (the -b builds, the -r means to start
sage).
Having written a lazy p-adics class, my guess is that your pickling
:
On Mar 31, 12:34 pm, David Roe r...@math.harvard.edu wrote:
Having written a lazy p-adics class, my guess is that your pickling
errors
have to do with the fact that you're storing a function. If you replace
all
of the local functions that you're storing with callable classes (ie a
class
On Wed, Mar 11, 2009 at 9:53 PM, Bill Page bill.p...@newsynthesis.orgwrote:
On Wed, Mar 11, 2009 at 9:08 PM, Carl Witty wrote:
...
Does this mean you want GF(5)(3)*2 and RR(pi)*2 to fail? These
currently work due to coercions that would be unsafe according to my
definition.
The
I very much hope Algebraic Topology will be a theme at Sage Days 15:
http://wiki.sagemath.org/days15
I would like to work on Algebraic Topology at SD15. I'm talking to some
topologists here at Harvard next week to see what they would like to see in
Sage.
David
Since Robert is probably pretty busy, I'll answer this. I don't know how
much documentation exists for this yet.
You should override _element_constructor_ on parent and not any of the
others. For methods in the coercion system, you generally want to override
the method name with single
So the idea is that in Sage 4.0 we will drop all code that yields
DeprecationWarnings and has already been in Sage for at least 6
months? I.e., we only purge deprecated code older than 6 months
during major releases, but not during point releases?
I think a major release like 4.0 should
Missed copying the definition of q:
sage: q = QQbar(sum([sqrt(n) for n in range(10)]))
David
On Mon, Jan 26, 2009 at 10:52 PM, David Roe r...@math.harvard.edu wrote:
So, it's a little annoying in general, since something like sqrt(2) will
have multiple embeddings into the number field
It's possible that you're using html or some other markup in your e-mail
that some of us using text-based clients aren't getting. The main problem
with the way your message appears for me is that the exponents are not
paired with their bases. It's totally unreadable. Whereas many
mathematicians
Great! This has been on my list of things I'd like to have
implemented for a while.
Presumably, much of this code will be incorporated into the Sage
library. So it's not really a package per se. Instead, you should
make a ticket on trac (http://trac.sagemath.org/sage_trac), for which
you need
I'm running OS X 10.4 and the warning about DT_TEXTREL doesn't appear
in my install log.
Good luck!
David
On Sun, Jul 13, 2008 at 3:51 AM, François Bissey
[EMAIL PROTECTED] wrote:
Hi all,
Recently David Kirkby tried to compile sage on
solaris express and it blew up on pari. Turns out
the
BTW, I have also modified giac source, it should now compile with gcc
4.3.1.
Excellent!
As I said earlier, I'm ready to invest time for that, but I can't do
it alone, there must be someone on the python side who has time and
interest to do it with my help.
I've seen a lot of acrimonious
sage.math seems to be back up. At least, I'm logged in to it. ;-)
David
On Thu, Jun 19, 2008 at 12:47 PM, William Stein [EMAIL PROTECTED] wrote:
Hi,
sage.math is down and I don't have physical access to the machine right now.
Reminder: a backup from yesterday of everybody's file is
One way to get around this limitation in python is to use callable
classes instead of functions.
David
On Sat, Jun 14, 2008 at 10:42 AM, David Harvey
[EMAIL PROTECTED] wrote:
On Jun 14, 2008, at 1:25 PM, Daniel Bump wrote:
Some code that has been proposed by Nicolas Thiery
for
Yeah, I arrive in Seattle on June 9.
David
On Tue, May 27, 2008 at 1:20 AM, Nick Alexander [EMAIL PROTECTED] wrote:
On 26-May-08, at 9:40 PM, David Roe wrote:
I've gotten distracted by trying to do work that my advisor gave me.
I suspect it's mostly a matter of Robert and I having other
Algebraic topology.
David
On Tue, May 27, 2008 at 2:32 AM, mhampton [EMAIL PROTECTED] wrote:
Dynamical systems - I think this now might be Sage's weakest area of
mathematics. Getting AUTO/pydstool and other more specialized code in
Sage is necessary if its going to have any appeal to that
I agree with Nick here. If we want to change the default behavior of
some functions so that they work the same as over the fraction field,
that's fine. But don't add a call to fraction field to the
constructor. ZZ is the initial object in the category of rings.
That's a good reason for it to
So, I think I was the one to rework infinity most recently. I don't
really have time today to expand at length on the issues you brought
up, but I agree with them to some extent. I will note that a coercion
is a natural map into the object, which is why your first example
failed, but the
I'm not going to be able to work much more on coercion until next
week, and I don't get the impression that Robert has much time this
week either. It's probably best to put coercion off until after
3.0.2.
David
On Mon, May 5, 2008 at 11:44 AM, mabshoff [EMAIL PROTECTED] wrote:
Hello folks,
aren't good enough, the right thing to do is fix them.
Don't underestimate the boundless energy and capabilities of the students
working on this project. Either Robert Miller or David Roe could
likely do in a day or
two whatever needs to be done with the AbelianGroup class to make
One thing that Python has going for it here is that it's object
oriented. So f.differentiate() is disambiguated because f has a type.
The time when this doesn't help is object creation (thus the issue for
Lattices). It's worth having this discussion, and I agree that names
matter, but the
+1 from me as well. There have been a few times recently when I've
wished Sage included a component for solving linear programming or
integer programming optimization problems.
David
On Sun, Apr 20, 2008 at 11:20 AM, Harald Schilly
[EMAIL PROTECTED] wrote:
On Apr 20, 4:42 pm, William Stein
On Sun, Apr 20, 2008 at 5:13 PM, TimDaly [EMAIL PROTECTED] wrote:
I'm surprised by how convinced you are that using a specific
technology/language -- literate programming -- can be a silver
bullet to solve such a difficult problem. I think peer review,
and many many other things,
I would prefer sage -n, because -b suggests build to me, so sage -nb
would be rebuild and then start the notebook.
David
On Tue, Apr 15, 2008 at 1:29 PM, didier deshommes [EMAIL PROTECTED] wrote:
On Tue, Apr 15, 2008 at 1:11 PM, Kiran Kedlaya [EMAIL PROTECTED] wrote:
Currently the
:
ConwayPolynomial(3,100);
^
Runtime error in 'ConwayPolynomial': A conway polynomial for GF(3^100) is not
known
David Roe and I (and probably some other people) talked about this way
back at SD3, and ultimately decided that we had no idea what Magma was
doing
Grrr... I clicked reply, and then tried to click on the text field to
begin typing, and it scrolled down at exactly the wrong moment and the
right amount so that I clicked send insteady. Sorry about that.
David Roe and I (and probably some other people) talked about this way
back at SD3
On the other hand, using a leading zero to indicate octal is a fairly
standard convention in computer science. And it's nice to minimize
these kinds of differences between Python ints and Sage Integers.
David
On Sun, Apr 13, 2008 at 3:36 PM, Harald Schilly
[EMAIL PROTECTED] wrote:
On Apr 13,
I think Willem fixed this bug. I've made the same change a few other
places and added a doctest.
David
On Mon, Apr 7, 2008 at 11:16 AM, Kiran Kedlaya [EMAIL PROTECTED] wrote:
Jen Balakrishnan spent time with some of the usual suspects during the
Arizona Winter School tracking down bugs in
No, I forgot to change it back. Use the patch I posted instead, which
changes all the eis_shift_a's back to eis_shift. The p-adics folder
passes sage -t now.
David
On Thu, Apr 10, 2008 at 8:53 PM, mabshoff
[EMAIL PROTECTED] wrote:
On Apr 11, 12:35 am, David Roe [EMAIL PROTECTED] wrote
If you take a look at the source code for n(), you'll see that the
first thing that it does is to try calling numerical_approx(prec) on
the object, and then tries coercing to real or complex fields. So the
solution is to write a method numerical_approx(prec) in the matrix
base class that tries
701 - 800 of 866 matches
Mail list logo
