Would you mind telling me what huge means ? It does make a difference
when one writes the code.
Probably with hundreds of vertices.
That's huge ? Okay I see. I'm glad I asked. So it's not larger than 65536
:-P
This was only for you to see what the graphs look like :-)
Well, ...
sage: P =
Y !!
I certainly can recall dealing with lots and lots of small posets
(typical for algebraic combinatorics: your combinatorial objects are
small, but you are often considering all of them at once because you
are talking formal linear combinations of them and likewise). I also
Hmmm... Looks like there is already something like that in .hasse_diagram,
in the _leq_matrix() method :
def _leq_matrix(self):
...
# Redefine self.is_lequal
self.is_lequal = self._alternate_is_lequal
...
Though this Matrix is defined to be a sparse matrix defined on ZZ. Don't
know
Dear all,
Currently one can obtain surprising results in Sage when converting
polynomial over finite fields (or elements of quotient rings of univariate
polynomial ring even though tht's not the primary concern of the ticket).
See http://trac.sagemath.org/ticket/11239
Basically the generators
Jean-Pierre Flori wrote:
Currently one can obtain surprising results in Sage when converting
polynomial over finite fields (or elements of quotient rings of univariate
polynomial ring even though tht's not the primary concern of the ticket).
See http://trac.sagemath.org/ticket/11239
Hi Peter,
On 2013-12-31, Peter Bruin pjbr...@gmail.com wrote:
I posted a comment at #11239,
Then perhaps I should answer there, but anyway, here it goes.
Warning: I am partially playing advocatus diavoli here.
so let me just say here that I think this
principle (that conversions need not
Hi Simon,
Warning: I am partially playing advocatus diavoli here.
That can be very useful!
so let me just say here that I think this
principle (that conversions need not be canonical) shouldn't be pushed
further than reasonable.
Yes, but for a rather relaxed notion of reasonable.
Yes, agree that this is slightly different.
I also agree that it would be much better if the pexpect interfaces would
have been written against non-echoing tty. Of course that'll only work if
the subprocess doesn't turn echoing back on. The downside is of course that
you have to rewrite the
I sometimes illustrate techniques of polynomial factorization in a class by
starting with a polynomial in ZZ[x] and converting it to a polynomial in
GF(insert_large_prime)[x]. I realize this is not an instance of two
_finite_ fields, but (a) you mention the characteristics are different,
and
On Tuesday, December 31, 2013 8:23:35 PM UTC-8, Volker Braun wrote:
I also agree that it would be much better if the pexpect interfaces would
have been written against non-echoing tty. Of course that'll only work if
the subprocess doesn't turn echoing back on. The downside is of course that
10 matches
Mail list logo
