Search arXivSearch

arXiv · 2608.09606

Choquet-type extension theory of set-pair functions, and applications to graph limits, hypergraphs, Riemannian manifolds and metric measure spaces

Abstract

We propose Choquet extension for set-pair functions, $L^p$ integration of Choquet extensions, and global extension constants, and apply these to investigate optimization problems and bound many combinatorial and geometric quantities. Our research line is also applicable to the study of original Choquet extension; within this framework, parallel results for the original version are obtained. Specifically, we use Choquet-type extensions to build an equivalent functional representation of set-based fractional optimization, which finds applications in various settings, such as maxcut, bipartiteness ratio, and conductance on graph limits or Riemannian manifolds. We further establish the $L^p$ integration of a family of Choquet extensions, and apply it to derive spectral bounds for conductance and other combinatorial quantities on measure spaces. A monotonicity inequality on global extension constants is proposed, which unifies classical estimates and uncovers new bounds for a lot of geometric and combinatorial quantities, such as torsional rigidity, Cheeger constants, Dirichlet $p$-isoperimetric constant, and $p$-Laplacian eigenvalues, in totally distinct underlying structures----including hypergraphs, graph limits, Riemannian manifolds and metric measure spaces.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Dong Zhang. 2026-08-10. Choquet-type extension theory of set-pair functions, and applications to graph limits, hypergraphs, Riemannian manifolds and metric measure spaces. https://arxiv.org/abs/2608.09606

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

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO