Refinement type equations and Grincevičjus series (Q2517707): Difference between revisions

The paper deals with the refinement type equation \[ f(x)=\sum_{n\in\mathbb{Z}}c_{n,1}f(kx-n) +\sum_{n\in\mathbb{Z}}c_{n,-1}f(-kx-n),\tag{E} \] where \(k\geq 2\) is a fixed integer and the constants \(c_{n,1},\,c_{n,-1},\,\,n\in\mathbb{Z}\) are nonnegative and satisfy the conditions \(\sum_{n\in\mathbb{Z}}(c_{n,1}+c_{n,-1})=k\), \(\sum_{n\in\mathbb{Z}}\log| n| (c_{n,1}+c_{n,-1})<+\infty\) and \(c_{\alpha(k-1),1}+c_{-\alpha(k+1),-1}<k\) for all \(\alpha\in\mathbb{R}\) such that \(\alpha (k+1)\in\mathbb{Z}\) and \(\alpha(k-1)\in\mathbb{Z}\). Using the probability distribution of a Grincevičjus series and the notions of trees and blocking sets, the authors present necessary and sufficient conditions for the existence of nontrivial \(L^1\)-solutions of equation (E) in several special cases.