The best constant of the discrete Sobolev inequalities on the complete bipartite graph
From MaRDI portal
(Redirected from Publication:5032387)
Recommendations
- The best constant of three kinds of the discrete Sobolev inequalities on the complete graph
- The best constant of the discrete ^p Sobolev inequality on the complete graph
- The best constant of three kinds of discrete Sobolev inequalities on regular polyhedron
- scientific article; zbMATH DE number 6345645
- A hierarchical structure for the sharp constants of discrete Sobolev inequalities on a weighted complete graph
Cited in
(13)- A hierarchical structure for the sharp constants of discrete Sobolev inequalities on a weighted complete graph
- The existence of extremal functions for discrete Sobolev inequalities on lattice graphs
- Two types of discrete Sobolev inequalities on a weighted Toeplitz graph
- scientific article; zbMATH DE number 6345645 (Why is no real title available?)
- The best constant of the discrete ^p Sobolev inequality on the complete graph
- Constantes de Sobolev des arbres
- The best constant of discrete Sobolev inequality
- The best constant of three kinds of discrete Sobolev inequalities on regular polyhedron
- The best constant of discrete Sobolev inequality on 1812 C60 fullerene isomers
- A note on the paper “Best constants for the Hardy−Litllewood maximal operator on finite graphs”
- scientific article; zbMATH DE number 7675556 (Why is no real title available?)
- The best constants of two types of discrete ^p Sobolev inequalities on a complete graph
- The best constant of three kinds of the discrete Sobolev inequalities on the complete graph
This page was built for publication: The best constant of the discrete Sobolev inequalities on the complete bipartite graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5032387)