Pages that link to "Item:Q2517807"
From MaRDI portal
The following pages link to Computing the algebraic relations of \(C\)-finite sequences and multisequences (Q2517807):
Displaying 23 items.
- Solving difference equations whose coefficients are not transcendental (Q935167) (← links)
- Summation theory. II: Characterizations of \(R {\Pi}{\Sigma}^{\ast}\)-extensions and algorithmic aspects (Q1711991) (← links)
- On \(n\)-dimensional sequences. I (Q1911404) (← links)
- Construction of all polynomial relations among Dedekind eta functions of level \(N\) (Q2000261) (← links)
- An extension of holonomic sequences: \(C^2\)-finite sequences (Q2100068) (← links)
- Minimal representations and algebraic relations for single nested products (Q2217201) (← links)
- A fast algorithm for computing multiplicative relations between the roots of a generic polynomial (Q2229723) (← links)
- Sums of products of generalized Fibonacci and Lucas numbers (Q2341929) (← links)
- The \(C\)-finite ansatz (Q2376847) (← links)
- Lonely points in simplices (Q2679594) (← links)
- Degree and Dimension Estimates for Invariant Ideals of $$P$$ -Solvable Recurrences (Q2799570) (← links)
- AN EFFICIENT ALGORITHM FOR DERIVING SUMMATION IDENTITIES FROM MUTUAL RECURRENCES (Q3166727) (← links)
- Aligator: A Mathematica Package for Invariant Generation (System Description) (Q3541707) (← links)
- (Q3585215) (← links)
- On the computation of the Galois group of linear difference equations (Q4600717) (← links)
- Term Algebras, Canonical Representations and Difference Ring Theory for Symbolic Summation (Q5022185) (← links)
- Toric varieties from cyclic matrix semigroups (Q5087779) (← links)
- Simplifying Multiple Sums in Difference Fields (Q5244928) (← links)
- Reasoning Algebraically About P-Solvable Loops (Q5458331) (← links)
- The SAGEX review on scattering amplitudes Chapter 4: Multi-loop Feynman integrals (Q5878296) (← links)
- Representation of hypergeometric products of higher nesting depths in difference rings (Q6115788) (← links)
- Symbolic computation in automated program reasoning (Q6174522) (← links)
- Computing the binomial part of a polynomial ideal (Q6192534) (← links)
