ISSAC

International Symposium on Symbolic and Algebraic Computation

• Home
   
• Program
   
• Registration
   
• Invited Talks
   
• Tutorials
   
• Papers
   
• Short
  Communications
• Software
  Presentations
• Awards
   
• Committees
   
• Submission
  Guidelines
• In Honor
  of V. Gerdt

• About ISSAC
• Past Conferences

Sponsored by:

Software Presentations

The software presentations committee has accepted the 4 software presentations below. Click on the plus symbol to view a paper's abstract.

List of Accepted Software Presentations

• [+] Zoltán Kovács, Tomás Recio and M. Pilar Vélez. Automated reasoning tools in GeoGebra Discovery.
  Abstract:

  We present some current achievements in the software package GeoGebra Discovery that provides several symbolic tools and commands to mechanically discover (and verify symbolically) relationships on planar geometry constructions. Our presentation includes the novel Discover tool and command, the Relation tool and command, and the Compare command. Our proposal successfully makes the cycle ‘conjecturing-checking-proving’ in elementary geometry even more accessible for general users, focusing not only on educational uses but research as well.

• [+] Alexandre Goyer. A Sage Package for the Symbolic-Numeric Factorization of Linear Differential Operators.
  Abstract:

  We present an implementation in the SageMath system of the symbolic-numeric algorithm introduced by van der Hoeven in 2007 for factoring linear differential operators whose coefficients are rational functions.

• [+] Ilia Ilmer, Alexey Ovchinnikov and Gleb Pogudin. Maple Application for Structural Identifiability Analysis of ODE models.
  Abstract:

  Structural identifiability properties of models of ordinary differential equations help one assess if the parameter's value can be recovered from experimental data. This theoretical property can be queried without the need for data collection and is determined with help of differential algebraic tools. We present a web-based Structural Identifiability Toolbox that rigorously uncovers identifiability properties of individual parameters of ODE systems as well as their functions (also called identifiable combinations) using the apparatus of differential algebra. The application requires no installation and is readily available at https://maple.cloud/app/6509768948056064/.

• [+] Philippe Elbaz-Vincent and Etienne Marcatel. An extension of the fpLLL library to Hermitian lattices.
  Abstract:

  We present an hermitian version of the classical floating-point LLL reduction algorithm of Nguyen and Stehlé. This new variant works on imaginary quadratic fields which are norm-Euclidean and also for some adequate cyclotomic fields. An optimized C++ implementation has been performed, based on the fpLLL code and results show a significant improvement for hermitan lattices reduction of dimension N when compared to fpLLL reduction on the corresponding euclidean lattice of dimension 2N. We demonstrate our implementation in the special case of the Gaussian integers.