Thanks Volker, David. Since SR can wrap everything, we might
encounter these decision problems when deciding on expressions.
The info you gave helps to make the result more reliable.
On Friday, July 17, 2015 at 8:40:01 PM UTC+2, David Roe wrote:
>
> It depends on exactly what you mean by undecidab
Interesting feedbacks for SAGE,maths,teaching,using VM... but I have a
question :
when you go teaching in far away places, why you don't go with a small
equipement for a local area network (switch, Ethernet wires) ?
because after installing the network, you can use your computer (for
example
Small update, we will be starting at around 8 AM PST tomorrow.
On Sat, Jul 11, 2015 at 18:40 R. Andrew Ohana
wrote:
> Due to lack of funding (as previously mentioned by William), the servers
> that are currently hosting a number of the sagemath sites will need to be
> relocated. We are currently
Hi Viviane,
thanks for your feedback. I experienced the same lack of internet
connection in Burkina Faso in a meeting in 2011 in Burkina Faso, perhaps
with older computers since the VM was definitely not an option (too slow,
but perhaps it is lighter now) so that i had to implement alternative
str
I just made some testing. For example this shows small memory leak:
i = 0
for P in Posets(7):
if i%1000 == 0:
print i, get_memory_usage()
i += 1
Or does it? At least when I run same code again, it will eat still more
memory. Then, after
P7=Posets(7).list()
for example
i = 0
I'm pretty sure you can't build Sage with clang. You'll need a fortran
compiler, too. The Sage installation guide has more.
On Friday, July 17, 2015 at 10:57:42 PM UTC+2, rshp...@ualberta.ca wrote:
>
> Debian Jessie minimal build and adding packages as needed. Possibly an
> unsatisfied depende
Debian Jessie minimal build and adding packages as needed. Possibly an
unsatisfied dependency?
Do you need anything else?
--
***
Error building Sage.
The following package(s) may have failed to build:
package: bzip2-1.0.6.20140317
log
What you can do is to find the common nullspace N of all the commutators
[M_i,M_j]:=M_i M_j - M_j M_i.
N can be found by solving a system of linear equations. Your v_1 must be in
N. Moreover, on N the M_k's can be simultaneously diagonalised.
Anyhow, this seems more efficient than a naive search
It depends on exactly what you mean by undecidable, but this is the
definition of an inexact ring in some sense. So, p-adics, power
series rings, reals
David
On Fri, Jul 17, 2015 at 1:34 AM, Volker Braun wrote:
> On Friday, July 17, 2015 at 10:25:29 AM UTC+2, Ralf Stephan wrote:
>>
>> 1. Can
A lot depends on n and the field your V is defined over. For finite fields
one might have special methods...
On Friday, 17 July 2015 17:45:17 UTC+1, Aladin VIRMAUX wrote:
>
> Hello,
>
> in my current work, I have a bunch of matrices that I need to
> simultaneously triangularise. More precisely,
Hi Viviane,
I will take this opportunity to promote aims-desktop, which will soon have
a website, and an ISO you can download there. In the tmeantime:
https://launchpad.net/~aims
We aim at exactly these kind of environments. Feel free to contact me
off-list.
Regards,
Jan
On 17 July 2015 at 20:
Dear all,
this last week, I was giving a class in a summer school in Uganda, along
with Jennifer Balakrishnan, on experimental mathematics (mine was
combinatorics and Jennifer's was number theory). Both classes were based on
Sage. Let me give you a feedback on using Sage here.
Conditions;
- arou
Hello,
in my current work, I have a bunch of matrices that I need to
simultaneously triangularise. More precisely, given a set of matrices [M_1,
..., M_n] of End(V), I would like to obtain _if possible_ a base v_1, ...,
v_k of V such that all M_1, ... M_n are triangular in this basis.
Has anyon
> I'm not sure I understand how it can be an extra burden, and I have no clue
> about the caetera...
Writing the interface code in an optional package means:
- The interface code is no longer part of 'standard sage'. It is
better then to host is somewhere, on some publicly available
repository (wi
On 2015-07-17 13:15, Julien Puydt wrote:
I'm not sure I understand how it can be an extra burden
The problem is not so much with additional packages, it's with
additional packages which only exist for Sage. If there is an active
upstream which would exist anyway without Sage, that's healthy.
Hi,
Le 17/07/2015 12:59, Dima Pasechnik a écrit :
On Friday, 17 July 2015 11:40:04 UTC+1, Snark wrote:
Hi,
Le 16/07/2015 13:16, Jeroen Demeyer a écrit :
> On 2015-07-16 13:03, Nathann Cohen wrote:
>> What is somebody has such an
>> install and *wants* to use it with Sag
On Friday, 17 July 2015 11:40:04 UTC+1, Snark wrote:
>
> Hi,
>
> Le 16/07/2015 13:16, Jeroen Demeyer a écrit :
> > On 2015-07-16 13:03, Nathann Cohen wrote:
> >> What is somebody has such an
> >> install and *wants* to use it with Sage?
> > This points to the core problem: we simply have no
Hi,
Le 16/07/2015 13:16, Jeroen Demeyer a écrit :
On 2015-07-16 13:03, Nathann Cohen wrote:
What is somebody has such an
install and *wants* to use it with Sage?
This points to the core problem: we simply have no way to guess whether
people want to do that or not.
Here is a possible compromis
On Fri, Jul 17, 2015 at 10:41:04AM +0200, Johan S. R. Nielsen wrote:
> The top post on ask.sagemath.org is spam again :-(
Indeed, i try to update the list of blocked patterns accordingly. As long
as the number of spams is not growing fast and allows us to find more and
more patterns, i think it is
The top post on ask.sagemath.org is spam again :-(
Johan
Thierry writes:
> in think we are in a semi-stable state now, all spam is removed, let's see
> if some spam comes again.
>
> Ciao,
> Thierry
>
>
>
> On Fri, Jul 17, 2015 at 10:04:07AM +0200, Thierry wrote:
>> Hi,
>>
>> actually, this star
On Friday, July 17, 2015 at 10:25:29 AM UTC+2, Ralf Stephan wrote:
>
> 1. Can you come up with a Sage parent (other than SR) where
> element.is_zero() is sometimes undecidable?
>
The obvious example would be group rings. The word problem is undecidable
so you may not be able to figure out whether
1. Can you come up with a Sage parent (other than SR) where
element.is_zero() is sometimes undecidable?
2. Same question where it is decidable but the current implementation
is incomplete?
Regards,
--
You received this message because you are subscribed to the Google Groups
"sage-devel" group.
in think we are in a semi-stable state now, all spam is removed, let's see
if some spam comes again.
Ciao,
Thierry
On Fri, Jul 17, 2015 at 10:04:07AM +0200, Thierry wrote:
> Hi,
>
> actually, this started yersterday morning already, and there are many
> pages full of this (about 10 remaining).
Hi,
actually, this started yersterday morning already, and there are many
pages full of this (about 10 remaining).
I think i succeeded to stop the flood now, but i had to block user
registration, so i would like to be able to go down one level of defense.
But before this i still have to remove a
24 matches
Mail list logo
