On 1/10/11 6:38 AM, Nicolas M. Thiery wrote:
> On Mon, Jan 10, 2011 at 06:24:18AM -0800, Anne Schilling wrote:
>> I have a question about the Cartan type code:
>>
>> sage: C = CartanType(['A',4,2])
>> sage: C.classical()
>> ['C', 2]
>> sage: C.dual().classical()
>> ['C', 2] relabelled by {1: 1, 2:
Hi,
>> I have a question about the Cartan type code:
>>
>> sage: C = CartanType(['A',4,2])
talking about Cartan types:
I implemented QuiverMutationType to work with quivers and cluster
algebras in http://trac.sagemath.org/sage_trac/ticket/10527. Those
contain in particular all finite and affine
On Mon, Jan 10, 2011 at 06:24:18AM -0800, Anne Schilling wrote:
> I have a question about the Cartan type code:
>
> sage: C = CartanType(['A',4,2])
> sage: C.classical()
> ['C', 2]
> sage: C.dual().classical()
> ['C', 2] relabelled by {1: 1, 2: 0}
>
> Wouldn't it be better to output
> ['B', 2] in
Hi!
I have a question about the Cartan type code:
sage: C = CartanType(['A',4,2])
sage: C.classical()
['C', 2]
sage: C.dual().classical()
['C', 2] relabelled by {1: 1, 2: 0}
Wouldn't it be better to output
['B', 2] in this case?
Anne
--
You received this message because you are subscribed to
Dear Maximilian,
Thanks for the report and in particular the specific example!
On Mon, Jan 10, 2011 at 02:30:00PM +0100, Maximilian Schlund wrote:
> while experimenting with some random partial Latin squares I have
> come across some squares for which the is_completable() Call seems
> to
I am sorry... the exact sage-input should of course spell like this:
snip
L = LatinSquare(Matrix([[-1, -1, -1, 6, -1, 0, -1, -1, 9, -1, -1, 8,
11, -1, 4, -1],
[-1, 8, 4, -1, 15, 10, 0, -1, 2, -1, 6, -1, -1, -1, 3, -1],
[-1, -1, 8, -1, -1, 14, 3, 6, -1, -1, 4, 10, 5, 9,
Hello,
while experimenting with some random partial Latin squares I have come
across some squares for which the is_completable() Call seems to loop
indefinitely - i.e. I had to kill sage to abort it (it was not
responding to Ctrl+c) after running for several minutes ... I even once
let it run
Hello,
I made some improvements (?) of the Permutation function (in
improve_constructors_of_iet-vd.patch) in order to disable
{{{
sage: Permutation(['a','b','c'])
['a', 'b', 'c']
sage: Permutation([2,1,1])
[2, 1, 1]
}}}
We now have:
{{{
sage: Permutation(['a','b','c'])
TypeError
On Sun, Jan 09, 2011 at 11:47:35PM -0800, Simon King wrote:
> On 9 Jan., 18:10, Dima Pasechnik wrote:
> > On Jan 8, 1:54 pm, Simon King wrote:
> > ...
> > IMHO there should be several levels of equivalence, depending upon the
> > nature of morphism to be applied
> > (1) trivial morphism
> >
