I can confirm: it is due to an extra space in the output of `polymake-config
--cflags`.
Now that you pointed this out I noticed that there is already a PR open on
this https://github.com/sebasguts/JuPyMake/pull/5 with the same error message
I got. My google-foo is failing me.
Thanks again fo
Hm, my next guess is then
https://github.com/sebasguts/JuPyMake/issues/4
since I think that's also on Gentoo. I can be more certain in a few
hours after polymake builds.
It does look so:
$ polymake-config --cflags | grep " " | wc -l
1
Let me try to fix this on the fly
S.
--
You received
Oops, thanks for catching the mistake
S.
* dmo...@deductivepress.ca [2021-01-17 12:01:41]:
I agree that this needs to be fixed. Offhand, I don't know what the answer
should be (for example, (1/(x*y), 0) also seems reasonable), but (0,1) is
certainly not correct. So please do open a ticket.
Pl
Dear all,
can someone please confirm that the current behaviour of sage is not the
expected one before I open a ticket about it?
sage: R. = LaurentPolynomialRing(QQ)
sage: q,r = (1/x).quo_rem(y) ; q,r
(0, 1)
sage: q*y + r == x
False
The correct
Unpacking of lambda functions' arguments is, alas, no longer supported in
python3.
cf. https://www.python.org/dev/peps/pep-3113/
S.
* Anne Schilling [2020-05-26 11:24:01]:
Ok, success!!! Finally sage compiled for me using Matthias' suggestion of
"./configure --without-system-freetype"
be
+1 for standard behaviour
* John H Palmieri [2020-04-18 13:51:29]:
Several of us are in favor of requiring that, in order to build Sage,
people should have to run "./configure" before running "make". I would
further propose that "make" should not itself then run "configure".
Some advantages:
Hi Travis (and all),
I already have a toy implementation and it is indeed worth including in sage.
Given a chain complex it produces a new chain complex that has the same
homology but whose differentials are much much smaller.
You can look at it here: https://github.com/Etn40ff/chromatic_symmetr
I may be interested in helping out with this but I am definitely not
knowledgeable enough on the math behind to tackle the task on my own.
S.
* John H Palmieri [2019-11-13 18:36:25]:
Sage is not using very sophisticated methods for computing homology. If
anyone wants to implement something b
Dear All,
I was looking into computing homology of a certain chain complex when I came
across this paper arXiv:1903.00783v1. Apparently he claims that he has an
algorithm to do so that is much faster than the one we currently have in
sage. Did I understand correctly the claim? If so, would it b
ced? If so, should we just ignore
the issue?
S.
* Dima Pasechnik [2019-11-05 10:29:52]:
On Tue, Nov 5, 2019 at 10:19 AM VulK wrote:
I am not sure I agree with setting this at build time: a jvm could be
installed afterwards and/or updated independently of sage
if the configuration of the
I am not sure I agree with setting this at build time: a jvm could be
installed afterwards and/or updated independently of sage
S.
* Michael Orlitzky
[2019-11-04 08:49:18]:
On 11/3/19 4:55 PM, VulK wrote:
On the same note: the current implementation of `is_jvm_available` is not
really
-11-03 19:16:35]:
On Sun, 3 Nov 2019, 16:57 VulK, wrote:
I have issues with a symlink when installing ipython:
"""
...
Successfully installed ipython-5.8.0
Cleaning up...
Removed build tracker '/tmp/pip-req-tracker-x6b62y1w'
real0m3.382s
user0m
me note: the current implementation of `is_jvm_available` is not
really robust and I should open a ticket about this; any suggestion for a
better implementation?
S.
* Dima Pasechnik [2019-11-03 19:16:35]:
On Sun, 3 Nov 2019, 16:57 VulK, wrote:
I have issues with a symlink whe
\2', version))
[dochtml] [discrete_] ValueError: invalid literal for int() with base 10:
'Picked up _JAVA_OPTIONS: -Dawt.useSystemAAFontSettings=on
-Dswing.aatext=true\n8'
S.
* Dima Pasechnik [2019-11-03 19:16:35]:
On Sun, 3 Nov 2019, 16:57 VulK, wrote:
I have issues with a
I have issues with a symlink when installing ipython:
"""
...
Successfully installed ipython-5.8.0
Cleaning up...
Removed build tracker '/tmp/pip-req-tracker-x6b62y1w'
real0m3.382s
user0m3.027s
sys 0m0.498s
Copying package files from temporary location
/opt/sage-python3/loca
Building now
S.
* Frédéric Chapoton [2019-11-03 05:18:13]:
Could please some of the many plus-one-ing people try the branch at #28660
and report there if it works for them, namely builds a working python3-sage
by default ?
Frédéric
Le dimanche 27 octobre 2019 01:58:23 UTC+2, Volker Braun a
+1
* Samuel Lelievre [2019-10-26 22:29:40]:
+1
--
You received this message because you are subscribed to the Google Groups
"sage-devel" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to sage-devel+unsubscr...@googlegroups.com.
To view this discussion
Indeed it seems to be documented. Why is this not in the online
documentation?
S.
* Travis Scrimshaw [2019-09-26 17:59:38]:
There is also an example of this inheritance and discussion in one of the
sage.structure.unique_representation examples.
Best,
Travis
On Friday, September 27, 2019 a
The prototype does, now I have to implement the real thing.
Is there any way to add this info to the documentation? It took me a lot of
trial and error to figure out how to do what I wanted.
S.
* Travis Scrimshaw [2019-09-26 15:11:07]:
So it works now, correct?
Best,
Travis
On Friday, S
Oops, I think that I figured out where the mistake was. Here is the correct
code:
class OldFoo(UniqueRepresentation):
@staticmethod
def __classcall__(self, data, **kwargs):
hashable_data = tuple(data)
kwargs['some_default_option'] = 'bar'
return super(OldFoo, self).__
Thank you Travis for your reply. Here is an attempt at implementing your
suggestion that does not work: it looks like OldFoo.__classcall__ is skipped
and OldFoo.__init__ is run directly instead. This is not what I want: I would
like the preparsing in OldFoo to still be performed after the prepar
Dear All,
I would like to make a new class inheriting from a class based on
UniqueRepresentation. My goal, among other things, is to preparse the
arguments a little before calling the class I am inheriting from.
Unfortunately this class also does some preparsing via __classcall__ to make
th
Thanks I'll have a look into that.
S.
* John H Palmieri [2019-05-03 10:57:31]:
On Friday, May 3, 2019 at 10:22:25 AM UTC-7, Salvatore Stella wrote:
Hi All,
has anyone tried installing CHomP recently? For me it fails applying
patches.
It is an old-style package and apparently it is very st
Hi All,
has anyone tried installing CHomP recently? For me it fails applying patches.
It is an old-style package and apparently it is very stale; does it provide
any tangible speedup in `ChainComplex_class.homology` compared to the default
pari algorithm?
Thanks
S.
--
You received this messag
I was being stupid and pretended to clear the cache by hand *facepalm*.
I can confirm that doing things properly everything works as expected.
Sorry about the noise
S.
* Nils Bruin [2019-01-08 08:47:54]:
On Tuesday, January 8, 2019 at 6:21:39 AM UTC-8, Salvatore Stella wrote:
Dear all,
sorr
Dear all,
sorry for disappearing on this. I am a little confused: if both parent and
element refer to the same cache how is it possible that clearing one does not
clear the other?
S.
* E. Madison Bray [2019-01-08 14:49:36]:
On Tue, Jan 8, 2019 at 1:51 AM Nils Bruin wrote:
On Monday, Jan
Dear All,
I just came acreoss the following strange behavior:
{{{
sage: from sage.rings.polynomial.multi_polynomial_libsingular import
MPolynomialRing_libsingular
# This works as expected
sage: MPolynomialRing_libsingular(QQ, 2, ['x','y'], 'degrevlex')
Multivariate Polynomial Ring i
Same here
* 'Martin R' via sage-devel [2018-12-20 00:36:35]:
I have very little time, but if someone posts very precise compilation
instructions to upgrade from current develop, I would let my computer play
with it in the background.
(currently compiling 8.5.rc1)
In particular: was gap 4.10
Dear All,
I am working on some multivariate polynomial ring and I need to be able to
repeatedly evaluate some elements numerically. Since the elements I am
evaluating are few while the number of evaluations is high I thought to cache
the result of this evaluation. Every now and then I need to c
There is now a ticket (#26741) ready for review in which the changes have
been implemented. I decided not to refactor __call__ because the number of
failing doctest was quite big. Maybe this is a project for a separate ticket.
I have no idea on how to test reliably if the changes introduced any
You make a very good point, I'll try to be careful. I doubt this is a case of
efficiency since now __call__ goes through redundant cases and even has an
argument that is not used anywhere. Anyway I will cobble together something
and we can do speed testing before merging.
* Nils Bruin [2018
After a more accurate inspection, it appears that MPolynomialRing_polydict is
in quite a bad shape. First of all it redefines __call__ which, if I read [1]
correctly, should not be done. Second, within the many cases in __call__ one
can find:
{{{
510 elif isinstance(x, dict):
511
Done: https://trac.sagemath.org/ticket/26741
It appears that the change messes up with coercions. More details in the
ticket description.
S.
* Simon King [2018-11-22 14:10:14]:
On 2018-11-22, Simon King wrote:
However, I believe it is bad usage to hard-code a certain class as
output of a
funtionality to the elements.
Thanks
S.
* Simon King [2018-11-21 12:03:24]:
Dear S.,
On 2018-11-20, VulK wrote:
I am trying to implement the ring of coordinates of a Lie group in the
perspective of Peter-Weyl theorem.
Concretely I would like to define a polynomial ring with infinitely many
18-11-20, VulK wrote:
I am trying to implement the ring of coordinates of a Lie group in the
perspective of Peter-Weyl theorem.
Concretely I would like to define a polynomial ring with infinitely many
generators each depending on two points on a lattice. These generators
satisfy many relation
Dear all,
I am trying to implement the ring of coordinates of a Lie group in the
perspective of Peter-Weyl theorem.
Concretely I would like to define a polynomial ring with infinitely many
generators each depending on two points on a lattice. These generators
satisfy many relations but, for t
Indeed if one comments line 847 in src/setup.py the files looks to be there.
Sage crashes anyway but now:
VulK@bunion /mnt/backup/sage-py3 (git)-[my_py3] % ./sage -sh
Starting subshell with Sage environment variables set. Don't forget
to exit when you are done. Beware:
* Do not do any
It looks to me that the various .so files get compiled but then removed just
before the build finishes. Here is a snippet of the log:
byte-compiling
/mnt/backup/sage-py3/local/lib/python3.5/site-packages/sage/stats/r.py to
r.cpython-35.pyc
byte-compiling
/mnt/backup/sage-py3/local/lib/python3
Sorry for the mess, I just read the procedure on the developer's manual. I'll
be creating a new ticket for the stopgap in a second.
S.
* Travis Scrimshaw [2017-02-27 09:01:03]:
Hey Salvatore,
The typical approach is to put a stopgap, but it is best to do it in
such a way that is as minimal
Hi Travis,
thank you for the info.
Could you please check that the branch public/ticket/22381 currently attached
to the ticket is acceptable? Issues arise with any kind of input but only
when there are frozen variables so I added the stopgap any time they are
present.
Is there a fast lane to
Dear all,
some time ago I reported a bug in the implementation of `ClusterQuiver` which
yields wrong answers. The relevant ticket is #22381. To give you an idea
things like this happen:
{{{
sage: B = Matrix([[0,1,0],[-1,0,1],[0,-1,0],[2,0,0]])
sage: Q = ClusterQuiver(B)
I just did it, it seems to work.
Thanks
S.
* Daniel Krenn [2017-02-20 20:47:03]:
On 2017-02-20 19:24, VulK wrote:
Dear All,
I just found a bug I can't really reproduce in any simpler way than the
one I have here. I did not open a ticket yet on this because I would
like to have a simple
Dear All,
I just found a bug I can't really reproduce in any simpler way than the one I
have here. I did not open a ticket yet on this because I would like to have a
simpler way to explain the issue first. Any idea?
{{{
sage: LQ = LaurentPolynomialRing(QQ, 'x0, x1, x2, y0, y1, y2, y3,
on
edit at line 384. The methods being wrapped are at lines 1047 and 2150.
Thanks
S.
* Johan S. H. Rosenkilde [2016-11-07 09:45:57]:
VulK writes:
The first question is about which is the correct way to implement methods
that are not always defined.
I agree with Nils that subclassing is
Dear all,
I am writing to you to ask your opinion on the best way to address two issues
that were raised during the review of #21254. People are quite unhappy on how
these are addressed right now so I figured it would be better to ask for
opinions on how to best implement them.
The first que
best to make it stable, but...
A crash report was automatically generated with the following information:
- A verbatim copy of the crash traceback.
- A copy of your input history during this session.
- Data on your current Sage configuration.
It was left in the file named:
having too many/too few
methods etc but I do not care about those.
Something weird: line 326 and 327 are
from sage.categories.homset import Hom
from sage.categories.morphism import SetMorphism
pylint complains only about the second.
Best
S.
* Erik Bray [2016-09-22 17:24:05]:
On
* Thierry [2016-09-21 18:35:25]:
Hi,
bikeshedding for bikeshedding:
- if we decide to centralize everything in a single file (but we should be
aware that a backward move (e.g. for modularization) will require some
work), why not using bibtex (there must be some sphinx interface
somewhere),
, 2016 at 12:55:29PM +0200, VulK wrote:
Dear all,
I am trying to use pylint to validate some of the code in a patch I wrote
for sage and, unsurprisingly, I am getting several complaints because my
system-wide pylint can't resolve modules like sage.something.
What is the correct way of doing
Dear all,
I am trying to use pylint to validate some of the code in a patch I wrote for
sage and, unsurprisingly, I am getting several complaints because my
system-wide pylint can't resolve modules like sage.something.
What is the correct way of doing this? Is there any other alternative to
p
these might be useful:
https://github.com/rkern/line_profiler/issues/61
https://github.com/rkern/line_profiler/issues/62
https://github.com/rkern/line_profiler/pull/65
https://github.com/rkern/line_profiler/pull/68
Best
S.
* Travis Scrimshaw [2016-09-01 07:03:31]:
>I just installed the li
:53]:
> VulK wrote:
> >>and me too, this is really very annoying that %attach is broken..
> > +1
> >
> > A related question: why do we implement %attach in sage rather than making a
> > patch for upstream IPython?
>
> You mean submitting a patch upstream?
&g
>and me too, this is really very annoying that %attach is broken..
+1
A related question: why do we implement %attach in sage rather than making a
patch for upstream IPython?
S.
* Frédéric Chapoton [2016-08-26 06:01:23]:
>and me too, this is really very annoying that %attach is broke
Indeed RecursivelyEnumeratedSet seems to be a good fit for my needs.
The only problem I encountered so far is that it does not handle
KeybordInterrupts nicely either: if you interrupt the computation of
graded_component(n) then graded_component(m) with m [2016-08-23 00:51:34]:
> > Are you rea
Hi All,
thank you very much for all the inputs!
> Breath-first search = Search & pray? ;-)
>
> (Possibly infinite apnoea can't be healthy.)
/me fails
:)
> Well, one usually implements checkpoints for such things (continually
> saving state to optionally resume later if interrupted).
I am not s
Dear All,
in a ticket (#21254) I recently created with Dylan Rupel I need to explore a
(possibly) infinite n-regular tree in a breath-first search. The way it is
implemented right now is via iterators. I am writing to you to ask if there
is a preferred way to deal with user interaction and Keyboard
you got me: I was including $SAGE_ROOT/src/build/
now the numbers agree
S.
* leif [2016-08-14 16:55:23]:
> leif wrote:
> > VulK wrote:
> >> Really weird, his is what I have:
> >>
> >> $ cd $SAGE_ROOT/src
> >> $ grep __cmp__ **/*.py* | grep def |
-14 15:41:51]:
> leif wrote:
> > VulK wrote:
> >> Getting rid of __cmp__ would be the cleaner way but a simple grep on
> >> $SAGE_ROOT/src gives 915 occurrences of __cmp__, 624 of which are
> >> definitions.
>
> ? I'm getting 339 definitions in 249
Getting rid of __cmp__ would be the cleaner way but a simple grep on
$SAGE_ROOT/src gives 915 occurrences of __cmp__, 624 of which are
definitions. Is there any way we can automate the process?
S.
* Frédéric Chapoton [2016-08-14 05:41:01]:
>As an intermediate step in our long way to python3
* leif [2016-08-03 11:03:38]:
> VulK wrote:
> > On the topic of performances I just came across this post on phoronix:
> > http://www.phoronix.com/scan.php?page=article&item=windows-10-lxcore&num=1
> >
> > TL;DR: benchmarks give surprisingly good performances
On the topic of performances I just came across this post on phoronix:
http://www.phoronix.com/scan.php?page=article&item=windows-10-lxcore&num=1
TL;DR: benchmarks give surprisingly good performances provided you do not
access the filesystem. At the moment, while running sage could be ok, this
wou
.
* Erik Bray [2016-07-26 13:25:31]:
> On Tue, Jul 26, 2016 at 10:19 AM, VulK wrote:
> > Hi All,
> > Some time ago I briefly played with Bash on Ubuntu on Windows with some
> > limited success. The situation dramatically improved recently. I would risk
> > saying tha
Corporation. All rights reserved.
C:\Users\VulK>bash
root@DESKTOP-U13FH0M:/mnt/c/Users/VulK# uname -a
Linux DESKTOP-U13FH0M 3.4.0+ #1 PREEMPT Thu Aug 1 17:06:05 CST 2013
x86_64 x86_64 x86_64 GNU/Linux
root@DESKTOP-U13FH0M:~# apt-add-repository -y ppa:a
A.current_seed as a
property or
should I stick to methods?
Thanks
S.
* Johan S. R. Nielsen [2016-04-27 14:24:33]:
> VulK writes:
> > sage: B = matrix()
> > sage: B.T.roo
> >
> > and get
> >
> > sage: B.T.rook_vector
>
> I see, didn't know that.
>
This example is dumb because it does not give any real benefit but it will
do. On the command line you could run something like
sage: B = matrix()
sage: B.T.roo
and get
sage: B.T.rook_vector
but
sage: sage: B.transpose().roo
will complete to useless stuff.
Now as I said this does not make a
One advantage of properties over methods is that they autocomplete
S.
* Johan S. R. Nielsen [2016-04-27 13:22:57]:
> > Would it be feasible to let properties return some kind of "Undefined"
> > or "NotImplemented" or "None", rather than throwing an exception?
>
> That would side-step the entire
Dear All,
sorry for the late reply: my todo list came knocking at my door and required
immediate attention.
I did a small test and it appears that both Polynomial and LaurentPolynomial
behave in the same way with respect to coercion. On the other hand their
behavior under conversion is different.
Dear All,
for some project I have been working on for some time I found myself interested
in comparing elements of two different LaurentPolynomialRing. Unfortunately,
at the moment this is somewhat broken. The current behaviour is this:
sage: L1 = LaurentPolynomialRing(ZZ, 'x0,x1,x2,y0,y1,y2')
sa
Sorry, apparently I am late to the patch by few minutes thanks for the
pointers though, I'll keep surfing trac for related work in progress.
As for gcc on my machine being reinstalled by sage I guess I do have an old
version: 4.7
Thanks
S.
* Jeroen Demeyer [2016-03-04 11:44:09]:
> On 2016-0
Same here:
http://trac.sagemath.org/ticket/19667
S.
* Johan S. R. Nielsen [2016-01-15 16:40:37]:
> Same thing here, #19251.
>
> Johan
>
> david.lu...@inria.fr writes:
>
> > Hello,
> >
> > Same thing with some of tickets: #19653, #19666, #19722, #19422 and #19623
> >
> > David
> >
> > Le vend
Here is a quick patch for one of the listed issues:
http://trac.sagemath.org/ticket/19538
S.
* Travis Scrimshaw [2015-11-04 16:37:17]:
>Hey Salvatore,
>
> first of all thank you for your answer, it looks like you are one of
> the
> person I pester the most with these issues.
Hi Travis,
first of all thank you for your answer, it looks like you are one of the
person I pester the most with these issues.
TropicalSemiring is, unfortunately, not what I am looking for. The object I
need is a multiplicative abelian group on generators n generators y_i and an
addition \prod y
72 matches
Mail list logo
