most citedOverlap-free words and spectra of matrices

1 citations · 2 across the 2 of their papers we have counts for

collaborators
Showing math.DSShow all

1 paper · 1 filter

math.DS2008★ 1 cited

The Continuous Skolem-Pisot Problem: On the Complexity of Reachability for Linear Ordinary Differential Equations

Paul Bell, Jean-Charles Delvenne, Raphael Jungers +1

We study decidability and complexity questions related to a continuous analogue of the Skolem-Pisot problem concerning the zeros and nonnegativity of a linear recurrent sequence. I…