Search arXivSearch

arXiv · 2106.04116

Discrete-to-Continuous Extensions: piecewise multilinear extension, min-max theory and spectral theory

Abstract

We introduce the homogeneous and piecewise multilinear extensions and the eigenvalue problem for locally Lipschitz function pairs, in order to develop a systematic framework for relating discrete and continuous min-max problems. This also enables us to investigate spectral properties for pairs of $p$-homogeneous functions and to propose a critical point theory for zero-homogeneous functions. The main contributions are: (1) We provide several min-max relations between an original discrete formulation and its piecewise multilinear extension. We introduce the concept of perfect domain pairs to view comonotonicity on vectors as an extension of inclusion chains on sets. The piecewise multi-linear extension is (slice-)rank preserving, which closely relates to Tao's lemma on diagonal tensors. More discrete-to-continuous equalities are obtained, including a general form involving log-concave polynomials. And by employing these fundamental correspondences, we get further results and applications on tensors, Turán's problem, signed (hyper-)graphs, etc. (2) We derive the mountain pass characterization, linking theorems, nodal domain inequalities, inertia bounds, duality theorems and distribution of eigenvalues for pairs of $p$-homogeneous functions. We establish a new property on the subderivative of a convex function which relates to the Gauss map of the graph of the convex function. Based on these fundamental results, we can analyze the structure of eigenspaces in depth. For example, we show a simple one-to-one correspondence between the nonzero eigenvalues of the vertex p-Laplacian and the edge $p^*$-Laplacian of a graph. We also apply the theory to Cheeger inequalities and $p$-Laplacians on oriented hypergraphs and simplicial complexes. Also, the first nonlinear analog of Huang's approach for hypergraphs is provided.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jürgen Jost, Dong Zhang. 2021-11-24. Discrete-to-Continuous Extensions: piecewise multilinear extension, min-max theory and spectral theory. https://arxiv.org/abs/2106.04116

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

KEEP EXPLORING

Related papers

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

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