On an extension of a recurrent relation from combinatorics
From MaRDI portal
Publication:4584563
Recommendations
- Solvability of boundary value problems for a class of partial difference equations on the combinatorial domain
- Solvability of boundary-value problems for a linear partial difference equation
- Note on the binomial partial difference equation
- The solution of the recurrence relationfn(t)=an(t) fn−1(t)−bn(t)(∂/∂t) fn−1(t</i
- Recurrence relation with two indices and plane compositions
Cited in
(16)- The combinatorialization of linear recurrences
- An extension of the exponential formula in enumerative combinatorics
- scientific article; zbMATH DE number 5904291 (Why is no real title available?)
- Recurrence relation with two indices and plane compositions
- Recurrence relations for patterns of type (2,1) in flattened permutations
- On a generalization of the recurrence defining the number of derangements
- scientific article; zbMATH DE number 1446754 (Why is no real title available?)
- Note on the binomial partial difference equation
- scientific article; zbMATH DE number 2186896 (Why is no real title available?)
- Asymptotic behavior of the solutions of a partial differential equation with piecewise constant argument
- On the existence of n but not n + 1 easy combinators
- scientific article; zbMATH DE number 1303203 (Why is no real title available?)
- On a solvable symmetric and a cyclic system of partial difference equations
- A generalization of Pincherle's theorem to \(k\)-term recursion relations
- On the relation between continuous and combinatorial
- Recursively defined combinatorial functions: Extending Galton's board
This page was built for publication: On an extension of a recurrent relation from combinatorics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4584563)