Skip to content
Preprint

Simplex--center configurations in dense subsets of Euclidean spaces and the integer lattice

Aug 2026 · 0 citations · 15 references
Mathematics

Abstract

We obtain density Ramsey theorems for configurations consisting of the vertices of a simplex $\Delta_o$ together with their barycenter. We prove that any subset $A\subseteq\mathbb{R}^n$ of positive upper density contains an isometric copy of all sufficiently large dilates of $\Delta_o$ together with its barycenter. As this configuration is non-spherical such results are not possible with respect to the quadratic Euclidean metric, we consider general metrics $\rho$ defined by a positive-definite, homogeneous forms of even degree at least four. We prove the analogous result in the discrete setting, for subsets $A$ of the integer lattice $\mathbb{Z}^n$, under some natural and necessary congruence restrictions on the scales $\lambda$ at which the set $A$ can contain an isometric copy of the simplex.

View source

Similar papers

Preprint Sep 2026

Mirror Counts of Spectral Curves

Given a convex lattice polygon $\Delta\subset \mathbb R^2$, let $N_\Delta$ be the count of rational, nodal curves in the linear system of the ample line bundle $L_\Delta$ on the toric variety $\mathbb P_\Delta$ defined by $\Delta$, having fixed intersection with the toric boundary. We show that the relative Jacobian of...

T. Graber, Ming-Yuan Hu, Eric Zaslow · 0 citations
Preprint Sep 2026

Metric Bases of Barycentric and Matching Subdivisions of Zero-Divisor Graphs

In this paper, we study metric bases and related metric properties for barycentric and partial matching subdivisions of the zero-divisor graph of $\mathbb Z_{pq}$, where $p$ and $q$ are distinct odd primes with $q>p$. We first recall the natural partition of the zero-divisor graph into the two prime classes and then gi...

S. Vidya, Prasanna Poojary, B. Rather et al. · 0 citations
Preprint Sep 2026

Dimension-free estimates for the full discrete Euclidean ball maximal function

Let $M_t$ denote the normalized average over the lattice points in the Euclidean ball of radius $t$ in $\mathbb{Z}^d$. We prove that the full maximal operator $f\mapsto\sup_{t\geq0}\lvert M_t f\rvert$ is bounded on $\ell^p(\mathbb{Z}^d)$, for every $1<p\leq\infty$, with a constant independent of the dimension. In parti...

Sheng-Chen Mao · 0 citations
Preprint Aug 2026

Minkowski Polytopes of Spherical Designs: High-Order Isotropy and Quantitative Sphericity

Let $X_N=\{x_1,\dots,x_N\}\subset \Sph^2$ be a spherical $t$-design of strength $t\ge2$, and let $\mu_X$ be its empirical measure. Minkowski's theorem associates with $X_N$ a convex polytope $P_X\subset\R^3$, unique up to translation, whose facet normals are the design nodes and whose facets all have area $4\pi/N$; equ...

Cong-Pei An · 2 citations
Preprint Aug 2026

First-Order Laws for Random Geometric Graphs on the Torus

Let $G_D(n;r)$ be the random geometric graph generated by $n$ independent uniform points on the $D$-dimensional torus, with adjacency defined by torus $L^\infty$-distance at most $r$. We study first-order zero-one and convergence laws at fixed radius and in sparse regimes. At fixed radius, we determine the asymptotics...

Simi Haber, Mostafa Mirabi, S. Shelah · 0 citations
Preprint Sep 2026

Focal Sets of the John Ellipsoid of a Simplex from Its Vertices

Starting with the vertices of a simplex in $\R^n$, we build a cubic vector field. If the semiaxes of the simplex's John ellipsoid are distinct, the Jacobian of this field has repeated eigenvalues exactly on the ellipsoid's focal sets. This works in every dimension $n\geq2$. We give examples in $\R^4$, $\R^3$, and $\R^2...

A. Eydelzon · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.