We have the following recurrence relation: \begin{equation} f(n,m) = f(n-1,m) g_{\alpha, \gamma}(n,m) + f(n,m-1) g_{\beta, \gamma}(n,m) \\ g_{\alpha, \gamma}(n,m)= \sum^{n}_{i = 0} \sum^{m}_{j = 0} \tbinom{i+j}{j} \tbinom{n-i+m-j}{m-j} \alpha^i \gamma^j \end{equation}
With the boundary conditions: \begin{equation} f(n,0) = \prod_{i=1}^n \frac{1-\alpha^i}{1-\alpha}, \ \ \ \ \ f(0,m) = \prod_{i=1}^n \frac{1-\beta^i}{1-\beta} \end{equation}
Is it possible to find the explicit solution for $f(n,m)$? If not, can we find the ratio $\frac{f(n+1,m)}{f(n,m)}$? If it still doesn't work, to what extent can we make this problem a solvable one? for example, let $\alpha = \beta$ or some other modifications.
Currently, the best I can do is in the $\alpha = \beta = \gamma$ limit, we can have: $$ f(n,m) = 2^{n+m} \prod^{n+m}_{i=1} \frac{1-\gamma^i}{1-\gamma}$$
in the $\alpha = \beta$ limit, we can have: $$ f(n,m) = 2^{n+m} \prod_{j=0}^{m} \prod_{i=0}^{n} g_{\alpha, \gamma}(i,j) $$
p.s. this problem maybe somehow related to this one: How to solve recurrence relation with 2 variables?