Nicolas M. Thiery nicolas.thi...@u-psud.fr writes:
Dear poset fans,
I posted below the current log of the patch. Altogether, I am
essentially done, except for looking at the antichains optimizations,
and a couple issues to be discussed now:
- Currently P.hasse_diagram() returns a
We have the following behaviour:
sage: var('a b')
sage: binomial(a,b)
binomial(a, b)
sage: q_binomial(a,b)
---
TypeError Traceback (most recent call
last)
Hi everyone,
I just opened a ticked on trac about the getitem method on an ambient
space basis of a root system
http://trac.sagemath.org/sage_trac/ticket/10995
Nicolas, I believe Florent told you about that on Friday when we
looked at it. Is there someone who can fix it or should I do it myself
Hi Viviane,
On Wed, Mar 23, 2011 at 11:38:27AM +0100, Viviane Pons wrote:
I just opened a ticked on trac about the getitem method on an ambient
space basis of a root system
http://trac.sagemath.org/sage_trac/ticket/10995
Nicolas, I believe Florent told you about that on Friday
Nicolas M. Thiery nicolas.thi...@u-psud.fr writes:
The rationale for using 0,...,n-1 is that this makes the code
simpler and quite faster, in particular when the elements of the
poset are large objects with expensive hash function. That's a
standard approach in the Sage library
Nicolas M. Thiery nicolas.thi...@u-psud.fr writes:
Dear poset fans,
In the process of refactoring / categorifying the poset code, I am
creating a category for posets which are lattices. What should be the
name for this category? Lattices() would be natural, but might get
into conflict
Hi!
Let me ask my question that I recently asked about algebras for monoids:
Is there currently a way to construct a monoid from generators and relations?
Or a quotient of the free monoid by specifying relations?
Cheers,
Anne
--
You received this message because you are subscribed to the
On Wed, Mar 23, 2011 at 09:40:16AM -0700, Anne Schilling wrote:
Ah, yes, it would be more user friendly to use the actual vertices of the
poset rather
than numbers from 0,1,...,n-1. Does it matter that in one case the class is a
DiGraph and in the other a separate class?
Not that much,
Hi Burcin,
Thanks for your pointer to your patch.
This is also accessible through the patch at #4539:
http://trac.sagemath.org/sage_trac/ticket/4539
Here is how you can do the example above with that patch:
sage: A.x,y = FreeAlgebra(QQ, 2)
sage: H = A.g_algebra({y*x: x*y + y^2})
sage:
On Wed, 23 Mar 2011 09:17:35 -0700
Anne Schilling a...@math.ucdavis.edu wrote:
This is also accessible through the patch at #4539:
http://trac.sagemath.org/sage_trac/ticket/4539
Here is how you can do the example above with that patch:
sage: A.x,y = FreeAlgebra(QQ, 2)
sage: H =
Simon is not subscribed to sage-combinat-devel. Here is his reply:
Begin forwarded message:
Date: Wed, 23 Mar 2011 19:16:18 +0100
From: Simon King simon.k...@uni-jena.de
To: sage-combinat-devel@googlegroups.com
Cc: Burcin Erocal bur...@erocal.org
Subject: Re: [sage-combinat-devel] (free)
Nicolas wrote:
Note: for whatever it's worth, one can disable product_on_basis, and
have the code still run. I did not check if that made any speed
difference.
Taking out product_on_basis turns out to be a speedup, so I will have
to post another version of the patch.
Dan
--
You received
Hmm. It's a bug which apparently was introduced by #9032 in
4.6.2. This patch adds an alias N - numerical_approx for each and
every Sage object:
sage: 13.N()
13.0
sage: x = gap3(13)
sage: x.N()
13.0
In the CoxeterGroup code, N
On Wed, Mar 23, 2011 at 02:48:33PM -0700, bump wrote:
Taking out product_on_basis turns out to be a speedup, so I will have
to post another version of the patch.
Cool :-) I'd be curious to understand exactly why.
By the way, looking at your revision patch made me wonder whether
coerce_to_sl
Ah, another point: running pyflakes on weyl_characters.py points out
the following:
weyl_characters.py:2104: undefined name 'is_even'
weyl_characters.py:2107: undefined name 'is_odd'
There must be some doctests missing since we did not catch this
earlier.
Cheers,
On Wed, Mar 23, 2011 at 12:54:13PM -0400, David Roe wrote:
I have another little conflict in that the name Posets is, since
recently, used for the library of posets:
sage: Posets.ChainPoset(3)
Finite lattice containing 3 elements
very much like graphs and
16 matches
Mail list logo
