Johan wrote:
> As William stated, I think any functionality improving SageMath's appeal
> for, say, educating high school students would be very welcome. My main
> concern is how valuable what you propose with PRESS-like printing is in
> this respect.
>
> You gave a printout of your current PRESS
On Thursday, October 13, 2016 at 12:16:36 PM UTC-7, John Cremona wrote:
>
> Kwankyu's point is also a good one. It really is not acceptable (from
> a user's point of view) to ask if there any coercions, be told there
> are none, and then be prevented from defining one!
>
It's a necessity for s
On Thu, Oct 13, 2016 at 5:09 PM, Kwankyu Lee wrote:
> Hi David,
>
> First, thank you for technical explanations. They are compelling.
>
> On Thursday, October 13, 2016 at 9:59:50 PM UTC+2, David Roe wrote:
>>
>>
>> In order to create finite fields with arbitrary variable names that fit
>> into a
Hi David,
First, thank you for technical explanations. They are compelling.
On Thursday, October 13, 2016 at 9:59:50 PM UTC+2, David Roe wrote:
>
>
> In order to create finite fields with arbitrary variable names that fit
> into a lattice of fields, one possibility would be able to give an
> al
On Thu, Oct 13, 2016 at 3:16 PM, John Cremona
wrote:
> Thanks Peter for the explanation. Nevertheless, I'm not sure that the
> normal user could have guess that one only gets the clever stuff
> (compatible embeddings into the algebraci closure. The docstring GF?
> does imply this but again does
Thanks Peter for the explanation. Nevertheless, I'm not sure that the
normal user could have guess that one only gets the clever stuff
(compatible embeddings into the algebraci closure. The docstring GF?
does imply this but again does not make a big thing of it.
I think a better design (just of
Hi,
On Thursday, October 13, 2016 at 7:14:27 PM UTC+2, Peter Bruin wrote:
>
> Even though there is no coercion map in this situation, simply trying to
> discover a coercion "taints" the target parent by registering the fact
> that there is no coercion.
Then should we consider this behavior as
Hello John,
> I think this is a bug. In one Sage session:
>
> sage: F4 = GF(4)
> sage: F16 = GF(16)
> sage: F4.gen() in F16
> True
> sage: F16.has_coerce_map_from(F4)
> True
>
> -- all is well. But in a new session:
>
> sage: F4 = GF(4, names='a')
> sage: F16 = GF(16, names='b')
> sage: F4.gen()
I think this is a bug. In one Sage session:
sage: F4 = GF(4)
sage: F16 = GF(16)
sage: F4.gen() in F16
True
sage: F16.has_coerce_map_from(F4)
True
-- all is well. But in a new session:
sage: F4 = GF(4, names='a')
sage: F16 = GF(16, names='b')
sage: F4.gen() in F16
False
sage: F16.has_coerce_map
On 2016-10-13 11:31, Sébastien Labbé wrote:
Is there a page in the Sage wiki or Sage documentation about "How to
install Sage from source faster" that gathers all those tricks?
This page is the best I can think of:
http://doc.sagemath.org/html/en/installation/source.html
For example, how do I
On 2016-10-13 10:56, Jori Mäntysalo wrote:
I opened https://trac.sagemath.org/ticket/2169 to make some example.
I guess you mean that for example
ValueError("%s and %s must be positive integers." % (m, n))
should be as it is, but
ValueError("the poset is not ranked")
changed to ArithmeticErr
Is there a page in the Sage wiki or Sage documentation about "How to
install Sage from source faster" that gathers all those tricks?
The only thing I currently use is parallel stuff : export MAKE = "make -j4"
For example, how do I know that the architecture of my dual core os x
laptop is CoreDu
Not spending the time compiling gcc to get gfortran?
François
> On 13/10/2016, at 22:01, Sébastien Labbé wrote:
>
>
>
> On Wednesday, October 12, 2016 at 9:07:24 PM UTC+2, Eric Gourgoulhon wrote:
> > with Ubuntu 16.04, if you install the Ubuntu package gfortran-5, your Sage
> > build will us
On Wednesday, October 12, 2016 at 9:07:24 PM UTC+2, Eric Gourgoulhon wrote:
> with Ubuntu 16.04, if you install the Ubuntu package gfortran-5, your
Sage build will use the system gfortran, which works fine (no missing
libgfortran.so.3).
Is there any other reason/advantage for Sage to use the
I opened https://trac.sagemath.org/ticket/2169 to make some example.
I guess you mean that for example
ValueError("%s and %s must be positive integers." % (m, n))
should be as it is, but
ValueError("the poset is not ranked")
changed to ArithmeticError.
--
Jori Mäntysalo
On 2016-10-13 08:11, Jeroen Demeyer wrote:
> On 2016-10-12 13:39, Jori Mäntysalo wrote:
>> elements = D.topological_sort()
>
> More bikeshedding: in this case, I would even consider ArithmeticError.
> It's not strictly arithmetic, but it does indicate a mathematical issue.
> I tend to use
On 2016-10-12 16:01, Daniel Krenn wrote:
> On 2016-10-12 13:39, Jori Mäntysalo wrote:
> There could be a ContainsCycleError which has RuntimeError as a base...
As mentioned in another part of this thread: ...ArithmethicError as a
base...
--
You received this message because you are subscribed t
Hi Ted,
As William stated, I think any functionality improving SageMath's appeal
for, say, educating high school students would be very welcome. My main
concern is how valuable what you propose with PRESS-like printing is in
this respect.
You gave a printout of your current PRESS implementation e
On Thu, 13 Oct 2016, Jeroen Demeyer wrote:
So we have now a common view that 'type' in TypeError should (mostly?)
refer to types in wrong class, wrong category etc
For Sage, I would certainly add "wrong parent" to this.
True. And there might be some, eh, exceptions to this rule. But mostly
19 matches
Mail list logo
