Hi,

I'm also interested at this project.

 On Wednesday, March 2, 2016 at 4:23:17 PM UTC+5:30, mmarco wrote:

> Can you enumerate the functionalities in Macaulay2 that could be added to 
> Sage?
>
> El martes, 1 de marzo de 2016, 17:44:24 (UTC+1), AKSHAY AJAGEKAR escribió:
>>
>> Hi,
>> I am Akshay Ajagekar, currently an undergrad at the Indian Institute of 
>> Technology.
>> I have been exploring Sage for a few weeks now and I would like to 
>> discuss projects I would like to contribute to.
>>
>> Hyperplane Arrangements
>>
>> I have been going through HyperplaneArrangements module in Macaulay2 as 
>> suggested in
>> discussions on this group. I have a pretty good idea on how to extend 
>> this module in Sage.
>> Can someone guide me further ? Also what mathematical should I have to be 
>> eligible for this project, as I have a working
>> knowledge in this subject.
>>
>> Thank you.
>>
>
 I roughly went through 
    1) Hyperplane Arrangement sage 
    2) Hyperplane Arrangement  Macaulay2

then I found those topics has not been covered yet.

(i think orlikSolomon has been implemented. But i could not find the 
documentation )
      1) randomArrangement 
<http://www.math.uiuc.edu/Macaulay2/doc/Macaulay2-1.8.2/share/doc/Macaulay2/HyperplaneArrangements/html/_random__Arrangement.html>
 -- generate an arrangement at random
      2)orlikTerao 
<http://www.math.uiuc.edu/Macaulay2/doc/Macaulay2-1.8.2/share/doc/Macaulay2/HyperplaneArrangements/html/_orlik__Terao.html>
 -- defining ideal for the Orlik-Terao algebra
      3)lct 
<http://www.math.uiuc.edu/Macaulay2/doc/Macaulay2-1.8.2/share/doc/Macaulay2/HyperplaneArrangements/html/_lct.html>
 -- Compute the log-canonical threshold of an arrangement
      4)meet 
<http://www.math.uiuc.edu/Macaulay2/doc/Macaulay2-1.8.2/share/doc/Macaulay2/HyperplaneArrangements/html/_meet.html>
 -- meet operation in intersection lattice
      5)multIdeal 
<http://www.math.uiuc.edu/Macaulay2/doc/Macaulay2-1.8.2/share/doc/Macaulay2/HyperplaneArrangements/html/_mult__Ideal.html>
 -- compute a multiplier ideal

Also i found out there are some funtions havenot implemented yet.
      Ex: restriction(arrangement) has been implemented.
 but no 

   - restriction(Arrangement,Ideal)
   - restriction(Arrangement,RingElement)
   - restriction(Flat)

Also i went through the sage code roughly . It has more than 2500 lines .So 
i could not go through it carefully.(our mid semester exams are going on :( 
)
But after that i'll go through it carefully.
If there are more efficient algorithms than sage in Maculay2 I could find 
it. :-) .


thanks  :-)
Jayamine.

-- 
You received this message because you are subscribed to the Google Groups 
"sage-devel" group.
To unsubscribe from this group and stop receiving emails from it, send an email 
to sage-devel+unsubscr...@googlegroups.com.
To post to this group, send email to sage-devel@googlegroups.com.
Visit this group at https://groups.google.com/group/sage-devel.
For more options, visit https://groups.google.com/d/optout.

Reply via email to