Uniform estimates for Delannoy numbers and dimension-free estimates for discrete maximal functions over cross-polytopes
Abstract
We prove a uniform upper and lower bound for Delannoy numbers. This is achieved by using the representation of Delannoy numbers as the number of lattice points in high-dimensional cross-polytopes (also known as hyper-octahedrons or 1 balls) and proving a uniform (dimension-free) count for these lattice points. Using this count, we establish dimension-free estimates for discrete maximal functions over cross-polytopes. By proving a comparison principle with the continuous setting, we obtain a dimension-free estimate on all p(Zd) spaces for radii R>C d3/2. We also treat the full maximal function on 2(Zd) for small radii R d1- and the dyadic maximal function for any radii.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.