Order bounds for C2-finite sequences
From MaRDI portal
Publication:6081959
DOI10.1145/3597066.3597070arXiv2302.04070OpenAlexW4383213555MaRDI QIDQ6081959
Manuel Kauers, Veronika Pillwein, Philipp Nuspl
Publication date: 3 November 2023
Published in: Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2302.04070
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The concrete tetrahedron. Symbolic sums, recurrence equations, generating functions, asymptotic estimates
- Factoring polynomials and the knapsack problem
- Recurrence relations for graph polynomials on bi-iterative families of graphs
- Invariant factors of products over elementary divisor domains
- Differentiably finite power series
- Factoring polynomials with rational coefficients
- An extension of holonomic sequences: \(C^2\)-finite sequences
- A comparison of algorithms for proving positivity of linearly recurrent sequences
- Characterizing triviality of the exponent lattice of a polynomial through Galois and Galois-like groups
- Minimal representations and algebraic relations for single nested products
- A fast algorithm for computing multiplicative relations between the roots of a generic polynomial
- Gradual sub-lattice reduction and a new complexity for factoring polynomials
- The card guessing game: a generating function approach
- Generalized minimax and interlacing theorems
- Bounds for D-finite closure properties
- Fast Multiple-Precision Evaluation of Elementary Functions
- Deux propriétés décidables des suites récurrentes linéaires
- Decision Problems for Linear Recurrence Sequences
- Algorithmic and Symbolic Combinatorics
- An Effective Framework for Constructing Exponent Lattice Basis of Nonzero Algebraic Numbers
- The Holonomic Toolkit
- A procedure for proving special function inequalities involving a discrete parameter
