首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 15 毫秒
1.
2.
3.
The paper is partially supported by the Polish Committee for Scientific Research under grant no. 22009 91 02.  相似文献   

4.
5.
The following result is proved: For everyε>0 there is aC(ε)>0 such that every finite metric space (X, d) contains a subsetY such that |Y|≧C(ε)log|X| and (Y, d Y) embeds (1 +ε)-isomorphically into the Hilbert spacel 2. The authors are grateful to Haim Wolfson for some discussions related to the content of this paper.  相似文献   

6.
We show that for any class of uniformly bounded functions with a reasonable combinatorial dimension, the vast majority of small subsets of the -dimensional combinatorial cube cannot be represented as a Lipschitz image of a subset of , unless the Lipschitz constant is very large. We apply this result to the case when consists of linear functionals of norm at most one on a Hilbert space.

  相似文献   


7.
Quasiminima of the Lipschitz extension problem   总被引:1,自引:0,他引:1  
In this paper, we extend the notion of quasiminimum to the framework of supremum functionals by studying the model case
which governs the real analysis problem of finding optimal Lipschitz extensions. Using a characterization involving the concept of comparison with cones, we obtain a Harnack inequality, Lipschitz estimates and various convergence and stability properties for the quasiminima. Several examples of quasiminima are also given. Mathematics Subject Classification (2000) 47J20, 49N60, 35B65  相似文献   

8.
The Euclidean distortion of a metric space, a measure of how well the metric space can be embedded into a Hilbert space, is currently an active interdisciplinary research topic. We study the corresponding notion for mappings instead of spaces, which is that of Lipschitz factorization through subsets of Hilbert space. The main theorems are two characterizations of when a mapping admits such a factorization, both of them inspired by results dealing with linear factorizations through Hilbert space. The first is a nonlinear version of a classical theorem of Kwapień in terms of “dominated” sequences of vectors, whereas the second is a duality result by means of a tensor-product approach.  相似文献   

9.
It was initiated by the second author to investigate in which groups the left and right stabilizers of subsets have equal order. First we prove that if the left and right stabilizers of sets of prime power size are equal order then the group is supersolvable. We also characterize those 2-groups which satisfy this property for p = 2. We show that if in a finite group, the left and right stabilizers of sets of prime power size have equal order, then the commutator subgroup is abelian. Finally we characterize hamiltonian groups with the help of one-sided stabilizers. Received: 18 April 2005; revised 11 May 2005  相似文献   

10.
11.
It is shown that the field coproduct of any skew fieldE with a binomial (commutative) field extensionF/k overk can be expressed as a cyclic extension of a skew fieldK (theE-socle), itself the field coproduct of [F:k] copies ofE overk. Qua vector space the coproduct may also be expressed as a tensor product ofE andK overk. To the memory of Shimshon Amitsur  相似文献   

12.
We prove that every Lipschitz function from a subset of a locally compact length space to a metric tree has a unique absolutely minimal Lipschitz extension (AMLE). We relate these extensions to a stochastic game called Politics??a generalization of a game called Tug of War that has been used in Peres et?al. (J Am Math Soc 22(1):167?C210, 2009) to study real-valued AMLEs.  相似文献   

13.
14.
15.
We prove that Burenkov's extension operator preserves Sobolev spaces built on general Morrey spaces, including classical Morrey spaces. The analysis concerns bounded and unbounded open sets with Lipschitz boundaries in the n‐dimensional Euclidean space.  相似文献   

16.
17.
18.
We show that the linear and nonlinear Lipschitz extension properties of a metric space are not changed when the original metric is replaced by a new metric obtained by composition with an arbitrary concave function. Submitted: January 2001, Revised: February 2001.  相似文献   

19.
We study vertex cut and flow sparsifiers that were recently introduced by Moitra (2009), and Leighton and Moitra (2010). We improve and generalize their results. We give a new polynomial-time algorithm for constructing O(log k/ log log k) cut and flow sparsifiers, matching the best known existential upper bound on the quality of a sparsifier, and improving the previous algorithmic upper bound of O(log2k/ log log k). We show that flow sparsifiers can be obtained from linear operators approximating minimum metric extensions. We introduce the notion of (linear) metric extension operators, prove that they exist, and give an exact polynomialtime algorithm for finding optimal operators.  相似文献   

20.
We give an example which shows that the Burago's bounded distance theorem does not hold in a non-intrinsic metric case. The argument is based on the classical answer to the densest circle packing problem in R2.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号