Asymptotically sharp Hardy-Rellich inequalities on lattices

We determine the sharp asymptotic behavior of the optimal constants in the discrete Hardy-Rellich inequalities on the lattice $\mathbb{Z}^d$. For every fixed integer $m\ge 1$, let ${\mathcal C}_{m,d}$ be the best constant in the $m$-th order Hardy-Rellich inequality. We prove that $$\lim_{d\to\infty}\frac{\mathcal C_{m,d}}{d^m}=2^m.$$ Our approach combines a Fourier reduction to weighted inequalities with the flat torus and general weighted Hardy-Rellich identities of first and second order. A key novelty is the use of probabilistic concentration estimates, specifically Hoeffding's inequality and entropy methods, to handle estimates involving the anisotropic weight $\omega^\gamma$ $(\gamma\geq 1)$ where $$\omega(x)=\sum_{j=1}^{d} \Big(\sin\frac{x_j}{2}\Big)^2$$ in a dimension-uniform manner. These tools yield asymptotically sharp weighted estimates on the torus, from which the lattice inequalities follow by iteration.