On an extension of a recurrent relation from combinatorics

DOI10.14232/EJQTDE.2017.1.84zbMATH Open1413.39014OpenAlexW2783735704MaRDI QIDQ4584563FDOQ4584563

Authors: Stevo Stević 

Publication date: 3 September 2018

Published in: Electronic Journal of Qualitative Theory of Differential Equations (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.14232/ejqtde.2017.1.84

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

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 relationf_n(t)=a_n(t) f_n−1(t)−b_n(t)(∂/∂t) f_n−1(t</i
• Recurrence relation with two indices and plane compositions

zbMATH Keywords

boundary-value problempartial difference equationmethod of half-linescombinatorial domain

Mathematics Subject Classification ID

Additive difference equations (39A10) Difference equations in the complex domain (39A45) Applications of difference equations (39A60) Partial difference equations (39A14)

Cited In (16)

• The combinatorialization of linear recurrences
• An extension of the exponential formula in enumerative combinatorics
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• Note on the binomial partial difference equation
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• 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)