A hierarchical structure for the sharp constants of discrete Sobolev inequalities on a weighted complete graph
From MaRDI portal
Publication:1646248
DOI10.3390/sym10010001zbMath1390.46040OpenAlexW2777513486MaRDI QIDQ1646248
Yoshinori Kametaka, Kazuo Takemura, Atsushi Nagai
Publication date: 25 June 2018
Published in: Symmetry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3390/sym10010001
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Best constants in approximation theory (41A44) Sobolev (and similar kinds of) spaces of functions of discrete variables (46E39)
Related Items
On the semigroup whose elements are subgraphs of a complete graph, SHARP CONSTANTS OF DISCRETE SOBOLEV INEQUALITIES ON A CYCLIC RECTANGULAR LATTICE
Cites Work
- Unnamed Item
- Unnamed Item
- Two types of discrete Sobolev inequalities on a weighted Toeplitz graph
- Sobolev type inequalities of time-periodic boundary value problems for Heaviside and Thomson cables
- The best constant of three kinds of the discrete Sobolev inequalities on the complete graph
- The best constant of Sobolev inequality in an \(n\)-dimensional Euclidean space
- The best constant of Sobolev inequality corresponding to a bending problem of a beam on an interval
- Green's matrices
- Hamiltonian properties of Toeplitz graphs
- Best constant in Sobolev inequality
- Problèmes isoperimetriques et espaces de Sobolev
