On Sun, 5 Jan 2020, Frédéric Chapoton wrote:
> Do you agree that sage release 9.1 (and most of the 9.1.betas) will not be
> kept compatible with Python 2 ?
I agree.
--
Jori Mäntysalo
Tampereen yliopisto - Ihminen ratkaisee
--
You received this message because you are subscribed to the Google
On Sat, 23 Nov 2019, Frédéric Chapoton wrote:
> The current stumbling point is that sagenb uses twisted and twisted is not
> py3 compatible, despite pretending to be so.
OK. I opened #28792 for better error message. Also I suppose we must
change documentation.
--
Jori Mäntysalo
Tampereen ylio
I did a fresh install, i.e. start from git clone
git://github.com/sagemath/sage.git and so on. Sage starts and I can start
jupyter also. However ./sage --notebook=sagenb says
DeprecationWarning: the imp module is deprecated in favour of importlib;
see the module's documentation for alternative
I opened https://trac.sagemath.org/ticket/28569 thinking it is something
easy. Is not for me. Someone understanding Sphinx should take a look.
--
Jori Mäntysalo
Tampereen yliopisto - Ihminen ratkaisee
--
You received this message because you are subscribed to the Google Groups
"sage-devel" g
Might be of interest to someone painting a bikeshed. I played a little
with Levenshtein module.
$ egrep --no-filename -R -o -w '[a-z]{4,15}' src/sage > /tmp/all
$ cat /tmp/all | sort | uniq -c | fgrep -w 1 | colrm 1 8 > /tmp/singles
$ cat /tmp/all | sort | uniq -c | fgrep -v -w 1 | colrm 1 8 > /t
Btw, what is most simple way in SageMath to run parallel independent jobs
without dependencies?
For example, let G() be a generator outputting 1000 objects and let there
be four cpu cores available. Now it would be nice if we could just fork
four processes, each basically saying for example "Ge
On Sun, 24 Mar 2019, Nico Van Cleemput wrote:
> If you use the normal splitting with geng, it might become more even if you
> go to a higher number of
> parts. However, it will never be completely even.
We could also use geng to split output to for example 100 parts and then
combine parts so th
On Fri, 22 Mar 2019, Ai Bo wrote:
> With 12, I can't write to a file, it is at least 1500G. I can write to a
> file up to around 300G at most.
> That is why I am thinking how to divide the output of "geng 12". So
> far, I don't have any idea. Any suggestion?
You can (and should) use A/B -not
On Thu, 21 Mar 2019, Simon King wrote:
> Does either of you plan to open a ticket and make the functionality
> available, that according to Jori is present in nauty but according
> to Ai isn't wrapped in Sage?
At least I do not.
--
Jori Mäntysalo
Tampereen yliopisto - Ihminen ratkaisee
--
Yo
OK, more explanation.
* * *
First I compare time for generating graphs in Nauty and in Sage. As plain
graphs(n) uses nauty, I have test.sage containing
print(sum(1 for _ in graphs(9)))
It takes about 11½ seconds to run. I tested this with
time ./sage test.sage
Then,
./local/bin/geng 9 > /
On Thu, 21 Mar 2019, Ai Bo wrote:
> Is there a way to "random access"? For example, access the nth element
> in the "generator", instead of one by one?
Kind of. As a most time is propably spent by creating Python data
structures for SageMath, you can use nautygen directly to generate huge
numb
On Sun, 3 Mar 2019, Frédéric Chapoton wrote:
> In sage 8.7.b6 built with python3, there are now 464 failing doctests, in a
> total of 137 files.
You forgot to say that this is great progress -- and we should thank you
for a big part of this!
It also seems that in py3 the testing framework does
Is this a known feature?
...~/sage$ ./sage -c 'set_random_seed(0); print(randint(1, 10^6))'
111440
...~/sage3$ ./sage -c 'set_random_seed(0); print(randint(1, 10^6))'
116853
--
Jori Mäntysalo
Tampereen yliopisto - Ihminen ratkaisee
--
You received this message because you are subscribed to t
On Tue, 19 Feb 2019, TB wrote:
> There is the cardinality method of IntegerVectors. Note that the default for
> min_part is 0.
So this could be used for...?
I do not know the area. I was just playing with numbers (original question
was "In how many ways you can arrange a queue of 9 men and 7 w
Is there a fast way to compute for example
Compositions(15, min_length=10, max_length=10).cardinality()
in some package already integrated to SageMath? For Partitions(...) that
seems to be the case, but Compositions(...) uses just brute enumeration.
--
Jori Mäntysalo
Tampereen yliopisto - Ihm
(I know, I know... SageNB is deprecated.)
In the newest firefox in Linux pressing backspace in an empty cell does
not delete the input cell. It works in Chromium. Why that, any workaround
on the server side?
--
Jori Mäntysalo
Tampereen yliopisto - Ihminen ratkaisee
--
You received this mess
On Wed, 2 Jan 2019, Vincent Delecroix wrote:
> I thought that the definition of the canonical labels was the
> order on vertices that minimize the adjacency matrix in
> lexicographic order...
?? Any function that translates isomorphism to equality is a canonical
labeling.
--
Jori Mäntysalo
Ta
17 matches
Mail list logo
