Recurrence relation with Hadamard Product

I've been drawn to a problem that requires ascertaining the existence of fixed points in the following recurrence relation, any ideas would be much appreciated. I seek neccessary conditions on $A,B$ such that a fixed point exists.

For $A,B \in \{0,1\}^{mn}$ and $U,L,R,D$, the permutation matrices that shift rows up, left, right, and down respectively (rows and columns both cycling), i.e. $[UA]_{1j} = [A]_{mj}$ etc;

and $\circ_{i=0}^{k}A = A\circ A\circ A ...$, where $\circ$ denotes the hadamard product, excuse the awful notation.

$A_{n+1} = UA_n + (I-U)A_n\circ\sum_{i=1}^{m}\circ_{k=1}^{i}(D^kB_n)$

$B_{n+1} = RB_n + (I-R)B_n\circ\sum_{i=1}^{m}\circ_{k=1}^{i}(L^kA_n)$

edited Sep 11 2011 at 0:08

asked Sep 10 2011 at 13:03

Paolo
1●1

I've taken the liberty of fixing the TeX so it displays properly. – Joe Silverman Sep 10 2011 at 15:06

I see a system relating powers of $A$ and $B$ to lower powers of $A$ and $B$, but I don't see a recurrence relation. Do you mean for those exponents to be subscripts? – Gerry Myerson Sep 10 2011 at 23:50

Indeed n is the iteration index, – Paolo Sep 11 2011 at 0:10