The recurrences tag has no wiki summary.

**6**

votes

**0**answers

130 views

### Degenerate linear recurrence sequences

Let $(u_n)_{n \geq 0}$ be a linear recurrence given by
$$u_n = a_1 u_{n-1} + \cdots + a_k u_{n-k} \quad \forall n \geq k ,$$
where $u_0, \ldots, u_{k-1}, a_1, \ldots, a_k \in \mathbb{Z}$. We recall ...

**5**

votes

**0**answers

147 views

### Non-crystallographic cluster algebras

Background
Fomin and Zelevinsky have introduced cluster algebras in an influential article. To define a cluster algebra, Fomin and Zelevinsky have defined a mutation of seeds. Here, a seed ...

**3**

votes

**0**answers

109 views

### ``Occasional'' Laurent phenomenon

This question is motivated by Richard Stanley's A question on the Laurent phenomenon (motivated by his answer to the question what is the probability that a scissor became the champion?).
He asked ...

**3**

votes

**0**answers

182 views

### Arithmetical properties of certain recurrence relations

Consider the following recurrence relation:
$$(4i+6j+1)(2i+3j)a_{i,j}=3j a_{i+1,j-1}-2i a_{i-1,j}+32i(i-1) a_{i-2,j+1}, i\ge0, j\ge0,$$
$$a_{0,0}=1.$$
This equation appeared in the article ...

**2**

votes

**0**answers

157 views

### Master theorem for probabilistically inspired recurrences

Is there a general solution for multi-variable recurrences of the following form which come from Markov chain analysis?
$f(i,j,k) = p_1 f(i-1, j,k) + p_2 f(i, j-1,k) + p_3 f(i,j,k-1) + p_4 ...

**2**

votes

**0**answers

95 views

### Perturbation analysis for three term recurrences

Jacobi polynomials, denoted by $J^{(\alpha,\beta)}_n$, on $[-1,1]$ satisfy a three term recurrence
$$ J_{n+1}^{(\alpha,\beta)}(x) = (A_n+B_nx)J^{(\alpha,\beta)}_n + C_nJ_{n-1}^{(\alpha,\beta)}(x), ...

**2**

votes

**0**answers

162 views

### Partitions of central sets via dynamical systems

In the book "Recurrence in Ergodic Theory and Combinatorial Number Theory", 1981, Furstenberg introduced the notion of central sets.
He proved in Theorem 8.8 that in each finite partition of ...

**1**

vote

**0**answers

84 views

### Number of digits in $n$-th term of generalized Fibonacci/Narayana sequence

Let $d$ be a nonnegative integer, and let the sequence ${F_d(n)}$ be defined as follows:
$F_d(n) = 1$ for $n = 0, 1, \ldots, d$
$F_d(n) = F_d(n-1) + F_d(n-1-d)$ for $n>d$
For $d=0$ the sequence ...

**1**

vote

**0**answers

92 views

### Definition of primitive divisor of a Lucas sequence

If $\{a_n\}_{n=1}^\infty$ is a sequence of integers, then the definition of primitive divisor of one of its terms is quite natural:
Def. 1. A prime number $p$ is a primitive divisor of $a_n$ if $p ...

**1**

vote

**0**answers

131 views

### Solving a recurrence (with the form of a convolution) involving binomial coefficients

While dealing with a problem related to intersection of hyperplanes I have come across the following recurrence to obtain the values of $K_{j}$
\begin{array}{cccccccccc}
1 & = & ...

**1**

vote

**0**answers

90 views

### Convergence and summation of power towers or Ackermann functions

I deleted this at StackExchange as it seems advanced or not very relevant for there and I want to ask here.
Let z be a complex number, $Im(z)\neq 0$ or $Re(z)<4$, m be a natural number, let ...

**1**

vote

**0**answers

99 views

### Trying to get an idea of the maths I could use for this optimization problem

Firstly, apologies if some of the notation or terminology is odd, or if I am defining functions that have standard notation associated with them already - I am not familiar with the concepts in this ...

**0**

votes

**0**answers

7 views

### Solving the difference equation $h(\vec x)\cdot A(\vec x)=\sum_{i=1}^m A(\vec x - \vec e_i)$

I am trying to solve the following difference equation:
$$h(x_1,x_2,x_3,x_4) \cdot A(x_1,x_2,x_3,x_4)=A(x_1-1,x_2,x_3,x_4)+A(x_1,x_2-1,x_3,x_4)+A(x_1,x_2,x_3-1,x_4)+A(x_1,x_2,x_3,x_4-1)$$
Or more ...

**0**

votes

**0**answers

28 views

### Multivariate recurrence relation

consider the recurrence relation
\begin{equation}
\mathbb{I}(m<M)[- k_{\rm on} c_{m,n} + (m+1) k_{\rm off} c_{m+1,n}] + \mathbb{I}(m>0)[-k_{\rm off} m \, c_{m,n} + k_{\rm on} c_{m-1,n} ] + ...

**0**

votes

**0**answers

46 views

### Finding a stochastic differential equation as limit of a discrete stochastic equation

I'm dealing with the following problem:
Choose $Z_0 \in [0,1]$ and define a process governed by the following discrete stochastic equation:
$Z_{k+1}-Z_k=P_k(1-2Z_k)$
where $P_k=0$ with probability ...

**0**

votes

**0**answers

97 views

### Help solving a recurrence relation

For solving a related probability problem, I need to solve the following recurrence relation:-
$q(r,b,L)=\frac{b}{r+b}q(r,b-1,L)+\sum_{k=1}^{L}\frac{r}{r+b}\times\cdots \times ...

**0**

votes

**0**answers

66 views

### For which recurrence relations is it decidable whether a formal power series has a maximal zero coefficient?

In this MSE question, I asked whether one can prove that a generating function has infinitely many coefficients equal to zero. The answer given (and accepted) to that rather broad question was “No”.
...

**0**

votes

**0**answers

43 views

### A question on bivariate recurrence

Is there a way to get a closed form of this recurrence (albeit approximate):
$$A(n ,k ) = {1 \over {d^k}}A(n-1, k-1) + (1 - {1 \over {d^k}})A(n-1,k)$$
Where, $n,k \ge 0$ and $d \ge 2$ are integers. ...

**0**

votes

**0**answers

73 views

### Approximate closed-form solution for a recurrence

Find an (approximate) closed-form solution for $S(m, b)$.
$$S(m,b)=\sum_{i=0}^{\lfloor (e-1)/2\rfloor}{e \choose i}S(m-1, b-i) \quad +
\sum_{i=\lfloor (e-1)/2\rfloor+1}^{\min(b,e)}{e\choose ...