21 citations
- Centre National de la Recherche ScientifiqueFR6 papers
- Laboratoire de l'Informatique du ParallélismeFR5 papers
- Institut national de recherche en sciences et technologies du numériqueFR4 papers
- École Normale Supérieure de LyonFR3 papers
- Laboratoire Jean KuntzmannFR3 papers
- Université de LyonFR3 papers
- Université Grenoble AlpesFR3 papers
- Lyon 1 UniversitéFR2 papers
- Simon Fraser UniversityCA2 papers
- University of WaterlooCA2 papers
- CARAMBA: Cryptology, arithmetic : algebraic methods for better algorithmsFR1 paper
- Centre Inria de l'Université Grenoble AlpesFR1 paper
7 papers
Effective Coefficient Asymptotics of Multivariate Rational Functions via Semi-Numerical Algorithms for Polynomial Systems
Stephen Melczer, Bruno Salvy
The coefficient sequences of multivariate rational functions appear in many areas of combinatorics. Their diagonal coefficient sequences enjoy nice arithmetic and asymptotic proper…
Time and space efficient generators for quasiseparable matrices
Clement Pernet, Arne Storjohann
The class of quasiseparable matrices is defined by the property that any submatrix entirely below or above the main diagonal has small rank, namely below a bound called the order o…
Efficient Solution of Parameter Dependent Quasiseparable Systems and Computation of Meromorphic Matrix Functions
Paola Boito, Yuli Eidelman, Luca Gemignani
In this paper we focus on the solution of shifted quasiseparable systems and of more general parameter dependent matrix equations with quasiseparable representations. We propose an…
Weighted Lattice Walks and Universality Classes
Julien Courtiel, Stephen Melczer, Marni Mishna +1
In this work we consider two different aspects of weighted walks in cones. To begin we examine a particular weighted model, known as the Gouyou-Beauchamps model. Using the theory o…
Absolute real root separation
Yann Bugeaud, Andrej Dujella, Tomislav Pejkovic +1
While the separation (the minimal nonzero distance) between roots of a polynomial is a classical topic, its absolute counterpart (the minimal nonzero distance between their absolut…
Linear Time Interactive Certificates for the Minimal Polynomial and the Determinant of a Sparse Matrix
Jean-Guillaume Dumas, Erich Kaltofen, Emmanuel Thomé +1
Computational problem certificates are additional data structures for each output, which can be used by a-possibly randomized-verification algorithm that proves the correctness of…