Pages that link to "Item:Q3387097"
From MaRDI portal
The following pages link to Algorithmic Combinatorics: Enumerative Combinatorics, Special Functions and Computer Algebra (Q3387097):
Displayed 18 items.
- When the Search for Solutions Can Be Terminated (Q3387098) (← links)
- Euler’s Partition Theorem and Refinements Without Appeal to Infinite Products (Q3387099) (← links)
- Sequences in Partitions, Double q-Series and the Mock Theta Function ρ3(q) (Q3387100) (← links)
- Refined q-Trinomial Coefficients and Two Infinite Hierarchies of q-Series Identities (Q3387101) (← links)
- Large Scale Analytic Calculations in Quantum Field Theories (Q3387102) (← links)
- An Eigenvalue Problem for the Associated Askey–Wilson Polynomials (Q3387103) (← links)
- Context-Free Grammars and Stable Multivariate Polynomials over Stirling Permutations (Q3387104) (← links)
- An Interesting Class of Hankel Determinants (Q3387106) (← links)
- A Sequence of Polynomials Generated by a Kapteyn Series of the Second Kind (Q3387107) (← links)
- Comparative Analysis of Random Generators (Q3387110) (← links)
- Difference Equation Theory Meets Mathematical Finance (Q3387111) (← links)
- Evaluations as L-Subsets (Q3387112) (← links)
- Exact Lower Bounds for Monochromatic Schur Triples and Generalizations (Q3387113) (← links)
- Evaluation of Binomial Double Sums Involving Absolute Values (Q3387114) (← links)
- On Two Subclasses of Motzkin Paths and Their Relation to Ternary Trees (Q3387115) (← links)
- A Theorem to Reduce Certain Modular Form Relations Modulo Primes (Q3387116) (← links)
- Trying to Solve a Linear System for Strict Partitions in ‘Closed Form’ (Q3387117) (← links)
- Untying the Gordian Knot via Experimental Mathematics (Q3387118) (← links)