scientific article; zbMATH DE number 7788988
From MaRDI portal
Publication:6137833
arXiv2109.14432MaRDI QIDQ6137833
Publication date: 16 January 2024
Full work available at URL: https://arxiv.org/abs/2109.14432
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Periods and the conjectures of Grothendieck and Kontsevich-Zagier
- On the positivity set of a linear recurrence sequence
- Occurrence of zero in a linear recursive sequence
- On the computational complexity and geometry of the first-order theory of the reals. I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals
- Almost periodic sequences.
- The presence of a zero in an integer linear recurrent sequence is NP-hard to decide
- A note on recurring series
- Deux propriétés décidables des suites récurrentes linéaires
- Multiplicative relations in number fields
- Automatic Sequences
- Ultimate Positivity is Decidable for Simple Linear Recurrence Sequences
- A simple but exact and efficient algorithm for complex root isolation
- Positivity Problems for Low-Order Linear Recurrence Sequences
- Algorithms in real algebraic geometry
This page was built for publication: