Hugh Thomas writes:
> Hi!
>
> The short explanation of the problem is that
> sage/combinat/some_hopf_algebras/all.py was not importing parking functions
> from the right place. It should have been using
> sage.combinat.parking_functions. I have added a patch
> temporary_parking_import_fix-ht.
Hi there,
I just installed sage 5.5 from source and then did
sage -combinat install
But now I get what's reproduced below.
:-( What should I do? (upgrade does not work, since sage doesn't start)
Martin
rubey@convex3:~/sage
Christian Stump writes:
> 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 contain
Travis Scrimshaw writes:
> Martin,
>You mentioned that you had code for variants of RSK, could you
>repost/reference that?
I have no time until next week for cleaning but it's a start.
The domino insertion is currently only there as code for fricas (done by
a student, not myself). The
Travis Scrimshaw writes:
> Hey Nathann,
>The main reason why I stalled on the permutations input was mainly trying
> to figure out how to handle generalized
> permutations (a.k.a. bi-words, two-line arrays, in bijection with N-matrices)
> so the RS(K) examples will still work (and
> as a 2f
Nicolas & team, I think this is absolut wonderful what you did!
Martin
--
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 from this group, send email
Franco Saliola writes:
> It's not clear what you are desperate for. The command
I need some of the patches...
> 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 -hg qpush -a
>
>
Hi there,
I just installed sage 5.3 from source and did
sage -combinat install
and got
patching file sage/categories/category.py
Hunk #6 FAILED at 1803
1 out of 7 hunks FAILED -- saving rejects to file
sage/categories/category.py.rej
unable to find 'sage/categories/category_with_axiom.py' for p
"Nicolas M. Thiery" writes:
> On Mon, Aug 27, 2012 at 02:21:36PM -0700, Anne Schilling wrote:
>> I am against this. Why is the symbol of the basis h and not c? If
>> you want to change "homogeneous" to the full name of "complete
>> homogeneous" that is fine with me. In Sagan's book he first
>> i
"Nicolas M. Thiery" writes:
> On Mon, Aug 27, 2012 at 11:41:47AM +0200, Nicolas M. Thiery wrote:
>> sage: Sym.h() # should this be complete?
>> Sym on the homogeneous basis
>
> Hugh agrees with me (and Alain!) that "homogeneous" should be changed
> to "complete".
"Nicolas M. Thiery" writes:
> What do you think? Suggestions for further improvements?
I think this is a very good idea :-) Also, a short name without
renaming will be appreciated from my side.
Martin
--
You received this message because you are subscribed to the Google Groups
"sage-combina
Hi Nicolas!
thanks for the detailed explanation! One thing I don't quite
understand:
> A consequence of the above is that a piece of code that takes a
> decision upon the properties of a parent should use the `R in Fields`
> or `R in Fields()` idiom, unless there is a very good reason not to.
S
Anne Schilling writes:
> On 8/1/12 12:23 PM, Nicolas M. Thiery wrote:
>> On Fri, Jul 27, 2012 at 09:01:46PM +0200, Martin Rubey wrote:
>>> Maybe f.parent()._sets is what you want?
>>
>> Speaking of which: we probably should expose that using some method
>
Martin Rubey writes:
> (I see that Integers(13) is not in Fields...)
Oh, the truth is not so simple:
--
| Sage Version 5.1, Release Date: 2012-07-09 |
| Type "notebook()" for the browser-b
"Nicolas M. Thiery" writes:
> On Fri, Jul 20, 2012 at 03:40:44PM +0200, Martin Rubey wrote:
>> AttributeError: 'CombinatorialFreeModule_Tensor_with_category'
>> object has no attribute 'is_field'
>
> Ok, one should add
Anne Schilling writes:
> You can try
>
> sage: def mu(f):
> : Sym = SymmetricFunctions(QQ)
> : s = Sym.schur()
> : coeffs = f.monomial_coefficients()
> : return sum( coeffs[a]*s(a[0])*s(a[1]) for a in coeffs)
> :
>
> sage: f = s[3].coproduct()
> sage: mu(f)
> 2
"Nicolas M. Thiery" writes:
> On Sun, Jul 22, 2012 at 10:44:36AM +0200, Martin Rubey wrote:
>> I am not completely sure I see your point: do you mean, that it is often
>> the case that a doctest fails because of a *different* patch? And once
>> that one is fixe
Andrew Mathas writes:
> Thanks for posting the errors showing up in partition.py. It seems
> that you have an older version of the patch (which should have still
> passed the doc tests), or possibly a misapplied one. It should go away
> when you merge, but Anne says that my patch is not applying
I just compiled successfully sage 5.2.rc0 (with an install of the
openssl pkg in the middle).
However, the queue doesn't apply:
patching file sage/groups/perm_gps/permgroup.py
Hunk #1 FAILED at 279
1 out of 1 hunks FAILED -- saving rejects to file
sage/groups/perm_gps/permgroup.py.rej
patching fi
"Nicolas M. Thiery" writes:
> On Thu, Jul 19, 2012 at 11:45:09PM +0200, Martin Rubey wrote:
>> two things turned out to be very useful:
>>
>> 1) being able to mark tests as "expected to fail"
>
> That's certainly a nice too, but I would not a
Mike Zabrocki writes:
> Hi Martin,
>
> I just got around to looking at your code a little.
>
> I recognize your function my_plethysm() because this is
> simply .coproduct()
>
> sage: Sym = SymmetricFunctions(QQ)
> sage: Sym.inject_shorthands()
> sage: p([1,1,1]).coproduct()
> p[] # p[1, 1, 1] + 3
"Nicolas M. Thiery" writes:
> On Wed, Jul 18, 2012 at 01:43:50PM +0200, Martin Rubey wrote:
>> I am hitting a bug when creating a matrix of tensor products of
>> symmetric funcions and then trying to compute the determinant. (The
>> workaround is to say
Anne Schilling writes:
> For me with all patches applied on sage-5.1, the tests for
> partition.py also pass!
> On 7/19/12 6:58 PM, Andrew Mathas wrote:
>> I am curious as to exactly what you did to get these doc test
>> errors. Am I right in thinking that you applied all of the patches
>> curr
Anne Schilling writes:
> Here are several *ideas*:
>
> * We should run daily tests on the "needs review" section and pop patches
> off that section if the tests do not pass (or people are not actively
> working
> on making them pass).
>
> * Everyone should try to get their patches into main-
Anne Schilling writes:
> Hi Martin,
>
> If you want to run tests on your own patch, I suggest to apply it to a clean
> version of sage-5.2.rc0. All tests in a clean version of sage-5.2.rc0 should
> pass! The ones that fail would then be due to your patch.
Well, what I was doing depends on most o
I just wanted to test whether some experimental changes wouldn't break
anything and ran
sage -t devel/sage-combinat/sage/combinat/
I get quite a few failures, ugly errors, etc.
Which of these should I expect?
eg.
File
"/groups/comb/rubey/sage-5.1/devel/sage-combinat/sage/combinat/subsets_pai
I am hitting a bug when creating a matrix of tensor products of
symmetric funcions and then trying to compute the determinant. (The
workaround is to say algorithm=df)
Is it the responsibility of CombinatorialFreeModule_Tensor_with_category
to implement the methods of ring? I would have thought t
> Martin, best for your would be to install sage-5.1 right now.
thanks, that worked.
This enabled me to rebase the principal_specialization patch, it was a
trivial matter of fixing the indentation. Now all tests pass.
I am just about to commit.
Martin
--
You received this message because you
Hi Mike, Nicolas, Viviane, *,
I implemented naive algorithms to do plethysm and change of basis,
together with some tests from Lascoux' book. I don't really know what
the coproduct should be. I am convinced that one could do much better,
but at least it's a start. (I now see that I should proba
Anne Schilling writes:
> Hi Martin,
>
> I rebased your patch. Since Mike and I touched sfa.py quite heavily during the
> past week (see also http://trac.sagemath.org/sage_trac/ticket/5457 ), there
> was a conflict, which I hope I resolved. Make sure I did not mess anything up.
> Your doctests do
Dear Mike,
Mike Zabrocki writes:
> Hi,
> We are in the last few hours of sage days and I had to disable a few patches.
> I didn't figure what the cause was in these cases, only that they weren't
> working
> for me now.
> We made changes on symmetric functions so I am sure that Martin's
> patch
Christian Stump writes:
> 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
Christian Stump writes:
> The decorator is implemented in
> combinatorial_statistics_and_maps_decorator-cs.patch, the concrete
> examples in the one right after. Please don't modify the later
> (concrete_combinatorial_statisics_and_maps_cs.patch) since I am again
> and again changing it.
OK!
>
Hi there!
I'd like to know whether there is a policy, and if so, what it is, on
adding decorators to combinatorial statistics, and also adding
statistics themselves.
Eg., for personal enjoyment, I just added decorators to
number_of_crossings and number_of_nestings in perfect matchings.
(Christi
Christian Stump writes:
>> 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 stati
Mike Zabrocki writes:
> Making maps() into an attribute like Mike suggested sounds good to me.
> I am not so sure about maps_. Isn't it enough if maps?? would give a list
> of
> maps and their use cases?
>
> My problem here is that on my computer maps? or maps?? is slow, while
> maps
> Making maps() into an attribute like Mike suggested sounds good to me.
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 int
Mike Zabrocki writes:
> Hi Martin,
> Maybe you should take a look at scalar_qt in sfa.py
> since it is similar to the effect you want to have with
> principle specialization.
> That function
> (a) has parameters which are called q and t
> (b) outputs something that uses the variables q and t
Mike Zabrocki writes:
> Hi Martin
>
> I find this slightly confusing...
>
> I think that p is there to differentiate the variable name (which is p
> probably short for 'parameter') from the variable value (which is by
> default q).
Sorry, I wasn't clear enough: what I find confusing is that
Mike Zabrocki writes:
> Hi Franco,
>
> I will add the Error message improvement to my list of
> things to fix (Anne has also identified a number of issues that
> I need to address yet).
One tiny, possibly unrelated question: I noticed that q_int, q_binomial,
q_factorial take "p" as optional na
Martin Rubey writes:
> Dear Sage (and perhaps Gap) gurus!
>
> (I am not sure where I should ask this, so I'm trying both, please
> forgive :-)
>
> I would like to play with the "induction product" of characters of the
> hyperoctahedral group B_n = Z_2 § S_n
Martin Rubey writes:
> Dear Sage (and perhaps Gap) gurus!
>
> (I am not sure where I should ask this, so I'm trying both, please
> forgive :-)
It appears I am not allowed to post to sage-support... :-(
Martin
--
You received this message because you are subscribed to the Goo
Dear Sage (and perhaps Gap) gurus!
(I am not sure where I should ask this, so I'm trying both, please
forgive :-)
I would like to play with the "induction product" of characters of the
hyperoctahedral group B_n = Z_2 § S_n.
That is, given two characters chi and theta of B_m and B_n respectively,
Frédéric Chapoton writes:
> Well, there should be no problem with my patch, as it does just create
> a new file and does not touch anything else. The need for a merge was
> triggered because you did not update sage-combinat before
> commiting. This is normal and rather harmless, unless two person
Martin Rubey writes:
> Anne Schilling writes:
>
>> On 6/1/12 7:12 AM, Mike Zabrocki wrote:
>>> I'm not sure that everyone was getting the same conflict as I
>>> was and I am not sure why. I just disabled your patch and I will
>>> fold it into mine
Anne Schilling writes:
> On 6/1/12 7:12 AM, Mike Zabrocki wrote:
>> I'm not sure that everyone was getting the same conflict as I
>> was and I am not sure why. I just disabled your patch and I will
>> fold it into mine later.
>
> I would let Martin resolve the conflict instead of folding it as
>
Mike Zabrocki writes:
> Hi all,
>
> I've been working on a major revamp of symmetric functions. It is
> possible that the changes I have been making conflict with Martin's
> recent changes to the `principle specialization` and have broken the
> queue.
Sorry for that. Should I revert? Alternati
"Nicolas M. Thiery" writes:
> Dear Martin, Hugh, Florent,
>
>> > partition_k_boundary_speedup-fh.patch
>> > since this happens frequently: is there a way for me to fix it and help?
>>
>> In fact, I also get this reject in sage-5.0.beta14:
>
> There was a conflict with the newly introduced p
Anne Schilling writes:
> On 5/13/12 10:32 PM, Martin Rubey wrote:
>> Following advice of Volker, I installed 5.0rc1. This install went
>> fine. However, the combinat queue does not apply:
>>
>> patching file sage/combinat/partition.py
>> Hunk #1 FAILED
Following advice of Volker, I installed 5.0rc1. This install went
fine. However, the combinat queue does not apply:
patching file sage/combinat/partition.py
Hunk #1 FAILED at 428
1 out of 1 hunks FAILED -- saving rejects to file
sage/combinat/partition.py.rej
patch failed, unable to continue (tr
Volker Braun writes:
> Hi Martin,
Wow, many thanks for the quick answer!
> PALP has various compile-time limits. You can increase POLY_Dmax in
> the PALP sources but you are likely to hit another limit if your
> problem is this large.
Indeed... :-(
> Also, PALP typically does not do any chec
Dear gurus,
(I hope that I am posting this to the right list, please redirect me if
appropriate...)
I am using integral_points of a Polyhedron, but PALP complains with
"increase POLY_Dmax!"
I am using sage 4.8 with the combinat queue applied not so long ago.
Additionally, I installed
http://
Christian Stump writes:
>> group theorists would normally draw permutations as collection of directed
>> cycles, with labelled vertices.
>
> I would somewhat also expect this to be the default drawing of a
> permutation. Especially, when a permutation has a lot of fix points,
> diagram presentati
Dear Anders,
I was using lrcalc from within sage and noticed the following:
sage: lrskew([1,1],[2])[0].pp()
. .
1
that is, lrskew returns a tableau of shape [1,1]/[2] :-)
Should lrcalc check that mu is contained in lambda, or sage, or neither?
Many thanks,
Martin
--
You received this messa
"Nicolas M. Thiery" writes:
> I let the tableau fans decide whether we want to enforce that all
> entries of a (skew) tableau are Integers, and if yes to write a patch
> on lrcalc to convert the ints to Integers. We could throw this in the
> ticket #12284 which will make lrcalc a standard Sage pa
Hi there,
I was using lrcalc, and noticed that supplying the weight keyword does
not work, not even the doctest: (this is on sage 4.8)
lrcalc.lrskew([3,2,1], [2], weight=[3,1])
gives "1 not in alphabet".
I found that the problem is that the row_word of a skew tableau expects
its entries to be
Nicolas Borie writes:
> From my point of view, the problem is the following : You have a
> Constructor or SetFactory which have a lot of possible arguments and
> your code have to dealt with combination of arguments that make your
> set empty:
> (1) - I consider each argument as a mathematical c
"Nicolas M. Thiery" writes:
> Hi Martin!
>
> On Tue, Mar 13, 2012 at 09:53:08AM +0100, Martin Rubey wrote:
>> I just noticed that
>>
>> Partitions(-1).list() # or any negative integer
>>
>> gives a maximum recursion depth exceeded e
Dear Combinat-heros!
I just noticed that
Partitions(-1).list() # or any negative integer
gives a maximum recursion depth exceeded error. I think it should
return the empty list, right?
all the best,
Martin
--
You received this message because you are subscribed to the Google Groups
"sage-
Anne Schilling writes:
> * I have an implementation of tau_i and various generalizations of promotion
> operators on
> a poset. The easiest and fastest to implement these, is to do so on linear
> extensions and
> then pull them back to posets. Where should these methods go since there is
>
Mike Zabrocki writes:
> sage: a = var('a')
> sage: M = MacdonaldPolynomialsH(QQ[a])
> sage: s = SFASchur(M.base_ring())
> sage: q = M.q
> sage: s[2,1].plethysm(s[1]/(1-q))
> (((-9)*q^2+9*q)/(9*q^6+(-27)*q^5+27*q^4+(-18)*q^3+27*q^2+(-27)*q+9))*s[1,
> 1, 1] +
> (((-9)*q^3+9*q^2+(-9)*q+9)/(9*q^6+(-
Martin Rubey writes:
> Martin Rubey writes:
>
>> Hi gurus!
>>
>> I just hadto implement a GradedAlgebrasWithBasis, the basis being
>> StandardTableaux() and the degree given by the size of the tableau (and
>> a peculiar multiplication).
>
> and another,
Martin Rubey writes:
> Hi gurus!
>
> I just hadto implement a GradedAlgebrasWithBasis, the basis being
> StandardTableaux() and the degree given by the size of the tableau (and
> a peculiar multiplication).
and another, more important, question: what I actually want to do is to
Hi gurus!
I just hadto implement a GradedAlgebrasWithBasis, the basis being
StandardTableaux() and the degree given by the size of the tableau (and
a peculiar multiplication).
Now, everything works fine except that the output of the elements is not
sorted by degree.
How could I accomplish that?
Frédéric Chapoton writes:
> Here is a try
>
> Z=species.SingletonSpecies()
> E2=species.SetSpecies(min=2)
> P=CombinatorialSpecies()
> S=CombinatorialSpecies()
> P.define(E2.composition(Z+S))
> S.define(E2.composition(Z+P))
> N=Z+P+S
>
> That seems to work :
It should! Warning however: the unla
"Nicolas M. Thiery" writes:
> Hi Martin!
>
> On Wed, Jul 13, 2011 at 12:22:50PM +0200, Martin Rubey wrote:
>> Martin Rubey writes:
>> > I have a basis and two CombinatorialFreeModules over this basis, say one
>> > over QQ and the other over QQ
"Nicolas M. Thiery" writes:
> Hi Martin!
>
> On Wed, Jul 13, 2011 at 12:22:50PM +0200, Martin Rubey wrote:
>> Martin Rubey writes:
>> > I have a basis and two CombinatorialFreeModules over this basis, say one
>> > over QQ and the other over QQ
William Stein writes:
> On Wed, Jul 13, 2011 at 12:22 PM, Martin Rubey
> wrote:
>> Martin Rubey writes:
>>
>>> Dear combinat gurus!
>>>
>>> I have a basis and two CombinatorialFreeModules over this basis, say one
>>> over QQ and the ot
Martin Rubey writes:
> Dear combinat gurus!
>
> I have a basis and two CombinatorialFreeModules over this basis, say one
> over QQ and the other over QQ[q]. I'd like to convert elements from the
> first into the second. Is there a built-in way to do this, or do I have
&
Dear combinat gurus!
I have a basis and two CombinatorialFreeModules over this basis, say one
over QQ and the other over QQ[q]. I'd like to convert elements from the
first into the second. Is there a built-in way to do this, or do I have
to iterate over the coefficients?
(I'm not sure whether t
"Nicolas M. Thiery" writes:
> Dear Stefan,
>
> Thanks for your feedback!
>
> On Mon, Jun 20, 2011 at 02:08:18PM -0700, Stefan van Zwam wrote:
>>Sorry to bug you again with this (I already did so a few months back), but
>>I still have qualms with Sage's built-in Set type. For starter
Florent Hivert writes:
> On Tue, Jun 07, 2011 at 06:16:09PM +0200, Martin Rubey wrote:
>> Anne Schilling writes:
>>
>> >> Sure; Sorry for the typo. Here is what my current code does:
>> >>
>> >> sage: for i in Dyck
Anne Schilling writes:
>> Sure; Sorry for the typo. Here is what my current code does:
>>
>> sage: for i in DyckWords(3):
>> : print i, i.return_to_zero()
>> :
>> /\/\/\ [0, 2, 4, 6]
>> /\
>> /\/ \ [0, 2, 6]
>> /\
>> / \/\ [0, 4, 6]
>> /\/\
>> /\ [0, 6]
>>/\
>> /
Dear all,
I would really really really like to find a good design that merges
enumeration up to group action with combinatorial species.
Contrary to popular belief, combinatorial species do not only concern
the action of the symmetric group. In particular, the enumeration of
structures of functo
Anne Schilling writes:
>> sage: t = Tableau([[1,1,3],[2,3]])
>> sage: L = LinearExtension((t, 2))
>> sage: L.promotion()
>> [[1,1,2],[2,3]]
>
> Usual semistandard tableaux are already defined on a totally ordered
> alphabet {1,2,...,n+1}. So in this case, it would not add much.
Yes, it only give
Martin Rubey writes:
> "Nicolas M. Thiery" writes:
>
>> As for posets, I don't know. I would tend to first write a draft of
>> the method in Posets, and then decide if the interfaces and
>> implementations are similar enough to be shared or not.
>
>
"Nicolas M. Thiery" writes:
> On Tue, Mar 29, 2011 at 08:21:03AM +0200, Martin Rubey wrote:
>> 2) what can I do just to check whether something changed, without
>> applying the patches? I tried hg pull and hg incoming but that didn't
>> report any chang
Good morning gurus!
Two questions: 1)
applying crystals_localCharacterization_td.patch
patching file sage/categories/highest_weight_crystals.py
Hunk #3 FAILED at 125
1 out of 3 hunks FAILED -- saving rejects to file
sage/categories/highest_weight_crystals.py.rej
patch failed, unable to continue
"Nicolas M. Thiery" writes:
> As for posets, I don't know. I would tend to first write a draft of
> the method in Posets, and then decide if the interfaces and
> implementations are similar enough to be shared or not.
Here goes:
# http://www.combinatorics.org/Volume_16/PDF/v16i2r9.pdf
# Figure
Anne Schilling writes:
> Hi Martin,
>
> Promotion is defined on semistandard tableaux over the totally ordered
> alphabet
> say {1,2,...,n+1}. Your example below
>
> sage: t = Tableau([[3, 2, 1]])
>
> is not a semistandard tableau since it is decreasing in its row. Before
> promotion
> was only
I have a somewhat related question about combinatorial species. A
combinatorial species is really a functor from the category of finite
set with bijections to the same category.
Let F be such a species.
Currently (in Sage) we have that
F.structures(someListOfLabels)
gives an iterator over the
Anne Schilling writes:
> Hi!
>
> I just added a new patch on trac which implements the Schuetzenberger
> involution on both words and tableaux and also the promotion operator
> on tableaux of arbitrary shape:
>
> http://trac.sagemath.org/sage_trac/ticket/10446
I found that it doesn't work for ar
Dear Jason, *,
I just updated the principal specialization patch. I think it's
relatively stable now, maybe you want to have a look at it.
All the best,
Martin
--
You received this message because you are subscribed to the Google Groups
"sage-combinat-devel" group.
To post to this group, sen
"Nicolas M. Thiery" writes:
> How does this all sound?
Very nice!
Martin
--
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 from this group, send e
Are libraries somewhat similar in spirit to the method .an_element?
Martin
--
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 from this group, send em
"Nicolas M. Thiery" 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 with other kind
"Nicolas M. Thiery" 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 (see e.g. Mike's patc
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)
/home/martin/martin/TeXSource/CyclicSie
"Nicolas M. Thiery" 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 graph G whose nodes
Hi Anne,
trying to run the very first example, I get
sage: Tab = CrystalOfTableaux(['A',3], shape = [2,1,1])
...
ValueError: edge_options is not a LaTeX option for a graph.
Do I have to upgrade to 4.6.2?
Martin
--
You received this message because you are subscribed to the Google Groups
"s
"Nicolas M. Thiery" writes:
> Make sure this is the case, using the debugger:
>
> trace('x.partial_specialization()')
>
> or insert:
>
> import pdb
> pdb.set_trace()
>
> in your specific implementation (this will trigger a break in the
> debugger).
>
> Once this is confirmed, you prob
Hi there,
I'm not sure how tests (and examples) should be organised, when there is
both a generic implementation and several specialised ones. Eg., I have
a general implementation of principal_specialization but there are also
specialised implementations for the homogeneous, elementary, schur,
po
Anne Schilling writes:
>> cd $SAGE_ROOT/devel/sage-combinat/.hg/patches
>> sage -hg commit sf_principal_specialization-mr.patch
>> sage -hg push
>
> Ah! You should stay in the directory you are working in (or somewhere in the
> sage-cominbat/ tree). From there do
>
> hg qrefresh
>
> This applies
Anne Schilling writes:
> On 3/14/11 4:57 AM, Martin Rubey wrote:
>> Anne,
>>
>> it seems that
>>
>> devel/sage-combinat
>> hg qcommit .hg/patches/series
>>
>> worked. Could you please check?
>
> Did you do
>
> hg push
>
>
Anne,
it seems that
devel/sage-combinat
hg qcommit .hg/patches/series
worked. Could you please check?
Thanks,
Martin
--
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@googlegro
Anne Schilling writes:
> Ok, if you are just committing the series file, you should be in the directory
> /sage-combinat/.hg/patches
>
> From there
>
> sage -hg commit series
>
> (sometimes you need to remove series~ and other files that might have gotten
> created whilst editing).
>
> Is this w
Anne Schilling writes:
> Ah! You should stay in the directory you are working in (or somewhere in the
> sage-cominbat/ tree). From there do
>
> hg qrefresh
>
> This applies the changes you made in the file to your patch. The
>
> hg qcommit sf_principal_specialization-mr.patch
>
> which commits yo
Anne Schilling writes:
> Hi Martin,
>
> How did you add the patch? Using
>
> hg qnew sf_principal_specialization-mr.patch
>
> at some point?
yes. and then I did
cd $SAGE_ROOT/devel/sage-combinat/.hg/patches
sage -hg commit sf_principal_specialization-mr.patch
sage -hg push
> I can see the pa
Martin Rubey writes:
> Dear Nicolas & Jason,
>
> I think it worked now. Could you please let me know whether I made any
> mistakes - I guess I did since it's my first commit...
(I'd like to add: I just opened another ticket, #10931, concerning
combinatorial species,
Dear Nicolas & Jason,
I think it worked now. Could you please let me know whether I made any
mistakes - I guess I did since it's my first commit...
Martin
--
You received this message because you are subscribed to the Google Groups
"sage-combinat-devel" group.
To post to this group, send emai
1 - 100 of 137 matches
Mail list logo
