Results 211 to 220 of about 127,838 (259)
Some of the next articles are maybe not open access.
A Recurrence Related to the Bell Numbers
Integers, 2012Abstract.In this paper, we solve a general, four-parameter recurrence by both algebraic and combinatorial methods. The Bell numbers and some closely related sequences are solutions to the recurrence corresponding to particular choices of the parameters.
Toufik Mansour, Mark Shattuck 0001
openaire +2 more sources
2016
In the upcoming chapter we introduce recurrence relations. These are equations that define in recursive fashion, via suitable functions, the terms appearing in a real or complex sequence. The first section deals with some well-known examples that show how these relations may arise in real life, e.g., the Lucas Tower game problem or the death or life ...
Mariconda C., Tonolo A.
openaire +2 more sources
In the upcoming chapter we introduce recurrence relations. These are equations that define in recursive fashion, via suitable functions, the terms appearing in a real or complex sequence. The first section deals with some well-known examples that show how these relations may arise in real life, e.g., the Lucas Tower game problem or the death or life ...
Mariconda C., Tonolo A.
openaire +2 more sources
Probabilistic recurrence relations
Proceedings of the twenty-third annual ACM symposium on Theory of computing - STOC '91, 1991Summary: This paper is concerned with recurrence relations that arise frequently in the analysis of divide-and-conquer algorithms. In order to solve a problem instance of size \(x\), such an algorithm invests an amount of work \(a(x)\) to break the problem into subproblems of sizes \(h_1(x),h_2(x),\dots, h_k(x)\), and then proceeds to solve the ...
openaire +1 more source
Algorithmica, 1996
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Perturbed Recurrence Relations
Numerical Algorithms, 2003The authors give some new relations between two families of polynomials defined by a three-term recurrence relation. They give a new method to study the behaviour of such polynomials. This method allows to solve the problem of losing information in the case of large perturbations since it gives the explicit representation of a perturbed family of ...
openaire +1 more source
2016
In the following chapter we address the techniques for the resolution of some celebrated recurrence relations. We will discuss in detail the linear recurrences with constant coefficients. Our emphasis goes to the application of the theory: the proofs, though elementary, are relegated to the end of the chapter.
Mariconda C., Tonolo A.
openaire +1 more source
In the following chapter we address the techniques for the resolution of some celebrated recurrence relations. We will discuss in detail the linear recurrences with constant coefficients. Our emphasis goes to the application of the theory: the proofs, though elementary, are relegated to the end of the chapter.
Mariconda C., Tonolo A.
openaire +1 more source
Proceedings of the Edinburgh Mathematical Society, 1938
It is proposed here to consider the sequence un determined by the relationwhere, in particular,and initially u1 = θ1. The following is the main result to be proved.
openaire +1 more source
It is proposed here to consider the sequence un determined by the relationwhere, in particular,and initially u1 = θ1. The following is the main result to be proved.
openaire +1 more source
Recurrence relation associated with the sums of square binomial coefficients
Quaestiones Mathematicae, 2021Hacène Belbachir, Abdelghani Mehdaoui
exaly
Local Cancer Recurrence: The Realities, Challenges, and Opportunities for New Therapies
Ca-A Cancer Journal for Clinicians, 2018David A Mahvi +2 more
exaly