The octahedron recurrence lives on a 3-dimensional lattice and is given by f(x,y,t+1)=(f(x+1,y,t)f(x−1,y,t)+f(x,y+1,t)f(x,y−1,t))/f(x,y,t−1) . In this paper, we investigate a variant of this recurrence which lives in a lattice contained in [0,m]×[0,n]×R . Following Speyer, we give an explicit non-recursive formula for the values of this recurrence and use it to prove that it is periodic of period n+m. We then proceed to show various other hidden symmetries satisfied by this bounded octahedron recurrence.</p
We consider the set Γn of all period sets of strings of length n over a finite alphabet. We show tha...
In this note, we provide a short proof for the explicit formulas of the coefficients of a particular...
AbstractWe consider the set Γn of all period sets of strings of length n over a finite alphabet. We ...
The goals of this paper are two-fold. First, we prove, for an arbitrary finite root system Φ, the pe...
We introduce a recurrence which we term the multidimensional cube recurrence, generalizing the octah...
Artículo de publicación ISIRecurrence properties of systems and associated sets of integers that suf...
AbstractWe introduce a recurrence which we term the multidimensional cube recurrence, generalizing t...
RésuméLetAhbe a sequence of rational numbers, satisfying a linear recurrence with polynomial coeffic...
Abstract. Let m, r ∈ N. We will show, that the recurrent sequences xn = xn r n−1 + 1 (mod g), xn = x...
In the upcoming chapter we introduce recurrence relations. These are equations that define in recurs...
We prove an explicit expression for the solutions of the discrete Schwarzian octahedron recurrence, ...
Abstract. This paper studies the iterates of the third order Lyness’ recurrence xk+3 = (a+ xk+1 + xk...
Abstract Zamolodchikov periodicity is a property of T- and Y-systems, arising in the ...
summary:We study recurrence and non-recurrence sets for dynamical systems on compact spaces, in part...
AbstractIn 1965, Fine and Wilf proved the following theorem: if (fn)n⩾0 and (gn)n⩾0 are periodic seq...
We consider the set Γn of all period sets of strings of length n over a finite alphabet. We show tha...
In this note, we provide a short proof for the explicit formulas of the coefficients of a particular...
AbstractWe consider the set Γn of all period sets of strings of length n over a finite alphabet. We ...
The goals of this paper are two-fold. First, we prove, for an arbitrary finite root system Φ, the pe...
We introduce a recurrence which we term the multidimensional cube recurrence, generalizing the octah...
Artículo de publicación ISIRecurrence properties of systems and associated sets of integers that suf...
AbstractWe introduce a recurrence which we term the multidimensional cube recurrence, generalizing t...
RésuméLetAhbe a sequence of rational numbers, satisfying a linear recurrence with polynomial coeffic...
Abstract. Let m, r ∈ N. We will show, that the recurrent sequences xn = xn r n−1 + 1 (mod g), xn = x...
In the upcoming chapter we introduce recurrence relations. These are equations that define in recurs...
We prove an explicit expression for the solutions of the discrete Schwarzian octahedron recurrence, ...
Abstract. This paper studies the iterates of the third order Lyness’ recurrence xk+3 = (a+ xk+1 + xk...
Abstract Zamolodchikov periodicity is a property of T- and Y-systems, arising in the ...
summary:We study recurrence and non-recurrence sets for dynamical systems on compact spaces, in part...
AbstractIn 1965, Fine and Wilf proved the following theorem: if (fn)n⩾0 and (gn)n⩾0 are periodic seq...
We consider the set Γn of all period sets of strings of length n over a finite alphabet. We show tha...
In this note, we provide a short proof for the explicit formulas of the coefficients of a particular...
AbstractWe consider the set Γn of all period sets of strings of length n over a finite alphabet. We ...