A Comparison of Algorithms for Proving Positivity of Linearly Recurrent Sequences

Philipp Nuspl; Veronika Pillwein

doi:10.1007/978-3-031-14788-3_15

A Comparison of Algorithms for Proving Positivity of Linearly Recurrent Sequences

Research Institute for Symbolic Computation

Research output: Chapter in Book/Report/Conference proceeding › Conference proceedings › peer-review

Original language	English
Title of host publication	Computer Algebra in Scientific Computing - 24th International Workshop, CASC 2022, Proceedings
Editors	François Boulier, Matthew England, Timur M. Sadykov, Evgenii V. Vorozhtsov
Publisher	Springer International Publishing
Pages	268-287
Number of pages	20
Volume	13366
ISBN (Print)	9783031147876
DOIs	https://doi.org/10.1007/978-3-031-14788-3_15
Publication status	Published - 2022

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	13366 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Fields of science

101 Mathematics
101001 Algebra
101005 Computer algebra
101009 Geometry
101012 Combinatorics
101013 Mathematical logic
101020 Technical mathematics

JKU Focus areas

Digital Transformation

Access to Document

10.1007/978-3-031-14788-3_15

Cite this

Nuspl, P., & Pillwein, V. (2022). A Comparison of Algorithms for Proving Positivity of Linearly Recurrent Sequences. In F. Boulier, M. England, T. M. Sadykov, & E. V. Vorozhtsov (Eds.), Computer Algebra in Scientific Computing - 24th International Workshop, CASC 2022, Proceedings (Vol. 13366, pp. 268-287). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 13366 LNCS). Springer International Publishing. https://doi.org/10.1007/978-3-031-14788-3_15

Nuspl, Philipp ; Pillwein, Veronika. / A Comparison of Algorithms for Proving Positivity of Linearly Recurrent Sequences. Computer Algebra in Scientific Computing - 24th International Workshop, CASC 2022, Proceedings. editor / François Boulier ; Matthew England ; Timur M. Sadykov ; Evgenii V. Vorozhtsov. Vol. 13366 Springer International Publishing, 2022. pp. 268-287 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{04395737842041a1a987df3ea0d770ec,

title = "A Comparison of Algorithms for Proving Positivity of Linearly Recurrent Sequences",

author = "Philipp Nuspl and Veronika Pillwein",

year = "2022",

doi = "10.1007/978-3-031-14788-3\_15",

language = "English",

isbn = "9783031147876",

volume = "13366",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer International Publishing",

pages = "268--287",

editor = "Fran{\c c}ois Boulier and Matthew England and Sadykov, \{Timur M.\} and Vorozhtsov, \{Evgenii V.\}",

booktitle = "Computer Algebra in Scientific Computing - 24th International Workshop, CASC 2022, Proceedings",

}

Nuspl, P & Pillwein, V 2022, A Comparison of Algorithms for Proving Positivity of Linearly Recurrent Sequences. in F Boulier, M England, TM Sadykov & EV Vorozhtsov (eds), Computer Algebra in Scientific Computing - 24th International Workshop, CASC 2022, Proceedings. vol. 13366, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 13366 LNCS, Springer International Publishing, pp. 268-287. https://doi.org/10.1007/978-3-031-14788-3_15

A Comparison of Algorithms for Proving Positivity of Linearly Recurrent Sequences. / Nuspl, Philipp; Pillwein, Veronika.
Computer Algebra in Scientific Computing - 24th International Workshop, CASC 2022, Proceedings. ed. / François Boulier; Matthew England; Timur M. Sadykov; Evgenii V. Vorozhtsov. Vol. 13366 Springer International Publishing, 2022. p. 268-287 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 13366 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference proceedings › peer-review

TY - GEN

T1 - A Comparison of Algorithms for Proving Positivity of Linearly Recurrent Sequences

AU - Nuspl, Philipp

AU - Pillwein, Veronika

PY - 2022

Y1 - 2022

UR - https://www.scopus.com/pages/publications/85136966545

U2 - 10.1007/978-3-031-14788-3_15

DO - 10.1007/978-3-031-14788-3_15

M3 - Conference proceedings

SN - 9783031147876

VL - 13366

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 268

EP - 287

BT - Computer Algebra in Scientific Computing - 24th International Workshop, CASC 2022, Proceedings

A2 - Boulier, François

A2 - England, Matthew

A2 - Sadykov, Timur M.

A2 - Vorozhtsov, Evgenii V.

PB - Springer International Publishing

ER -

Nuspl P, Pillwein V. A Comparison of Algorithms for Proving Positivity of Linearly Recurrent Sequences. In Boulier F, England M, Sadykov TM, Vorozhtsov EV, editors, Computer Algebra in Scientific Computing - 24th International Workshop, CASC 2022, Proceedings. Vol. 13366. Springer International Publishing. 2022. p. 268-287. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-031-14788-3_15

A Comparison of Algorithms for Proving Positivity of Linearly Recurrent Sequences

Publication series

Fields of science

JKU Focus areas

Access to Document

Other files and links

Cite this