A Lower Bound on the Distortion of Embedding Planar Metrics into Euclidean Space

We exhibit a simple infinite family of series-parallel graphs that cannot be metrically embedded into Euclidean space with distortion smaller than

Improved bounds in the metric cotype inequality for Banach spaces

It is shown that if (X,‖⋅X_‖) is a Banach space with Rademacher cotype q then for every integer n there exists an even integer such that for every we have

(1)     

On the Average of Exponents

ＯｎｔｈｅＡｖｅｒａｇｅｏｆＥｘｐｏｎｅｎｔｓＣａｏＨｕｉｚｈｏｎｇ（曹惠中）（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃｓ，ＳｈａｎｄｏｎｇＵｎｉｖｅｒｓｉｔｙ，Ｊｉｎａｎ２５０１００）Ａｂｓｔｒａｃｔ：Ｌｅｔｎ＞１ａｎｄｂｅｔｈｅｐｒｉｍｅｆａ...     

The Embedding W n,1 into C 0 on Compact Riemannian Manifolds

We study the best constant in the inequality corresponding to the Sobolev embedding W ^n,1(R ⁿ ) into the space of bounded continuous functions C ₀(R ⁿ ). Then, we adapt this inequality on compact Riemannian manifolds and discuss on its optimality.     

The Comparison Theorem for Bergman and Kobayashi Metrics on Cartan-Hartogs Domain of the Third Type

In this paper, we give the holomorphic sectional curvature under invariant Kähler metric on a Cartan-Hartogs domain of the third type Y _III (N,q,K) and construct an invariant Kähler metric, which is complete and not less than the Bergman metric, such that its holomorphic sectional curvature is bounded above by a negative constant. Hence we obtain a comparison theorem for the Bergman and Kobayashi metrics on Y _III (N,q,K).     

Embedding Sums of Cancellative Modes into Semimodules

A mode (idempotent and entropic algebra) is a Lallement sum of its cancellative submodes over a normal band if it has a congruence with a normal band quotient and cancellative congruence classes. We show that such a sum embeds as a subreduct into a semimodule over a certain ring, and discuss some consequences of this fact. The result generalizes a similar earlier result of the authors proved in the case when the normal band is a semilattice. The paper was written within the framework of COST Action 274. Research supported by Warsaw University of Technology under grant number 504G/1120/0008/000.     

拟共形映照的双曲面积偏差估计

The distortion property of hyperbolic area of planar quasiconformal mappings is studied in this paper.In the case of radial quasiconformal mappings and angular deformed quasiconformal mappings their hyperbolic area distortions are estimated quite sharply.The result can be applied to judge whether the hyperbolic area of a planar subset is explodable.     

On the metric dimension of HDN

The concept of metric basis is useful for robot navigation. In graph G, a robot is aware of its current location by sending signals to obtain the distances between itself and the landmarks in G. Its position is determined uniquely in G if it knows its distances to sufficiently many landmarks. The metric basis of G is defined as the minimum set of landmarks such that all other vertices in G can be uniquely determined and the metric dimension of G is defined as the cardinality of the minimum set of landmarks. The major contribution of this paper is that we have partly solved the open problem proposed by Manuel et al. [9], by proving that the metric dimension of $\text{HDN1}(n)$ and $\text{HDN2}(n)$ are either 3 or 4. However, the problem of finding the exact metric dimension of HDN networks is still open.     

Nehari函数族的偏差性质与拟共形延拓

研究某一Nehari函数族的偏差性质,得到这类函数族的H?lder连续性及若干偏差定理,同时讨论了该函数类的拟共形延拓问题,并给出拟共形延拓的复伸张估计,推广了杨宗信等人相应的结论.     

On the Embedding of Ordered Semigroups into Ordered Group

It was shown in [7] that any right reversible, cancellative ordered semigroup can be embedded into an ordered group and as a consequence, it was shown that a commutative ordered semigroup can be embedded into an ordered group if and only if it is cancellative. In this paper we introduce the concept of L-maher and R-maher semigroups and use a technique similar to that used in [7] to show that any left reversible cancellative ordered L or R-maher semigroup can be embedded into an ordered group.     

On variants of the Johnson–Lindenstrauss lemma

The Johnson–Lindenstrauss lemma asserts that an n‐point set in any Euclidean space can be mapped to a Euclidean space of dimension k = O(ε^‐2 log n) so that all distances are preserved up to a multiplicative factor between 1 ? ε and 1 + ε. Known proofs obtain such a mapping as a linear map R ⁿ → R ^k with a suitable random matrix. We give a simple and self‐contained proof of a version of the Johnson–Lindenstrauss lemma that subsumes a basic versions by Indyk and Motwani and a version more suitable for efficient computations due to Achlioptas. (Another proof of this result, slightly different but in a similar spirit, was given independently by Indyk and Naor.) An even more general result was established by Klartag and Mendelson using considerably heavier machinery. Recently, Ailon and Chazelle showed, roughly speaking, that a good mapping can also be obtained by composing a suitable Fourier transform with a linear mapping that has a sparse random matrix M; a mapping of this form can be evaluated very fast. In their result, the nonzero entries of M are normally distributed. We show that the nonzero entries can be chosen as random ± 1, which further speeds up the computation. We also discuss the case of embeddings into R ^k with the ?₁ norm. © 2008 Wiley Periodicals, Inc. Random Struct. Alg., 2008     

On the Semivalues and the Least Square Values Average Per Capita Formulas and Relationships

In this paper, it is shown that both the Semivalues and the Least Square Values of cooperative transferable utilities games can be expressed in terms of n^2 averages of values of the characteristic function of the game, by means of what we call the Average per capita formulas. Moreover, like the case of the Shapley value earlier considered, the terms of the formulas can be computed in parallel, and an algorithm is derived. From these results, it follows that each of the two values mentioned above are Shapley values of games easily obtained from the given game, and this fact gives another computational opportunity, as soon as the computation of the Shapley value is efficiently done.     

On Some Ricci-Flat Metrics of Cohomogeneity Two on Complex Line Bundles

We construct a family of four-dimensional smooth Ricci-flat Riemann orbifolds of cohomogeneity two which possess the structure of complex line bundles.     

在曲面上图嵌入的唯一性(英)

在本文中，证明了图嵌入在一个已知曲面上的唯一性充分条件．这个条件比［4］中要弱些．     

On the dimension of trees

We consider isometric embedding of trees into the infinite graph Z_m whose vertices are the m-dimensional lattice points where two vertices a=(a₁,a₂,…,a_m) and b=(b₁,b₂,…,b_m) are adjacent if and only if |a_i-b_i|?1 for 1?i?m. Linial, London, and Rabinovich have shown that this can be done with , where t is the number of leaves. In this note, we sketch a proof that .     

On the Embedding of an Affine Space into a Projective Space

Let k, K be fields, and assume that |k| 4 and n, m 2, or |k| = 3 and n 3, m 2. Then, for any embedding of AG(n, k) into PG(m, K), there exists an isomorphism from k into K and an (n+1) × (m+1) matrix B with entries in K such that can be expressed as (x₁,x₂,...,x_n) = [(1,x₁ ,x₂ ,...,x_n )B], where the right-hand side is the equivalence class of (1,x₁ ,x₂ ,...,x_n )B. Moreover, in this expression, is uniquely determined, and B is uniquely determined up to a multiplication of element of K*. Let l 1, and suppose that there exists an embedding of AG(m+l, k) into PG(m, K) which has the above expression. If we put r = dim _k K, then we have r 3 and m > 2 l-1)/(r-2). Conversely, there exists an embedding of AG(l+m, k) into PG(m, K) with the above expression if K is a cyclic extension of k with dim _k K=r 3, and if m 2l/(r-2) with m even or if m 2l/(r-2) +1 with m odd.     

链状正则图的平均距离

本文构造了一类链状正则图G_k∶δ,求出了它们的平均距离D(G_k.δ),并得到关系式上式等号成立当且仅当δ=4f且k=0.这个估计式指出了施容华猜想[1]D(G)≤n/(δ 1)不成立. 文中进一步证明了这一类链状正则图有最大的直径,所以可以作出猜想: 若G是n阶连通图,则D(G)<(n 1)/(δ 1),其中δ是图G的最小度。     

Distortion control of conjugacies between quadratic polynomials

We use a new type of distortion control of univalent functions to give an alternative proof of Douady-Hubbard’s ray-landing theorem for quadratic Misiurewicz polynomials. The univalent maps arise from Thurston’s iterated algorithm on perturbation of such polynomials.