Is this intentional?
sage: Partition([1,1,1,0,1,1])
[1, 1, 1, 1, 1]
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-de...@googlegroups.com.
To unsubscribe from this group, send
Nicolas M. Thiery nicolas.thi...@u-psud.fr writes:
On Tue, Apr 27, 2010 at 04:13:08PM +0200, Martin Rubey wrote:
I was plotting a poset, vertices labelled by skew partitions.
Unfortunately, the labels overlap. Is it possible to zoom the plot?
Nope.
But with the #7004 patch applied
Nicolas M. Thiery nicolas.thi...@u-psud.fr writes:
Could you give me a hint how to apply this patch? (using patch, or is
there a builtin tool?)
sage -combinat install :-)
great.
For graphviz/dot2tex, see the trac ticket.
Yet another question: when I take the level_sets, how can I make
Martin Rubey martin.ru...@math.uni-hannover.de writes:
Nicolas M. Thiery nicolas.thi...@u-psud.fr writes:
Could you give me a hint how to apply this patch? (using patch, or is
there a builtin tool?)
sage -combinat install :-)
great.
I got:
patching file sage/graphs/generic_graph.py
Martin Rubey martin.ru...@math.uni-hannover.de writes:
Nicolas M. Thiery nicolas.thi...@u-psud.fr writes:
On Tue, Apr 27, 2010 at 06:10:07PM +0200, Martin Rubey wrote:
Martin Rubey martin.ru...@math.uni-hannover.de writes:
Nicolas M. Thiery nicolas.thi...@u-psud.fr writes:
Could you
Nicolas M. Thiery nicolas.thi...@u-psud.fr writes:
On Tue, Apr 27, 2010 at 04:28:43PM -0700, Anne Schilling wrote:
This looks like a bug. You should probably open a ticket!
Anne
Martin Rubey wrote:
Is this intentional?
sage: Partition([1,1,1,0,1,1])
[1, 1, 1, 1, 1
Nicolas M. Thiery nicolas.thi...@u-psud.fr writes:
On Tue, Apr 27, 2010 at 06:34:02PM +0200, Martin Rubey wrote:
sage: version()
'Sage Version 4.3.3, Release Date: 2010-02-21'
Hmm, I would have expected for this to work, though I did not try
recently. Your best bet is to install Sage
Alex Ghitza aghi...@gmail.com writes:
On Mon, 03 May 2010 10:09:13 +0200, Martin Rubey
martin.ru...@math.uni-hannover.de wrote:
Doesn't python support things like
[i for i in [3,2,1,0,0] while i0]
sage: [i for i in [3,2,1,0,0] if i0]
[3, 2, 1]
(I hate python)
That's too bad
Florent Hivert florent.hiv...@univ-rouen.fr writes:
Otherwise probably
l.reverse()
m = l
while m[0] == 0:
m = m[1:]
l.reverse()
m.reverse()
return m
You can do that better with
while not m and m[-1] == 0:
m.pop()
Sorry for being stupid:
while not m and m[-1]
Sorry for the amount of spam...
I checked the following:
def f1(l):
m = copy(l)
while not len(m) == 0 and m[-1] == 0:
m.pop()
return m
def f2(l):
m = []
for e in l:
if e == 0:
m.reverse()
return m
m.insert(0, e)
m.reverse()
Mike Hansen mhan...@gmail.com writes:
On Mon, May 3, 2010 at 11:42 AM, Martin Rubey
martin.ru...@math.uni-hannover.de wrote:
m = l
while not m and m[-1] == 0:
del m[-1]
is destructive on l.
m = l just makes m point to the same object that l is pointing to.
This would work and should
Franco Saliola sali...@gmail.com writes:
I forgot to mention, the documentation says Partition ignores trailing
zeros, but it actually ignores all zeros.
sage: Partition([2,0,1])
[2, 1]
This was recently discussed on this list. Mike Hansen showed how to fix
it.
Martin
--
You received
I tried the following with a student just a few minutes ago:
HLQ = HallLittlewoodQ(QQ, t=-1)
HLQ([2,1])*HLQ([1])
but it raised an error :-(
ZeroDivisionError: rational division by zero
Also,
sage: HLP = HallLittlewoodP(QQ, t=-1)
sage: HLP([3,2,1])*HLP([2,1])
P[5, 3, 1]
sage:
Dear heros,
I just downloaded and installed sage 4.6.1, and then did
sage -combinat install
but it failed:
patching file sage/combinat/root_system/root_space.py
Hunk #2 FAILED at 54
1 out of 3 hunks FAILED -- saving rejects to file
sage/combinat/root_system/root_space.py.rej
patch failed,
Nicolas M. Thiery nicolas.thi...@u-psud.fr writes:
Hi Martin,
On Mon, Feb 28, 2011 at 05:26:35PM +0100, Martin Rubey wrote:
Dear heros,
:-)
sage -combinat install
but it failed:
Fixed and pushed!
many thanks, now it works!
Just discovered a slight glitch. Fortunately p^-1
Dear Rado,
(I'm not sure wether this is the right place to ask...)
I'm very interested in using your graph editor from sage. However, it
seems that what I need is not covered directly - or am I missing
something?
Namely, I have a Poset P, which I usually draw as follows:
H =
Hi all,
the following worked for me:
H = P.hasse_diagram()
d = dict((v.vertex, pretty_print(v.element)) for v in P)
H.relabel(d)
D = DiGraph(H, pos=H.layout_graphviz())
graph_editor(D)
one more question: there appear two sliders length and strength but
they don't seem to do anything. What
that without being
able to try it...
The trick below is a step in that direction :-)
On Tue, Mar 01, 2011 at 06:15:06PM +0100, Martin Rubey wrote:
the following worked for me:
H = P.hasse_diagram()
d = dict((v.vertex, pretty_print(v.element)) for v in P)
Can you give a complete example
Nicolas M. Thiery nicolas.thi...@u-psud.fr writes:
Hi Martin!
And thanks for your feedback,
Thanks combinat!!!
On Wed, Mar 02, 2011 at 10:31:17AM +0100, Martin Rubey wrote:
BTW, I had problems (i.e., I could not) displaying a poset having graphs
as vertices. I'll post an example
Nicolas M. Thiery nicolas.thi...@u-psud.fr writes:
If I add the following line to your function so that the small graphs
are drawn by dot2tex instead:
G[1].set_latex_options(format=dot2tex, prog=circo)
then I get a reasonable picture (attached).
awesome!!!
Is there a way to make the
Dear all,
I just opened a trac account to create my first ticket (principal
specialisations for symmetric functions). I have one question:
* should I upload my patch on trac, or just commit it (I suppose with
qcommit, right?)
The patch compiles fine and passes all tests, but has some
Jason Bandlow jband...@gmail.com writes:
Dear Martin,
On 03/10/2011 03:09 AM, Martin Rubey wrote:
Dear all,
I just opened a trac account to create my first ticket (principal
specialisations for symmetric functions). I have one question:
I guess Nicolas answered your questions, but when
I'm currently trying to improve the species code. In particular, I
wanted to fix yet another bug with relabeling (done) and implement
equality (almost done).
I implemented equality by implementing __eq__ methods. However, I ran
into a problem: if a and b are lists of structures, i.e., elements
Martin Rubey martin.ru...@math.uni-hannover.de writes:
I'm currently trying to improve the species code. In particular, I
wanted to fix yet another bug with relabeling (done) and implement
equality (almost done).
I implemented equality by implementing __eq__ methods. However, I ran
Martin Rubey martin.ru...@math.uni-hannover.de writes:
Great! Unfortunately, it is quite likely that I won't be able to
connect my notebook to the internet before monday...
OK, I tried just now, but did not succeed. I followed
http://wiki.sagemath.org/combinat/MercurialStepByStep
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 email
Martin Rubey martin.ru...@math.uni-hannover.de 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
Anne Schilling a...@math.ucdavis.edu 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
Anne Schilling a...@math.ucdavis.edu 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
Anne Schilling a...@math.ucdavis.edu 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).
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
Anne Schilling a...@math.ucdavis.edu 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
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
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)
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
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
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, send
Anne Schilling a...@math.ucdavis.edu 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
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
Anne Schilling a...@math.ucdavis.edu 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
Nicolas M. Thiery nicolas.thi...@u-psud.fr 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:
#
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 nicolas.thi...@u-psud.fr 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 changes...
`hg log` in .hg
Martin Rubey martin.ru...@math.uni-hannover.de writes:
Nicolas M. Thiery nicolas.thi...@u-psud.fr 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
Anne Schilling a...@math.ucdavis.edu 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,
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
Anne Schilling a...@math.ucdavis.edu 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]
/\
/ \
/
Florent Hivert florent.hiv...@univ-rouen.fr writes:
On Tue, Jun 07, 2011 at 06:16:09PM +0200, Martin Rubey wrote:
Anne Schilling a...@math.ucdavis.edu 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
Martin Rubey martin.ru...@math.uni-hannover.de 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
William Stein wst...@gmail.com writes:
On Wed, Jul 13, 2011 at 12:22 PM, Martin Rubey
martin.ru...@math.uni-hannover.de wrote:
Martin Rubey martin.ru...@math.uni-hannover.de writes:
Dear combinat gurus!
I have a basis and two CombinatorialFreeModules over this basis, say one
over QQ
Nicolas M. Thiery nicolas.thi...@u-psud.fr writes:
Hi Martin!
On Wed, Jul 13, 2011 at 12:22:50PM +0200, Martin Rubey wrote:
Martin Rubey martin.ru...@math.uni-hannover.de writes:
I have a basis and two CombinatorialFreeModules over this basis, say one
over QQ and the other over QQ[q
Nicolas M. Thiery nicolas.thi...@u-psud.fr writes:
Hi Martin!
On Wed, Jul 13, 2011 at 12:22:50PM +0200, Martin Rubey wrote:
Martin Rubey martin.ru...@math.uni-hannover.de writes:
I have a basis and two CombinatorialFreeModules over this basis, say one
over QQ and the other over QQ[q
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?
Martin Rubey martin.ru...@math.uni-hannover.de 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
Martin Rubey martin.ru...@math.uni-hannover.de writes:
Martin Rubey martin.ru...@math.uni-hannover.de 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
Mike Zabrocki zabro...@mathstat.yorku.ca 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] +
Anne Schilling a...@math.ucdavis.edu 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
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
Nicolas M. Thiery nicolas.thi...@u-psud.fr 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 error. I think it should
return the empty
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
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
Christian Stump christian.st...@gmail.com 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,
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
Anne Schilling a...@math.ucdavis.edu 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 at 428
1 out of 1 hunks
Mike Zabrocki mike.zabro...@gmail.com 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
Anne Schilling a...@math.ucdavis.edu 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
Martin Rubey martin.ru...@math.uni-hannover.de writes:
Anne Schilling a...@math.ucdavis.edu 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
Frédéric Chapoton fchapot...@gmail.com 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,
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,
Martin Rubey martin.ru...@math.uni-hannover.de 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
Martin Rubey martin.ru...@math.uni-hannover.de 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.
just in case
Mike Zabrocki mike.zabro...@gmail.com 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
Mike Zabrocki mike.zabro...@gmail.com 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
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
Mike Zabrocki mike.zabro...@gmail.com 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
Christian Stump christian.st...@gmail.com 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
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.
Christian Stump christian.st...@gmail.com 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
Christian Stump christian.st...@gmail.com 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.,
Dear Mike,
Mike Zabrocki mike.zabro...@gmail.com 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
Anne Schilling a...@math.ucdavis.edu 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.
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
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
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
Anne Schilling a...@math.ucdavis.edu 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
Anne Schilling a...@math.ucdavis.edu 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
Anne Schilling a...@math.ucdavis.edu 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
Nicolas M. Thiery nicolas.thi...@u-psud.fr 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 algorithm=df
Mike Zabrocki mike.zabro...@gmail.com 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[] #
Nicolas M. Thiery nicolas.thi...@u-psud.fr 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 advocate this in our
situation
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
Andrew Mathas andrew.mat...@gmail.com 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
Nicolas M. Thiery nicolas.thi...@u-psud.fr 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 fixed, the patch owner
Nicolas M. Thiery nicolas.thi...@u-psud.fr 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 a method Rings.ParentMethods.is_field that raises
Anne Schilling a...@math.ucdavis.edu 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
foo, so that if F
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.
So
Nicolas M. Thiery nicolas.thi...@u-psud.fr 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
Nicolas M. Thiery nicolas.thi...@u-psud.fr 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
1 - 100 of 184 matches
Mail list logo
