Re: [sage-combinat-devel] Re: Inversion of matrix...

2013-09-05 Thread Nicolas Borie

Hi all,

Thanks you Simon for the time you spent to give answers. Thanks you also 
Vincent for the suggestion. I have now a trac number : 
http://trac.sagemath.org/ticket/15160


Feel free to rephrase the ticket description or modify anything (still 
my English...). This is far from final but partial results may interest 
some people in the combinat community. The suggestion and advises can 
now go to the trac ticket. I am still motivated to do the job but alone, 
It will remains too hard for me so thanks you Simon for having describe 
how attack this problem.


I just uploaded a drafty patch with some tests but no documentation. 
Before this small patch, once cannot multiply a scalar and a matrix if 
the coefficient didn't inherit from RingElement. Now, here is a small 
log of what can be done :


*
sage: from sage.matrix.matrix_space import test_special_ring
sage: test_special_ring(verbose=True)
Test with : An example of an algebra with basis: the free algebra on the 
generators ('a', 'b', 'c') over Rational Field

Let M be an invertible matrix:
[  B[word: ]  B[word: b]  B[word: a]]
[  0   B[word: ] B[word: ab]]
[  0   0   B[word: ]]
Here is the invert computed:
[ B[word: ]-B[word: b] -B[word: a] + 
B[word: bab]]

[ 0  B[word: ] -B[word: ab]]
[ 0 0  B[word: ]]
inversion OK
   
Test with : Symmetric Functions over Rational Field in the Schur basis
Let M be an invertible matrix:
[ s[] s[2]  s[]]
[   0  s[] s[1]]
[   00  s[]]
Here is the invert computed:
[  s[] -s[2] -s[] + s[2, 1] + s[3]]
[0   s[] -s[1]]
[0 0   s[]]
inversion OK
   
Test with : An example of Hopf algebra with basis: the group algebra of 
the Dihedral group of order 6 as a permutation group over Rational Field

Let M be an invertible matrix:
[ B[()] B[(1,2,3)] B[(1,3,2)]]
[ 0  B[()]   B[(1,3)]]
[ 0  0  B[()]]
Here is the invert computed:
[B[()]   -B[(1,2,3)] B[(1,2)] - B[(1,3,2)]]
[0 B[()] -B[(1,3)]]
[0 0 B[()]]
inversion OK
   
Test with : Group algebra of Symmetric group of order 4! as a 
permutation group over Rational Field

Let M be an invertible matrix:
[ B[()]  0  0]
[B[(2,3,4)]  B[()]  0]
[B[(2,4,3)]   B[(2,4)]  B[()]]
Here is the invert computed:
[B[()] 0 0]
[  -B[(2,3,4)] B[()] 0]
[B[(3,4)] - B[(2,4,3)] -B[(2,4)] B[()]]
inversion OK
   
Test with : Non-Commutative Symmetric Functions over the Rational Field 
in the Phi basis

Let M be an invertible matrix:
[   Phi[] Phi[2, 1, 2]   Phi[3]]
[   0Phi[] Phi[1, 0, 1]]
[   00Phi[]]
Here is the invert computed:
[ Phi[]  -Phi[2, 1, 2] Phi[2, 1, 
2, 1, 0, 1] - Phi[3]]

[ 0 Phi[]  -Phi[1, 0, 1]]
[ 0 0  Phi[]]
inversion OK
   
*

Inversion OK means that the result was the right answer. Note also that 
the first and last example are in the non-commutative world.


Feel free to comments (ok on the trac or on this list if you prefer) 
what I already done to allows me to continue in a good way.


Cheers,
Nicolas B.

--
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+unsubscr...@googlegroups.com.
To post to this group, send email to sage-combinat-devel@googlegroups.com.
Visit this group at http://groups.google.com/group/sage-combinat-devel.
For more options, visit https://groups.google.com/groups/opt_out.


[sage-combinat-devel] Review request(s): cycle index series code

2013-09-05 Thread Andrew Gainer-Dewar
Hello!

I currently have three open tickets with patches which add functionality
related to cycle index series. I'd really appreciate reviews, comments,
or other input!

* #14543: adds a compositional_inverse() method to CycleIndexSeries
which, naturally, computes a plethystic inverse for a given cycle index
series. I believe this one is all set to go, but it needs a review from
someone who is comfortable with the inner workings of CycleIndexSeries
and (possibly) LazyPowerSeries.

* #14846: shuffles things around so that the derivative() and
exponential() methods of CycleIndexSeries correspond to the
combinatorial definitions of those operations (which are different than
those inherited from LazyPowerSeries). The code works fine (as far as I
can tell), but this is a design decision, and I'm a new kid, so I'd
appreciate the input of more experienced folks on whether this is
appropriate.

* #14347: adds a GroupCycleIndexSeries class which implements Γ-cycle
index series, which allow for working with species which carry a
structural group action as in cf. [1]. I have some papers in draft
that use this code, and I'd love to be able to cite a shipped version of
Sage!

--Andrew

[1] http://www.combinatorics.org/ojs/index.php/eljc/article/view/v19i4p45



signature.asc
Description: OpenPGP digital signature