The 2-circle and 2-disk problems on trees (Q1123346): Difference between revisions

The authors consider on a homogeneous tree T two Pompeiu-type problems. For a function f on T one defines the means \[ \Sigma_ nf(x)=\sum_{d(x,y)=n}f(y),\quad B_ nf(x)=\sum_{d(x,y)\leq n}f(y). \] The problem is to recover f from \(\Sigma_ nf\) or from \(B_ nf\). The results are similar to classical theorems for the Euclidean plane. One of these result is the following: if \(q>2\) \((q+1\) is the number of edges at each vertex), and \(n\neq k\), not both odd, then \(\Sigma_ nf=0\) and \(\Sigma_ kf=0\) implies \(f=0\). The operator \(\Sigma_ n\) is a polynomial in \(\Sigma_ 1\), \(\Sigma_ n=p_ n(\Sigma_ 1)\), and the problem is related to the zeros of the polynomials \(p_ n\).