Computing the N-th term of a q-holonomic sequence

DOI10.1145/3373207.3404060OpenAlexW3039374909MaRDI QIDQ5145953

Alin Bostan

Publication date: 22 January 2021

Published in: Proceedings of the 45th International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2012.08656

zbMATH Keywords

complexityalgorithms\(q\)-factorial\(q\)-holonomic sequences

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Related Items (3)

A fast algorithm for computing the number of magic series ⋮ Fast computation of the \(N\)-th term of a \(q\)-holonomic sequence and applications ⋮ Fast norm computation in smooth-degree abelian number fields

This page was built for publication: Computing the N-th term of a q-holonomic sequence