search

aelzenaar / bella

New computational package for small-rank matrix groups
BSD 3-Clause "New" or "Revised" License
2 stars 1 forks source link

Integration with sagemath #26

Open aelzenaar opened 1 month ago

aelzenaar commented 1 month ago

I often wish to do computations of the following form:-

  1. Find parameter values for a group such that there exist words satisfying certain trace relations;
  2. Compute the limit set of the resulting group.

See e.g. the example "dunfield_tiozzo".

Part (2) is easy to do in bella, if the generators are available in numerical form. Part (1) requires a computer algebra system such as Sage. However it is nontrivial to plug bella into sage.

We must do the following things, at least (https://doc.sagemath.org/html/en/developer/coding_in_python.html):

  1. Ensure no features newer than Python 3.9 are used
  2. Implement various sage functions like _latex_
  3. Allow for named generators/relations (in progress, f33262c)
  4. Allow arbitrary sage numeric types instead of requiring mpmath.

Part 4 is fairly nontrivial, as since early versions we have fairly strong dependencies on mpmath (e.g. mp.inf is used a lot).

VascoSch92 commented 1 month ago

What do you mean with that: Ensure no features newer than Python 3.9 are used ?

It means that the package will work just for python version <= 3.9 ?

aelzenaar commented 1 month ago

Thanks for your question, it is nice to hear from people who use this package. These are just notes I make to myself, if you currently use a newer version of python than 3.9 that is fine and things will continue to work