Christian,
I just pushed a version of my patch that takes into account
what you and Nicolas said.
Please proceed with the rebasing etc. Thanks for doing this!
--Mark
P.S. I can't promise that my code is entirely speedy, only that
it is not extravagantly wasteful.
> my patch on the Demazure pro
On Mon, Mar 26, 2012 at 03:19:32PM -0700, Anne Schilling wrote:
> Yes, I think Nicolas posted
> trac_12536-linear_extensions-review-nt.patch
> It also crashes for me when testing
> /combinat/posets/all.py
> Nicolas, could you please fix that?
Oops, sorry. Fixed and pushed!
By the way, I left two
Consider a free module morphism over a ring that
is not a field. How does sage-combinat take the inverse image?
It didn't like my custom base ring, which was not a field.
I think it tried to divide some coefficients
which didn't generally make sense.
The elements I am taking the inverse image of,
Hi Mark and Nicolas,
Yes, I think Nicolas posted
trac_12536-linear_extensions-review-nt.patch
It also crashes for me when testing
/combinat/posets/all.py
Nicolas, could you please fix that?
Best,
Anne
On 3/26/12 3:14 PM, msh...@math.vt.edu wrote:
> Did someone mess with posets or something?
Did someone mess with posets or something?
My doctest of sage/categories/coxeter_groups.py
died before doing any testing.
--
You received this message because you are subscribed to the Google Groups
"sage-combinat-devel" group.
To post to this group, send email to sage-combinat-devel@googlegr
Hi guys,
It's good to see ongoing discussions on Coxeter groups and
friends. Keep it up!
On Mon, Mar 26, 2012 at 04:50:56PM +0200, Christian Stump wrote:
>
> if hasattr(element,"parent") and element.parent() is self.parent():
Just a variant:
if self.is_parent_of(element):
Yes, this was suggested to me after I'd abandoned the catalog I
posted. I'm fairly sure that most, if not all of my bijections follow
directly from the recursive structure of Catalan objects.
On Mon, Mar 26, 2012 at 10:25 AM, matthew Drescher wrote:
> i would be interested. I had it in mind to f
i would be interested. I had it in mind to focus on the recursive structure
of the Catalan objects( objects that can be counted via catalan numbers).
C_{n+1} = \sum_{i=0}^{n}C_{n-i}C_{i}
when defining a new catalan object we would just need to specify the
recursive structure. This way we might n
> Christian, this is far from standard. It's fairly discombobulated
> scratch work. The objects aren't even classes.
my last reply was too fast, sorry. Now as I look at the actual code, I
see what you are doing... Nonetheless, I find it a nice idea to gather
Catalan objects and their bijections,
Christian, this is far from standard. It's fairly discombobulated
scratch work. The objects aren't even classes.
If you look for the cell that starts out:
CatCat = CatalanCatalog()
CatCat.add_type('c','binary tree',...
and execute that, then things should work better for you. The
relevant cel
Hi Mark --
> But the braid relation describes the long element of the
> dihedral group generated by s1 and s2, so by the above length-additivity,
> s1 (s2 s1 s2) will act the same way as s2 s1 s2.
Thanks for providing a detailed proof, it might be worth having a
reference in the source code, so p
Christian,
Thanks very much for having a look!
> - apply_demazure_product takes either an element or a reduced word.
> -- Is it clear that different words for an element produce the same
> Demazure product?
There is some flag variety geometry which implies this directly.
For a more hands-on pro
Hi Mark,
I was just looking at your coxeter_ms patch. Here are some remarks:
- apply_demazure_product takes either an element or a reduced word.
-- Is it clear that different words for an element produce the same
Demazure product?
-- why do you want the word to be reduced; I constantly use the
De
> http://flask.sagenb.org/home/pub/101/
Thanks, I can see it now. I was also able to call
sage: CatCat
<__main__.CatalanCatalog instance at 0x10d01be60>
on 4.7.2, but the bijections seem to be missing,
sage: CatCat.map('r','o')
ValueError: Can't map objects of type r into objects of type o
and
14 matches
Mail list logo
