In the present paper we study recurrence equations over k-ary trees. Namely, each equation is assigned to a vertex of the tree, and they are generated by contractive functions defined on an arbitrary non-Archimedean algebra. The main result of this paper states that the given equations have at most one solution. Moreover, we also provide the existence of unique solution of the equations. We should stress that the non-Archimedeanity of the algebra is essentially used, therefore, the methods applied in the present paper are not valid in the Archimedean setting.
|Number of pages||8|
|Journal||P-Adic Numbers, Ultrametric Analysis, and Applications|
|Publication status||Published - Oct 1 2014|
- non-Archimedean algebra
- recurrence equation
- unique solution
ASJC Scopus subject areas