|
Nicolas Borie
Maître de conférences en Informatique Équipe Combinatoire algébrique et calcul formel Responsable de la filière informatique Design, Architecture et Développement de l'ESIEE Paris Bureau 1B190 Université Gustave Eiffel Bâtiment Copernic, 5 Bd Descartes, 77420 Champs-sur-Marne France E-mail: or |
|
Index | Recherche | Enseignement | Software | Borie Awards | PLaTon
PC Prographs editor
Since my last papers about Product-Coproduct Prographs, I decided to provide a small open python application to illustrate these recent theories. You can find the code (still in developpement) on Github.
link to documentation of the project
I am user and contributor of the open source mathematics software SAGE. SAGE is a free open source alternative to Magma, Maple, Mathematica and Matlab. There is a large community of contributors in which lies a group focused on the combinatorics : Sage-combinat-devel.
Last contributions:
|
||
|
The Sage-combinat-devel Google Group | |
I am contributor of SAGE since May 2008. All SAGE code is reviewed as seriously as possible before integration passing throw the SAGE trac server. Here is the list of my personal contribution.
Tickets closed (code submitted, accepted and integrated in SAGE) :
- Ticket #6647 : Permutation Group improvements
- Ticket #8347 : Test the positivity of a number field element
- Ticket #8519 : Add a factory of finite/infinite enumerated set (with categories) defined by Range(begin, end, step)
- Ticket #7538 : equality of posets is broken !
- Ticket #8030 : Strong generating system returns heavy error for non transitive group
- Ticket #9056 : Add the category of SemiRings with an example : NonNegativeIntegers()
- Ticket #8549 : Implements cycle index for permutation groups, toward Polya enumeration
- Ticket #8500 : Add the set of TransitiveGroups
- Ticket #10127 : Fix initialization order in CombinatorialFreeModule
- Ticket #8288 : Depth/Breadth improvement for SearchForest
- Ticket #10651 : Make a good use of the EmptySetError in EnumeratedSets and Parent
- Ticket #11166 : Typo in initialization of FreeModule_generic_field
Tickets under development :
- Ticket #6812 : Enumerate integer vectors modulo to the action of a Permutation Group
- Ticket #6889 : Algebra of multivariate polynomials invariant under the action of a permutation group
- Ticket #9949 : Add major index (polynomial) for the symmetric group
- Ticket #11257 : Avoid a coercion when computing an element to the power of 0
My current long time goal is to produce a robust and efficient module to compute the ring of invariant polynomials under the action of a permutation group.
OLD :
Here is a log of computation
for the 61th transitive group over 14 variables.
(group of cardinality 50 803 200 needed currently 7.5 hours of computations)
---------------
---------------
