Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2302.01069

Cheeger inequalities on simplicial complexes

Jürgen Jost·Dong Zhang
View original source ↗Read source document ↗Export metadata ↓

Abstract

Cheeger-type inequalities in which the decomposability of a graph and the spectral gap of its Laplacian mutually control each other play an important role in graph theory and network analysis, in particular in the context of expander theory. The natural problem to extend such inequalities to simplicial complexes and their higher order Eckmann Laplacians has been open for a long time. Before proving any inequality, however, one needs to identify the right Cheeger-type constant for which such an inequality can hold. Here, we solve this problem. Our solution involves and combines constructions from simplicial topology, signed graphs, Gromov filling radii and an interpolation between the standard 2-Laplacians and the analytically more difficult 1-Laplacians, for which, however, the inequalities become equalities. It is then natural to develop a general theory for $p$-Laplacians on simplicial complexes and investigate the related Cheeger-type inequalities.

Explore related subjects

math.COmath.GTmath.MGmath.SP

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jürgen Jost, Dong Zhang. 2026-02-05. Cheeger inequalities on simplicial complexes. https://doi.org/10.2422/2036-2145.202307_009

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

KEEP EXPLORING

Related papers

arXiv2026

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO↗
arXiv2026

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO↗