Dear Biswajit,
it doesn't hurt opening a question with a friendly sentence.
Anyway, as the output tells you, your graph vertices are labelled by
strings (namely "x0", "x1", ...) which you cannot multiply as the
product of two strings is not defined here.
If you want to use variables instead,
Hi there,
I need some help with the category framework.
There is a category finite Coxeter group which is
CoxeterGroups().Finite(). I now have implemented a category
ComplexReflectionGroups().Finite().WellGenerated() which is certainly
a super category of CoxeterGroups().Finite().
But if I add
Great, that worked -- thanks Nicolas!
Here is one more issue, is that what I should expect, or should I
change something there? (Should Category of finite groups still be
there?
Thanks again,
Christian
Failed example:
FiniteCoxeterGroups().super_categories()
Expected:
[Category of
Hi all,
- Can GAP iterate through the elements of a finite matrix group (at
this point this is all GAP know about the group) without storing
them all in memory.
according to the user manual of Chevie
(https://www.imj-prg.fr/~jean.michel/gap3/htm/chap069.htm#SECT024) it
is possible to
Does findstat relly on a big database that is enhanced with the new queries?
Or does it compute every query from scratch?
I start with answering here since this the crucial point.
We want to use Sage in FindStat only in the background, a user
interacting with FindStat (by searching for
Would it be possible to include the findstat functionality in sage? That is,
i have a bunch of pairs (permutation, number), then call the function
findtsta on them, and get a list of possible ways that the numbers can me
computed from the permutations. All inside sage, without need to go to
Just to make this statement more precise: it will not be possible within the
next two years if Mmarco relies on your availability for this (there is no
blame in that statement, it's just a clarification that others might be
willing to work on this problem).
It is not a problem -- it's the
It seems that actually nobody read my initial post on that thread... so let
me repeat
I did -- but didn't really have any qualified contribution...
But the semantic has to be implemented at the level of maps not at the level
of methods.
could you explain what you mean there (maybe using
The second step would be to think how to add semantic to the map. Part
of is already managed by the axioms/categories (for example a Morphism
between GradedSets preserve the grading). But there is nothing for
injectivity/surjectivity or more subtle properties.
Thanks for the clarification! I
Ceterum censeo: Please do not put too much semantic into an attribute of
the map. It will be a burden for the map, will cost memory, and will be
difficult to search.
I would personally really like to get semantic information about maps
implemented in Sage. This starts with automated
well, there was a decorator for statistics before the move to gitI have
code that used it.
sorry, Martin, that we removed it again!
But you see that Nathann keeps arguing it is not useful to people (I
am not going to participate in that discussion -- I want to do math
and I don't kill my
Besides: is it possible to run a more exhaustive FindStat search? If I
understand correctly, FindStat limits itself to 3 maps, right?
No -- you can change the 3 into a 5 at most. And the at most is just a
limit to not run for too long, so if you are willing to wait
overnight, we can also do 6
Another question: I would like to search for a statistic (on permutations,
but the question applies in general) that satisfies addtitional structural
constraints (eg., it should be invariant under conjugation with the long
cycle). Is such a search also possible?
The obvious solution is to
Yes! So, if I want to perform such a query, I should send the code
generating the statistic to you, right?
How urgent is it? -- I could try and see if the server explodes if I
increase the 5 to a 7. That way, you can keep playing there.
--
You received this message because you are
I am in need of browsing through all the statistics on permutations and
derangements, and wanted to use combinatorial_statistics_in_class, but I
can't find it anymore...
What should I be using?
Hi Martin --
sage: from sage.combinat.combinatorial_map import combinatorial_maps_in_class
sage:
thanks for the fast reply -- but I need statistics, not maps. I..e, I'd like
to have a list of all methods applying to permutations that return a number...
sorry for not properly reading your request! We had, similar to the
@combinatorial_maps decorator, an @combinatorial_statistic decorator
Hi,
Is it on purpose / can I rely on the following behaviour for skew tableaux:
sage: tab =
SkewTableau([[0,1,None],[None,None,1,2],[None,None,0,0,1],[1,None]]); tab
[[0, 1, None], [None, None, 1, 2], [None, None, 0, 0, 1], [1, None]]
As we also had for compositions, it appears that I can even
Thanks for your comments, Darij! My impression is that I also do not quite
answer to your mail:
What I would like to have:
Given a partition \lambda (or something more general, even a BadShape
without knowing what that is), I would like a class of all Le diagrams of
shape \lambda. I.e., a class
Hi there,
I wonder if someone already has code for Postnikov's Le diagrams. These are
fillings of partitions fitting in a box with 0's and 1's with the
additional property that no 0 has a 1 in the same column AND to its left in
the same row.
My aim is to get Le diagrams (or maybe the subclass of
Below my office mate's term for lattice polytope:
lattice polytope is
целочисленный многогранник
(by the way, both polytope and polyhedron are translated in Russian by this
single word).
Cheers, Christian
--
You received this message because you are subscribed to the Google Groups
Sorry, I don't know Russian either. As a tiny step, I selected links
to the appropriate english wikipedia page to at least clear potential
ambiguity. Some have translations in other languages which might help.
I am sure Sergey Fomin knows all those terms in case they exist in Russian
- I
Yes, but it's associative, so it works... (Except I don't expect it to
have much of a use.)
can you be more specific? How is the product uv defined? I see that you
have a shuffle product defined, but I don't see that you have
concatenation...
Thanks, Christian
--
You received this message
Hi,
do you consider the following a bug?
sage: A = Core([2],4)
sage: B = Core([2],5)
sage: hash(A) == hash(B)
True
The hash of a core only depends on the list and not on the core. Since the
same list considered as an x- and as a y-core are fundamentally different
objects, I would rather suggest
sage: (Partition([2]).to_core(4)).parent()
5-Cores of length 2
Okay, I get from the documentation of to_core that this returns what it is
supposed to.
But anyway, let me mention that for me as someone not very familiar with
the topic, I would expect that Partition([2]).to_core(k) checks if
I wouldn't necessarily call that a bug, as it is necessary since A == B.
four people, two options, five opinions...
Let me ask this, is being a k-core a property of a partition or is it a
*distinct* combinatorial object?
As mathematical concepts, that doesn't make much of a difference, I'd
Hi,
you find the same question here:
https://groups.google.com/d/topic/sage-combinat-devel/1zS_nkfqSSA/discussion
I would very much appreciate if we could get this fixed!
Cheers, Christian
http://www.stump.tv
--
You received this message because you are subscribed to the Google Groups
crossposting nbruin's comment from
http://trac.sagemath.org/ticket/14862#comment:6 :
The thing that mainly surprises me is that
sage: a=Hom(ZZ,ZZ)(1)
sage: b=Hom(ZZ,ZZ)(1)
sage: Composition(a,b)
fails. Composition is such an overused term in mathematics that I think
it's ill-advised to expose
Hi,
I see that there is already an optional argument maximality=False in the
code of PairwiseCompatibleSubsets, but I don't see it used in the code -
and I actually vaguely remember Nicolas saying that this was not yet done.
I wonder if it would be hard to add the maximality feature to
Hi all,
I am sure some of you have been thinking about that before:
sage: a = Permutation([3,2,1])
sage: b = Partition([3,2,1])
sage: c = Composition([3,2,1])
sage: a == b == c
True
sage: hash(a) == hash(b) == hash(c)
True
Is this desired behaviour?
Thanks, Christian
--
You received this
Hi Nicolas,
to use the Cythonized class
ClonableList instead of CombinatorialObject: I just checked and
ClonableList._hash_ takes the parent into account.
Thanks Nicolas! Is this still planned to happen in the not too far future?
--
You received this message because you are subscribed to
That is, if we postpone the optimization of the various methods to take
better advantage of clonable lists, but that's ok.
would this eventually also improve the speed to check dict containment
of such elements?
--
You received this message because you are subscribed to the Google Groups
Hi all,
since Nathann started to hate combinatorial map decorators, I think
we can start yet another discussion if we want them or not here on the
mailing list.
I start with Nathann's comment on #14734:
The function's name is way too vague, and I think that it brings
absolutely nothing to
Just for the records, in case we / someone is interested in such an algorithm:
http://mathoverflow.net/questions/128540/generating-random-young-tableaux-a-peculiar-probability-identity
Cheers, Christian
--
You received this message because you are subscribed to the Google Groups
Hi,
Does anyone know if there is an easy way to draw posets from bottom to
top as we had it a while ago?
Cheers, Christian
--
You received this message because you are subscribed to the Google Groups
sage-combinat-devel group.
To unsubscribe from this group and stop receiving emails from it,
latex or plot drawing?
Do you mean something like
sage: H = P.hasse_diagram()
sage: H.set_latex_options(format='dot2tex', prog='dot', layout='acyclic')
sage: view(H)
This gives the poset as well upside down.
--
You received this message because you are subscribed to the Google Groups
first ask
here...
Thanks, Christian
--
Christian Stump
christ...@stump.tv
www.stump.tv
--
You received this message because you are subscribed to the Google Groups
sage-combinat-devel group.
To unsubscribe from this group and stop receiving emails from it, send an email
to sage-combinat-devel
http://trac.sagemath.org/sage_trac/wiki/SageCombinatRoadMap
Thanks Anne, I added a link here, and created the new page on
http://sagemath.org/combinat/clusteralgebras
--
You received this message because you are subscribed to the Google Groups
sage-combinat-devel group.
To unsubscribe from
Hi,
I wonder if there is a way to get a canonical form of a subgroup of a
permutation group (or, even better, any group). This would be
something like a method canonical_labeling for permutation groups
that returns an isomorphic permutation group, and such that two groups
are isomorphic if and
In GAP one would just IdGroup() to get a unique label.
Is this given for any finite group in GAP, or is this depending on
http://www.gap-system.org/Packages/sgl.html ? It looks like there is
not much to do beyond these IdGroup in Sage since I guess they would
have gone beyond n=22 in Gap
Make a database_foobar.spkg for your tables.
Thanks!
I did that, and everything seems to work (I can install the package
using sage -f cluster_seed-1.0.spkg). Could maybe someone have a look
at it
(http://trac.sagemath.org/sage_trac/raw-attachment/ticket/13425/cluster_seed-1.0.spkg)
since I am
Hi there,
I wonder if it is reasonable to add files containing precomputed data
to a patch. In our case, we are talking about 0.5mb of exceptional
mutation classes of clusters of Kac-Moody type. What would then be the
way to get these files into some subfolder of the data folder, or
where should
Hi graph plotting people!
I have the following graph with loops and multiple edges:
sage: G = DiGraph()
sage: G.allow_loops(True)
sage: G.allow_multiple_edges(True)
sage: G.add_edges(
[('Binary trees', 'Binary trees', 'Left border symmetry'),
('Binary trees', 'Binary trees', 'Left-right
Can someone (maybe you Nathann), tell me how to get a nice tikz
plot of this (using Sage, of course)? If there is no change to get
multiple edges, I could as well take the edge and provide a long
string (drawn maybe along the edge) to replace the multiple edge.
Thanks Nicolas, that
Not exactly an answer to your question, but you could maybe ask for a
left-to-right layout instead of top to bottom?
thanks for the suggestion, but this is not really an option since I
get edges in all directions, however I turn it, I will have quite some
edges going north-south...
Cheers,
Of
course this would only be after it has been broken up into connected
components. Perhaps I'm over simplifying things...
If I understand it right, Nicolas suggested to move that stuff the the
CoxeterGroups category. In this generality, this approach of checking
finite types doesn't work, but
Isn't that nice:
sage: Permutation(12)
ValueErrorTraceback (most recent call last)
...
ValueError: invalid literal for int() with base 10: ''
sage: Permutation(123)
[1, 2]
sage: Permutation(1234)
[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19,
When I start up sage-5.7.beta3 it doesn't tell me what branch I am using.
Is there a way to tell?
If there is a command in sage like 'branch()' it would be helpful. How do I
find it?
It usually tells you when starting sage (nothing for main, or current
brench is: ... otherwise). You can also
Hi,
I wasn't able to get the queue running on 5.6.beta2 here - but I hope
I didn't introduce too many new problems trying...
@Travis: did you introduce #+5_6_beta1, 10193_rebase ? This way, one
cannot install the combinat queue anymore since sage -combinat
qselect doesn't understand this
Hi --
Below are the results of my attempt to apply the queue on 5.6.beta2.
thanks for investigating!
Christian: trac_8327_universal_cyclotomic_field-cs.patch needs to be rebased
over your patches #13727 and #13728, which also need to be added into the
queue. (Unless I'm mistaken, the
Hi,
I see that there is quite some stuff implemented for WordPaths. I
now wonder if someone already has code (or how much work would it be)
to provide the possibility of constructing WordPaths from a given
start point A to a given end point B that are contained in a region
given by linear (or
Hi --
I just got back to the problem that I would like to have the maximal
elements in what is currently called PairwiseCompatibleSubsets (and
this is at least the n-th time I am getting back to this). So I wonder
if anyone is going to look at this within finite time, or if I should
find a
Hi Travis,
I've upgraded, so feel free to push your changes and I'll rebase #13605 as
needed.
I don't have anything to push, I am fine with the queue as is...
--
You received this message because you are subscribed to the Google Groups
sage-combinat-devel group.
To post to this group, send
Hi,
The queue applies fine for me on plain 5.5.rc0. Maybe your guards are not
set correctly? This is what is usually the problem for me when the queue
seems to have suddenly gone wonky.
Thanks, Hugh, for rechecking! My mistake this time was that I was
reviewing Travis patch in the main sage
Hi,
Thanks for doing this for me Travis and Nicolas! I've just synced and
everything is fine.
I now have again a reliable connection to test the queue.
Unfortunately, it still didn't work for me to install sage combinat on
a plain 5.5.rc0. I had to disable Travis' 12587 due to tons of
Thanks Travis. I just pulled your rebase off the queue and now #12876 is the
only patch which does not apply for 5.5.rc0.
As before, guarding out the #12876 patches let everything else in the queue
apply, but sage won't build.
I would really appreciate if we could make the queue apply on
A sysadmin rebooted combinat.math. He reports that Fyi, the status
indicator on the front was displaying a multibit error on DIMM C7.
After power cycling, the display came up blue (no errors). It may be
nothing, it may be the problem. Just sharing in case it helps.
Thanks a lot for
Hi Nicolas and Frederic,
in patch
trac_13550_dyck_wordsdinv-addition-cs.patch
I had to modiffy non_decreasing_parking_function.py. This caused problems
in the two patches
finite_semigroup-nt.patch
catalan_quasi_symmetric-fc.patch
I added a rebase patch for each of the two afterwards. Please
Christian had one way of handling this that I thought was OK, but I thought
not ideal.
D.to_permutation(Bandlow-Kilpatrick)
which is now
D.to_312_avoiding_permutation()
and
D.to_permutation(Krattenthaler)
which is now
D.to_132_avoiding_permutation()
I do still prefer this approach
Hi Florent,
+__len__ = None
+
I removed it from my patch
Do you think you will beat me
certainly not. The main problem is that we didn't get the universal
cyclotomics into Sage yet (hint, hint, hint for anyone), and this is
needed for the reflection group patch... And when this is done
I'm rather desperate (I didn't update because I needed a stable
environment, but now it seems that the operating system was updated
:-())
if you just want a working version old of the queue, the following might work
cd SAGE_ROOT/devel/sage-combinat
sage -hg update -r XXX
sage -hg qpop -a
sage
Hi,
Robert Bradshaw asked if we could lazily import all the cluster stuff,
and I somewhat agree (without really knowing all deeper implications).
Do we already have some standard procedure to do that with the
combinat stuff?
I was about to replace
from cluster_algebra_quiver.all import *
by
Hi Anne,
sage -hg qselect
sage -hg qpush -a
I don't know why I constantly forget to do so. Thanks for the reminder...
--
You received this message because you are subscribed to the Google Groups
sage-combinat-devel group.
To post to this group, send email to
This is something we should certainly have earlier or later (or maybe
someone has code already?):
http://mathoverflow.net/questions/105685/explicit-method-to-compute-macdonald-koornwinder-functions
Christian
--
You received this message because you are subscribed to the Google Groups
Hi,
trac_13403-bijection_KR_crystals_tableaux-ts.patch doesn't apply on
5.2 . Since it is the newest version, we might want the queue to apply
there (even if most people updated to 5.3.??? already - I am now doing
so with 5.3.rc0).
Christian
--
You received this message because you are
Quick and from the phone (since we are currently biking at the Baltic see):
I vote with Anne and Mike for homogeneous or complete homogeneous. Best,
Christian
--
You received this message because you are subscribed to the Google Groups
sage-combinat-devel group.
To post to this group, send
Hi,
for the record: I updated sage.lacim.uqam.ca and now, the notebook
shows images again properly. I will give a presentation tomorrow at
the ICRA computer algebra session
(http://www.math.uni-bielefeld.de/icra2012/conference_tuesday.php), so
I am glad this issue was solved in 5.2!
Best,
Since there were still people having problems to install sage 5.2 (or
higher), here is a discussion on sage-support
https://groups.google.com/d/topic/sage-support/p4VfY9nxsyE/discussion
For Travis an me, it worked after instaling libssl-dev as described there.
Best, Christian
--
You received
It should apply cleanly to 5.2. Assuming you fix that and repost it,
unfortunately, 9265 does not apply anymore on 5.1...
Best, Christian
--
You received this message because you are subscribed to the Google Groups
sage-combinat-devel group.
To post to this group, send email to
what I usually do is:
this is a very nice and detailed description -- thanks! maybe you
wanna add it to wiki?
* hg qrefresh followed by hg export qtip foo.patch
is there, in this situation, a difference between hg export qtip
foo.patch and hg qrefresh (that's what I usually do here) ?
P.S. Can you/someone please review my massive coxeter patch,
which has been languishing for months?
I will look at it some day in Japan in the next two weeks...
--
You received this message because you are subscribed to the Google Groups
sage-combinat-devel group.
To post to this group, send
sage -combinat qselect
Thanks, I accidentally did sage -qselect instead...
I pushed the changes.
Best, Christian
--
You received this message because you are subscribed to the Google Groups
sage-combinat-devel group.
To view this discussion on the web visit
Hi Martin,
one patch per class?
that's completely up to you, I guess
Another question: is it important to keep the number of statistics
small? I.e., if a statistic can be constructed via a map, is it better
*not* to implement it? (Eg., saliances and right-to-left-minima.)
I usually do
I just pushed a change to composition.py which breaks your patch.
I rebased the patch and also enabled Mike's patch again. But now, I
get the following error message after applying the queue, so I don't
push the changed...
Any idea (I am using 5.0)?
Hi Martin.
Eg., for personal enjoyment, I just added decorators to
number_of_crossings and number_of_nestings in perfect matchings.
(Christian: it works now, I made a stupid mistake)
good - any comments are welcome.
I see that there is a patch
concrete_combinatorial_statisics_and_maps_cs.
Hello,
(sorry for my late reply!)
I will also be there and can help with a sage session.
But the candidate of the time of the session is
the same time of the poster session on Monday,
the same time of the poster session on Tuesday, or
the time after all talks on Thursday before the
Hi --
Thanks for your replies!
really be returning
return self._parent
(I just made the same change after copying your code...)
here is a disadvantage of this solution:
sage: d = DyckWord([])
sage: d.maps._parent.maps._parent.maps._parent.maps.map1()
[]
which seems to be strange
My problem here is that on my computer maps? or maps?? is slow, while
maps.tab is fast. I don't know if others have this problem (maybe thats
what happens if you drop your computer and spill wine on it :)
The other disadvantage is that (short of a copy/paste) you still have to
type out the
I also like that. One further (?) idea:
.maps(codomain)
could be a way to access all maps with the given codomain. (I don't
know how one could specify the codomain however.)
In particular,
.maps(ZZ)
would yield all integer valued statistics.
The problem I see here is that whenever a
Hi --
I already asked this, but no one seemed to have an opinion on that...
I have now implemented 5 or 6 bijections between Dyck paths and
subsets of permutations (pattern-avoiding or noncrossing). I think
that it is not practical to have a name for each of them since they 1.
do not necessarily
Hi,
I am currently implementing some (simple to implement and not yet very
well studied) statistics for permutations. The main problem I have is
that they don't come with (or even have any) descriptive names, so I
wonder what to do, as an example, see
Hi Mike,
Add http://arxiv.org/pdf/math.CO/0310301.pdf to the list of
permutation statistics.
I will - in return I should ask to contribute something (whatever you
like) to the wiki at www.findstat.org ;-). I am currently trying to
add content to the page for permutations
Hi Mike,
your statistic made its way already.
I have a few things to say about dinv/area on Dyck paths that you don't
already have there.
:-) cool, go for it! If you have questions or remarks on the wiki
(like adding references, see any other page or
Hi Mike,
your statistic made its way already.
some dependency the finder tells you: did you know that pi.baj_index()
+ pi.reverse().baj_index() == \binom{n+2}{3} ?
Best, Christian
--
You received this message because you are subscribed to the Google Groups
sage-combinat-devel group.
To post
Hi --
does anyone have an idea why this might be true:
n * pi.inverse().number_of_descents() ==
pi.insertion_tableau().major_index() +
pi.insertion_tableau().cocharge()
--
You received this message because you are subscribed to the Google Groups
sage-combinat-devel group.
To post to this
Hi --
someone is asking for software to draw intervals in Weyl groups, see
http://mathoverflow.net/questions/98477/software-for-drawing-intervals-in-weyl-groups
.
Maybe someone can get him a satisfactory answer (and point him to
sage.lacim.uqam.ca to get all sage-combinat features).
Moreover, I
sage: P = lambda n : Poset([range(n), [(i,i+1) for i in range(0,n,2)]])
sage: time p = P(1); p
Time: CPU 2.24 s, Wall: 2.60 s
Finite poset containing 1 elements
sage: time p = P(1); p
...takes much, much, much longer then 2s...still hasn't finished...
same here -- do you already
Hi!
There is a break in sage between patch
trac_12895-subcategory-methods-nt.patch
trac_8327_universal_cyclotomic_field-cs.patch
fixed -- it was actually Mark closing the last link for the import
loop by importing
from sage.graphs.digraph import DiGraph
in categories/weyl_groups. I updated
Hi,
unfortunately, the queue is still broken at
trac_12940_affine_permutations-td.patch.
Christian
--
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@googlegroups.com.
To unsubscribe
Fixed. See other thread (NCSF/trac_12940_affine_permutations-td.patch)
thx, but don't forget to push, please!
--
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@googlegroups.com.
To
The definition of grading is that all maximal chains of every interval
have the same length. This is given in the above poset, but sage says
it is not graded.
The problem here is what people consider a rank function on a poset.
Do we want that all minimal elements have value 0 ? Then your
Hi,
How much are you altering root systems right now?
I was planning to put a small amount of new stuff in my coxeter-ms patch
but don't want it to break whatever you are doing.
go ahead, I am not doing any major things in there currently. if you
happen to break some of my stuff, let me know
Hi,
I am currently working on filling the wiki at www.findstat.org with
more data, since Chris Berg and I are going to present it at the FPSAC
this summer.
I would like to make the following changes to Dyck words:
1. changing a-statistic, b-statistic, d-statistic to area, bounce,
dinv (and
Hi Florent,
What so you mean by changing them ? Do you mean changing the name ?
yes.
ok with area
but I'd rather have number_of_bounce
but number of bounces is the the number of bounce points, while bounce
(being the sum of the heights of the bounce points, equal distributed
with area and
Hi all --
I just see that finally (!!!) 5.0 is out:
ftp://ftp.fu-berlin.de/unix/misc/sage/devel/index.html (you might want
to choose a different mirror though). I am currently compiling it on
Ubuntu 12.04 and OSX Lion with XCode 3.2 (?). Since nothing changed
since 5.0.rc1, I would propose to
Hi --
I have a question on proper documentation:
Hugh and I are currently finalizing the QuiverMutationType and have
the following problem: the file is organized similarly to CartanType,
so we have a factory delegating the work to reducible or irreducible
classes, or giving samples. In
But come on Just look at that !!!
sage: P = Poset( (range(len(p)), comparison) )
What happens if you add facade=True ?
sage: P = Poset( (range(len(p)), comparison), facade=True )
--
You received this message because you are subscribed to the Google Groups
sage-combinat-devel group.
To
There was still an issue upon running Sage. Travis: I temporarily
disabled your patch altogether, because it was conflicting with
another one.
you guys are still working? Pas mal!
--
You received this message because you are subscribed to the Google Groups
sage-combinat-devel group.
To post
Salut --
I just got up, and would push the base ring change for root / weigth /
ambient spaces.
But somehow, my patch has tons of doctest failures due to
sage: ct = CartanType(A1)
sage: P = ct.root_system().root_space()
sage: X = TestSuite(P)
sage: X.run()
Failure in
Hi Viviane,
This type of thing just broke my entire patch on multivariate
polynomials. I had to fix it by changing the field to ZZ or QQ but I
wonder why the default field has been changed...
sorry for that!
the reason is that I implemented non-crystallographic root systems and
reflection
here is an example (I think, it looks quite nice, doesn't it?)
sage: RS = CartanType(['A',2,1]).root_system().root_space()
sage: X = iter(TransitiveIdealGraded(attrcall(pred),RS.simple_roots()))
sage: i = 0
sage: while i 25:^Jx = X.next()^Jprint i,x^Ji += 1
:
0 alpha[0]
1
1 - 100 of 259 matches
Mail list logo
