Javascript must be enabled to continue!
Optimal Sobolev trace embeddings
View through CrossRef
Optimal target spaces are exhibited in arbitrary-order Sobolev type embeddings for traces of
n
n
-dimensional functions on lower dimensional subspaces. Sobolev spaces built upon any rearrangement-invariant norm are allowed. A key step in our approach consists of showing that any trace embedding can be reduced to a one-dimensional inequality for a Hardy type operator depending only on
n
n
and on the dimension of the relevant subspace. This can be regarded as an analogue for trace embeddings of a well-known symmetrization principle for first-order Sobolev embeddings for compactly supported functions. The stability of the optimal target space under iterations of Sobolev trace embeddings is also established and is part of the proof of our reduction principle. As a consequence, we derive new trace embeddings, with improved (optimal) target spaces, for classical Sobolev, Lorentz-Sobolev and Orlicz-Sobolev spaces.
American Mathematical Society (AMS)
Title: Optimal Sobolev trace embeddings
Description:
Optimal target spaces are exhibited in arbitrary-order Sobolev type embeddings for traces of
n
n
-dimensional functions on lower dimensional subspaces.
Sobolev spaces built upon any rearrangement-invariant norm are allowed.
A key step in our approach consists of showing that any trace embedding can be reduced to a one-dimensional inequality for a Hardy type operator depending only on
n
n
and on the dimension of the relevant subspace.
This can be regarded as an analogue for trace embeddings of a well-known symmetrization principle for first-order Sobolev embeddings for compactly supported functions.
The stability of the optimal target space under iterations of Sobolev trace embeddings is also established and is part of the proof of our reduction principle.
As a consequence, we derive new trace embeddings, with improved (optimal) target spaces, for classical Sobolev, Lorentz-Sobolev and Orlicz-Sobolev spaces.
Related Results
Exploiting word embeddings for modeling bilexical relations
Exploiting word embeddings for modeling bilexical relations
There has been an exponential surge of text data in the recent years. As a consequence, unsupervised methods that make use of this data have been steadily growing in the field of n...
SPACE: STRING proteins as complementary embeddings
SPACE: STRING proteins as complementary embeddings
Abstract
Motivation
Representation learning has revolutionized sequence-based prediction of protein function and subcellu...
Dynamical approaches to Sharp Sobolev inequalities
Dynamical approaches to Sharp Sobolev inequalities
Inégalités de Sobolev optimales : approches dynamiques
Les inégalités de Sobolev, depuis leur preuve en 1938, ont été l'objet d'une intense recherche, et ont permis...
SPACE: STRING proteins as complementary embeddings
SPACE: STRING proteins as complementary embeddings
Representation learning has revolutionized sequence-based prediction of protein function and subcellular localization. Protein networks are an important source of information compl...
Exploring Word Embeddings for Text Classification: A Comparative Analysis
Exploring Word Embeddings for Text Classification: A Comparative Analysis
For language tasks like text classification and sequence labeling, word embeddings are essential for providing input characteristics in deep models. There have been many word embed...
Elements of decorative prose in the novel by Alexander Sobolev “Griffins guard the lyre”
Elements of decorative prose in the novel by Alexander Sobolev “Griffins guard the lyre”
The topic of the article is relevant because it considers the specific poetics of the modern neo-modernist work. It is worth noting that the novel “Griffins Guard the Lyre” is a pa...
SOME REMARKS ON SOBOLEV AND BI-SOBOLEV MAPPINGS
SOME REMARKS ON SOBOLEV AND BI-SOBOLEV MAPPINGS
AbstractIn this note, we present the state-of-the-art theory of bi-Sobolev mappings. We recall that f is a Sobolev homeomorphism if f belongs to $$W^{1,1}_\text {loc}\cap \textrm{H...
Exploring the Privacy-Preserving Properties of Word Embeddings: Algorithmic Validation Study (Preprint)
Exploring the Privacy-Preserving Properties of Word Embeddings: Algorithmic Validation Study (Preprint)
BACKGROUND
Word embeddings are dense numeric vectors used to represent language in neural networks. Until recently, there had been no publicly released embe...

