On the complexity of integer polynomial recursive sequences
Background. Linear recursive sequences represent the “classic'” object of combinatorial analysis. To express an arbitrary term of a linear recursive sequence, there are exact formulas of exponential type as in the case of a field of complex numbers, and in the case of a finite Galois field....
| Главный автор: | |
|---|---|
| Формат: | Статья |
| Язык: | English |
| Опубликовано: |
Penza State University Publishing House
2022-10-01
|
| Серии: | Известия высших учебных заведений. Поволжский регион: Физико-математические науки |
| Предметы: |