Previous | 
Home
Section: Application Domains
Computer Algebra in Mathematics
Our expertise in computer algebra and complexity-driven design of algebraic algorithms has applications in various domains, including:
Overall Objectives
Research Program
Application Domains
New Results
- Becker's conjecture on Mahler functions
- Fast coefficient computation for algebraic power series in positive characteristic
- Subresultants of and , Jacobi polynomials and complexity
- Least common multiple of random integers
- On sequences associated to the invariant theory of rank two simple Lie algebras
- Explicit degree bounds for right factors of linear differential operators
- Improved algorithms for left factorial residues
- A note on gamma triangles and local gamma vectors
- A closed-form formula for the Kullback-Leibler divergence between Cauchy distributions
- Big prime field FFT on multi-core processors
- Martin boundary of killed random walks on isoradial graphs
- Random walks in orthants and lattice path combinatorics
- Quasilinear Average Complexity for Solving Polynomial Systems
- Computing the Volume of Compact Semi-Algebraic Sets
- Densities of Stieltjes moment sequences for pattern-avoiding permutations
Partnerships and Cooperations
Bibliography
Overall Objectives
Research Program
Application Domains
New Results
- Becker's conjecture on Mahler functions
- Fast coefficient computation for algebraic power series in positive characteristic
- Subresultants of and , Jacobi polynomials and complexity
- Least common multiple of random integers
- On sequences associated to the invariant theory of rank two simple Lie algebras
- Explicit degree bounds for right factors of linear differential operators
- Improved algorithms for left factorial residues
- A note on gamma triangles and local gamma vectors
- A closed-form formula for the Kullback-Leibler divergence between Cauchy distributions
- Big prime field FFT on multi-core processors
- Martin boundary of killed random walks on isoradial graphs
- Random walks in orthants and lattice path combinatorics
- Quasilinear Average Complexity for Solving Polynomial Systems
- Computing the Volume of Compact Semi-Algebraic Sets
- Densities of Stieltjes moment sequences for pattern-avoiding permutations
Partnerships and Cooperations
Bibliography