A hierarchical structure for the sharp constants of discrete Sobolev inequalities on a weighted complete graph
Summary: This paper clarifies the hierarchical structure of the sharp constants for the discrete Sobolev inequality on a weighted complete graph. To this end, we introduce a generalized-graph Laplacian \(\boldsymbol{A} = \boldsymbol{I} - \boldsymbol{B}\) on the graph, and investigate two types of discrete Sobolev inequalities. The sharp constants \(C_0(N; a)\) and \(C_0(N)\) were calculated through the Green matrix \(\boldsymbol{G}(a) = (\boldsymbol{A} + a \boldsymbol{I})^{- 1}(0 < a < \infty)\) and the pseudo-Green matrix \(\boldsymbol{G}_\ast = \boldsymbol{A}^\dagger\). The sharp constants are expressed in terms of the expansion coefficients of the characteristic polynomial of \(\boldsymbol{A}\). Based on this new discovery, we provide the first proof that each set of the sharp constants \(\{C_0(n; a) \}_{n = 2}^N\) and \(\{C_0(n) \}_{n = 2}^N\) satisfies a certain hierarchical structure.
- The best constant of the discrete ^p Sobolev inequality on the complete graph
- The best constant of the discrete Sobolev inequalities on the complete bipartite graph
- Two types of discrete Sobolev inequalities on a weighted Toeplitz graph
- The best constant of three kinds of the discrete Sobolev inequalities on the complete graph
- The existence of extremal functions for discrete Sobolev inequalities on lattice graphs
- Sharp constants of discrete Sobolev inequalities on a cyclic rectangular lattice
- Sharp inequalities for maximal operators on finite graphs
- Sharp inequalities for maximal operators on finite graphs. II
- Sobolev type inequalities for compact metric graphs
- Sharp Liouville type results for semilinear elliptic inequalities involving gradient terms on weighted graphs
- Best constant in Sobolev inequality
- Green's matrices
- Hamiltonian properties of Toeplitz graphs
- scientific article; zbMATH DE number 6125590 (Why is no real title available?)
- scientific article; zbMATH DE number 964896 (Why is no real title available?)
- Problèmes isoperimetriques et espaces de Sobolev
- Sobolev type inequalities of time-periodic boundary value problems for Heaviside and Thomson cables
- The best constant of Sobolev inequality corresponding to a bending problem of a beam on an interval
- The best constant of Sobolev inequality in an \(n\)-dimensional Euclidean space
- The best constant of three kinds of the discrete Sobolev inequalities on the complete graph
- Two types of discrete Sobolev inequalities on a weighted Toeplitz graph
- The existence of extremal functions for discrete Sobolev inequalities on lattice graphs
- Two types of discrete Sobolev inequalities on a weighted Toeplitz graph
- The best constant of the discrete ^p Sobolev inequality on the complete graph
- The best constant of the discrete Sobolev inequalities on the complete bipartite graph
- Sharp constants of discrete Sobolev inequalities on a cyclic rectangular lattice
- On the semigroup whose elements are subgraphs of a complete graph
- The best constant of three kinds of the discrete Sobolev inequalities on the complete graph
This page was built for publication: A hierarchical structure for the sharp constants of discrete Sobolev inequalities on a weighted complete graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1646248)
