Search arXivSearch

arXiv · 2609.07105

Monotone Hadwiger Theorems on Spherical and Hyperbolic Convex Sets

Abstract

For every $n\geq1$, we classify monotone rotation-invariant real-valued valuations on closed spherical convex sets, without assuming continuity or measurability. On proper sets, namely those contained in an open hemisphere, these are precisely the nonnegative linear combinations of the normalized spherical quermassintegrals. On all closed spherical convex sets, they are precisely the linear combinations of the spherical intrinsic volumes with nonnegative, nondecreasing coefficients. The representations are unique, and all such valuations are continuous and invariant under the full orthogonal group. In hyperbolic space, an isometry-invariant real-valued valuation on compact convex sets is continuous if and only if it is a linear combination of the Euler characteristic and the hyperbolic quermassintegrals. This representation is unique. Monotonicity is equivalent to nonnegative coefficients and implies continuity. If monotonicity is required only between nonempty sets, the Euler coefficient is unrestricted in the proper spherical and hyperbolic cases, whereas the classification on all closed spherical convex sets is unchanged. We also obtain corresponding classifications for valuations on closed convex cones that vanish at the zero cone and monotone classifications on compact projectively convex sets contained in an affine chart of real elliptic space.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Houshan Fu. 2026-09-18. Monotone Hadwiger Theorems on Spherical and Hyperbolic Convex Sets. https://arxiv.org/abs/2609.07105

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Random algebraic constructions for extremal and Ramsey problems

Building on Bukh's random algebraic method, we develop a framework for extremal and Ramsey problems involving apex hypergraphs. If $\mathcal{H}$ is a $(d-1)$-partite $(d-1)$-uniform hypergraph with $S$ edges and $\mathcal{H}(t)$ is obtained by adjoining $t$ vertices with common link $\mathcal{H}$, we prove that $\operatorname{ex}(n,\mathcal{H}(t))=Ω_{\mathcal{H}}(n^{d-1/S})$ for $t>9^{S+o_d(S)}$, which is best possible when $\mathcal{H}$ is Sidorenko. Our framework also yields sharper sided Zarankiewicz bounds, quantitative generalized Tur'an bounds, and diagonal multicolor Ramsey constructions. For each fixed $s\geq 2$ and $K\geq 3$, we further prove $\operatorname{r}_K(\mathcal K_{s,t};\mathcal K_n) =Θ_{s,t,K}((n/\log n)^s)$ for $t>9^{s+o(s)}$, extending a theorem of Alon and Rödl from factorial to exponential $t$. The main ingredients are interpolation on $m$-independent varieties, control of the dependencies imposed by symmetry, and linear spaces of forms whose nonzero members remain regular after a common algebraic slice. Limited edge independence then gives the spectral and local-density estimates needed for the Ramsey application.

math.CO

A note on vertex-critical induced subgraphs of shift graphs

Shift graphs, introduced by Erdős and Hajnal in 1964, form one of the simplest known non-recursive constructions of triangle-free graphs with arbitrarily large chromatic number. In this note, we identify a surprising property: for each integer $k \geq 1$, the smallest $k$-chromatic shift graph contains a \emph{unique} induced $k$-vertex-critical subgraph. We give an explicit description of this subgraph and prove its uniqueness. This provides a new family of vertex-critical triangle-free graphs of arbitrarily large chromatic number.

math.CO