Zobrazeno 1 - 10
of 19
pro vyhledávání: '"Nuspl, Philipp"'
A sequence is called $C$-finite if it satisfies a linear recurrence with constant coefficients. We study sequences which satisfy a linear recurrence with $C$-finite coefficients. Recently, it was shown that such $C^2$-finite sequences satisfy similar
Externí odkaz:
http://arxiv.org/abs/2302.04070
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
A sequence is called $C$-finite if it satisfies a linear recurrence with constant coefficients. We study sequences which satisfy a linear recurrence with $C$-finite coefficients. Recently, it was shown that such $C^2$-finite sequences satisfy similar
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______3361::ef4a24ac35cdd3877a20db65c6794d20
https://epub.jku.at/doi/10.35011/risc.23-03
https://epub.jku.at/doi/10.35011/risc.23-03
Autor:
Nuspl, Philipp
In the past few decades, numerous tools for automatically discovering and proving identities involving sequences and special functions were developed. These tools are often based on algorithms which manipulate sequences satisfying linear recurrences.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______3361::f33b2be34197b1f7b2622f72acd2a9fc
Autor:
Nuspl, Philipp
RISC Report Series, 22-06
We present the SageMath package rec_sequences which provides methods to compute with sequences satisfying linear recurrences. The package can be used to show inequalities of $C$-finite sequences, i.e., sequences satisfy
We present the SageMath package rec_sequences which provides methods to compute with sequences satisfying linear recurrences. The package can be used to show inequalities of $C$-finite sequences, i.e., sequences satisfy
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f34ae978c3cb6ea6b700b40bb4897efd
Autor:
Nuspl, Philipp, Pillwein, Veronika
Deciding positivity for recursively defined sequences based on only the recursive description as input is usually a non-trivial task. Even in the case of $C$-finite sequences, i.e., sequences satisfying a linear recurrence with constant coefficients,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______3361::e87243c91ca4127629b2e4ec4b19e5ad
https://epub.jku.at/doi/10.35011/risc.22-05
https://epub.jku.at/doi/10.35011/risc.22-05
Autor:
Nuspl, Philipp, Pillwein, Veronika
The class of $C^2$-finite sequences is a natural generalization of holonomic sequences and consists of sequences satisfying a linear recurrence with C-finite coefficients, i.e., coefficients satisfying a linear recurrence with constant coefficients t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______3361::afc21283b2b62d7f7bdafdde26c586f6
https://epub.jku.at/doi/10.35011/risc.22-02
https://epub.jku.at/doi/10.35011/risc.22-02
Holonomic sequences are widely studied as many objects interesting to mathematicians and computer scientists are in this class. In the univariate case, these are the sequences satisfying linear recurrences with polynomial coefficients and also referr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______3361::c07410988b1af50f08cb1ae62a9e2571
https://epub.jku.at/doi/10.35011/risc.21-20
https://epub.jku.at/doi/10.35011/risc.21-20
Autor:
Nuspl, Philipp
We investigate the complexity of solving systems of polynomial equations over finite groups. In 1999 Goldmann and Russell showed NP-completeness of this problem for non-Abelian groups. We show that the problem can become tractable for some non-Abelia
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______3361::ddfbdef1f51afd34d89cdc33773afafc
https://epub.jku.at/doi/10.1007/s00012-020-00701-6
https://epub.jku.at/doi/10.1007/s00012-020-00701-6
Holonomic sequences are widely studied as many objects interesting to mathematicians and computer scientists are in this class. In the univariate case, these are the sequences satisfying linear recurrences with polynomial coefficients and also referr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4e64f204e11da4d9a9185286d12f83ce