Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userSharp capacitary estimates for rings in metric spaces
85
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
We establish sharp estimates for the $p$-capacity of metric rings with unrelated radii in metric measure spaces equipped with a doubling measure and supporting a Poincare inequality. These estimates play an essential role in the study of the local behavior of p-harmonic Greens functions.
rate research
Read More
Let $mathfrak{M}$ be a class of metric spaces. A metric space $Y$ is minimal $mathfrak{M}$-universal if every $Xinmathfrak{M}$ can be isometrically embedded in $Y$ but there are no proper subsets of $Y$ satisfying this property. We find conditions under which, for given metric space $X$, there is a class $mathfrak{M}$ of metric spaces such that $X$ is minimal $mathfrak{M}$-universal. We generalize the notion of minimal $mathfrak{M}$-universal metric space to notion of minimal $mathfrak{M}$-universal class of metric spaces and prove the uniqueness, up to an isomorphism, for these classes. The necessary and sufficient conditions under which the disjoint union of the metric spaces belonging to a class $mathfrak{M}$ is minimal $mathfrak{M}$-universal are found. Examples of minimal universal metric spaces are constructed for the classes of the three-point metric spaces and $n$-dimensional normed spaces. Moreover minimal universal metric spaces are found for some subclasses of the class of metric spaces $X$ which possesses the following property. Among every three distinct points of $X$ there is one point lying between the other two points.
An important problem that commonly arises in areas such as internet traffic-flow analysis, phylogenetics and electrical circuit design, is to find a representation of any given metric $D$ on a finite set by an edge-weighted graph, such that the total edge length of the graph is minimum over all such graphs. Such a graph is called an optimal realization and finding such realizations is known to be NP-hard. Recently Varone presented a heuristic greedy algorithm for computing optimal realizations. Here we present an alternative heuristic that exploits the relationship between realizations of the metric $D$ and its so-called tight span $T_D$. The tight span $T_D$ is a canonical polytopal complex that can be associated to $D$, and our approach explores parts of $T_D$ for realizations in a way that is similar to the classical simplex algorithm. We also provide computational results illustrating the performance of our approach for different types of metrics, including $l_1$-distances and two-decomposable metrics for which it is provably possible to find optimal realizations in their tight spans.
We prove in the setting of $Q$--Ahlfors regular PI--spaces the following result: if a domain has uniformly large boundary when measured with respect to the $s$--dimensional Hausdorff content, then its visible boundary has large $t$--dimensional Hausdorff content for every $0<t<sleq Q-1$. The visible boundary is the set of points that can be reached by a John curve from a fixed point $z_{0}in Omega$. This generalizes recent results by Koskela-Nandi-Nicolau (from $mathbb{R}^2$) and Azzam ($mathbb{R}^n$). In particular, our approach shows that the phenomenon is independent of the linear structure of the space.
We study the validity of a partition property known as weak indivisibility for the integer and the rational Urysohn metric spaces. We also compare weak indivisiblity to another partition property, called age-indivisibility, and provide an example of a countable ultrahomogeneous metric space which may be age-indivisible but not weakly indivisible.
In this note we prove that on general metric measure spaces the perimeter is equal to the relaxation of the Minkowski content w.r.t. convergence in measure
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
