Steklov eigenvalue problem on subgraphs of integer lattices (Q6185119): Difference between revisions

For a bounded smooth domain \(\Omega\subset \mathbb{R}^n\), the Steklov eigenvalue problem consists of finding a harmonic function \(u\) on \(\Omega\), satisfying \[ \frac{\partial u}{\partial n}=\lambda u \] on the boundary of \(\Omega\). Denoting the eigenvalues by \(0=\sigma_1\leq \sigma_2\leq \cdots\), \textit{F. Brock} [Z. Angew. Math. Mech. 81, No. 1, 69--71 (2001; Zbl 0971.35055)] proved the inequality \[ \sum_{i=2}^{n+1}\frac{1}{\sigma_i}\geq C(n) (vol(\Omega))^{\frac{1}{n}}. \] In the current paper, an analog of this inequality in obtained for a discrete counterpart of the Steklov problem, in which \(\Omega\) is a finite subset of the lattice \(\mathbb{R}^n\).