Studying discrete analogues of Hardy-type inequalities on lattice graphs reveals sharp constants and optimizers behavior.
