Constructive spherical codes near the Shannon bound

Shannon gave a lower bound in 1959 on the binary rate of spherical codes of given minimum Euclidean distance ρ. Using nonconstructive codes over a finite alphabet, we give a lower bound that is weaker but very close for small values of ρ. The construction is based on the Yaglom map combined with some finite sphere packings obtained from nonconstructive codes for the Euclidean metric. Concatenating geometric codes meeting the TVZ bound with a Lee metric BCH code over GF(p), we obtain spherical codes that are polynomial time constructible. Their parameters outperform those obtained by Lachaud and Stern (IEEE Trans Inf Theory 40(4):1140–1146, 1994). At very high rate they are above 98% of the Shannon bound.     

第四类Caftan-Hartogs域上Bergman度量与Einstein-Kahler度量等价

In this paper,we discuss the invariaut complete metric on the Cartan-Hartogs domain of the fourth type.Firstly,we find a new invariant complete metric,and prove the equivalence between Bergman metric and the new metric;Secondly,the Ricci curvature of the new metric has the super bound and lower bound;Thirdly,we prove that the holomorphic sectional curvature of the new metric has the negative supper bound;Finally,we obtain the equivalence between Bergman metric and Einstein-Kahler metric on the Cartan-Hartogs domain of the fourth type.     

Estimations of topological entropy for non-autonomous discrete systems

This paper is concerned with estimations of topological entropy for non-autonomous discrete systems. An estimation of lower bound of topological entropy for coupled-expanding systems associated with transition matrices in compact Hausdorff spaces is given. Estimations of upper and lower bounds of topological entropy for systems in compact metric spaces are obtained by their topological equi-semiconjugacy to subshifts of finite type under certain conditions. One example is provided for illustration.     

Natural Pseudo-Distance and Optimal Matching between Reduced Size Functions

This paper studies the properties of a new lower bound for the natural pseudo-distance. The natural pseudo-distance is a dissimilarity measure between shapes, where a shape is viewed as a topological space endowed with a real-valued continuous function. Measuring dissimilarity amounts to minimizing the change in the functions due to the application of homeomorphisms between topological spaces, with respect to the L _∞-norm. In order to obtain the lower bound, a suitable metric between size functions, called matching distance, is introduced. It compares size functions by solving an optimal matching problem between countable point sets. The matching distance is shown to be resistant to perturbations, implying that it is always smaller than the natural pseudo-distance. We also prove that the lower bound so obtained is sharp and cannot be improved by any other distance between size functions.     

Homogeneous metric and matrix product codes over finite commutative principal ideal rings

In this paper, a necessary and sufficient condition for the homogeneous distance on an arbitrary finite commutative principal ideal ring to be a metric is obtained. We completely characterize the lower bound of homogeneous distances of matrix product codes over any finite principal ideal ring where the homogeneous distance is a metric. Furthermore, the minimum homogeneous distances of the duals of such codes are also explicitly investigated.     

On tangent cones of Alexandrov spaces with curvature bounded below

The tangent cones of an inner metric Alexandrov space with finite Hausdorff dimension and a lower curvature bound are always inner metric spaces with nonnegative curvature. In this paper we construct an infinite-dimensional inner metric Alexandrov space of nonnegative curvature which has in one point a tangent cone whose metric is not an inner metric. Received: 20 October 1999 / Revised version: 8 May 2000     

Heat Kernel Estimates on Weighted Graphs

We prove upper and lower heat kernel bounds for the Laplacianon weighted graphs which include the case that the weights haveno strictly positive lower bound. Our estimates give rise toa very explicit probabilistic interpretation, and can be formulatedin terms of a weighted metric. Interestingly, this metric isnot equivalent to the intrinsic metric. 1991 Mathematics SubjectClassification 39A12.     

The Hausdorff Dimension of Exceptional Sets Associated with Normal Forms

The Hausdorff dimension is obtained for exceptional sets associatedwith linearising a complex analytic diffeomorphism near a fixedpoint, and for related exceptional sets associated with obtaininga normal form of an analytic vector field near a singular point.The exceptional sets consist of eigenvalues which do not satisfya certain Diophantine condition and are ‘close’to resonance. They are related to ‘lim-sup’ setsof a general type arising in the theory of metric Diophantineapproximation and for which a lower bound for the Hausdorffdimension has been obtained.     

Complete shrinking Ricci solitons have finite fundamental group

We show that if a complete Riemannian manifold supports a vector field such that the Ricci tensor plus the Lie derivative of the metric with respect to the vector field has a positive lower bound, then the fundamental group is finite. In particular, it follows that complete shrinking Ricci solitons and complete smooth metric measure spaces with a positive lower bound on the Bakry-Emery tensor have finite fundamental group. The method of proof is to generalize arguments of García-Río and Fernández-López in the compact case.

     

Optimal deterministic algorithms for some variants of Online Quota Traveling Salesman Problem

This paper is concerned with the Online Quota Traveling Salesman Problem. Depending on the symmetry of the metric and the requirement for the salesman to return to the origin, four variants are analyzed. We present optimal deterministic algorithms for each variant defined on a general space, a real line, or a half-line. As a byproduct, an improved lower bound for a variant of Online TSP on a half-line is also obtained.     

Quantitative Isoperimetry à la Levy-Gromov

On a Riemannian manifold with a positive lower bound on the Ricci tensor, the distance of isoperimetric sets from geodesic balls is quantitatively controlled in terms of the gap between the isoperimetric profile of the manifold and that of a round sphere of suitable radius. The deficit between the diameters of the manifold and of the corresponding sphere is likewise bounded. These results are actually obtained in the more general context of (possibly nonsmooth) metric measure spaces with curvature-dimension conditions through a quantitative analysis of the transport rays decompositions obtained by the localization method. © 2018 Wiley Periodicals, Inc.     

Estimate for the Best Approximation of Summable Functions of Two Variables in Terms of Fourier Coefficients

An upper bound for the best approximation of periodic summable functions of two variables in the metric of L is obtained in terms of Fourier coefficients. Functions that can be represented by trigonometric series with coefficients satisfying a two-dimensional analog of the Boas–Telyakovskii conditions are considered.     

Lower bounds for the quadratic assignment problem via triangle decompositions

We consider transformations of the (metric) Quadratic Assignment Problem (QAP) that exploit the metric structure of a given instance. We show in particular how the structural properties of rectangular grids can be used to improve a given lower bound. Our work is motivated by previous research of Palubetskes (1988), and it extends a bounding approach proposed by Chakrapani and Skorin-Kapov (1993). Our computational results indicate that the present approach is practical; it has been applied to problems of dimension up ton = 150. Moreover, the new approach yields by far the best lower bounds on most of the instances of metric QAPs that we considered.The authors gratefully acknowledge financial support by the Christian Doppler Laboratorium für Diskrete Optimierung.     

On Rosenbloom and Tsfasman's generalization of the Hamming space

Rosenbloom and Tsfasman introduced a generalization of the Hamming metric, motivated by a model of information transmission over parallel channels, and obtained bounds on the cardinality of codes in the induced finite metric space. In the present paper, some new bounds are given and the analogue of the Plotkin bound is improved. Furthermore, the following problem together with some results is presented: which are the parameters such that there exist codes meeting the Singleton bound in the new space? The binary case is solved.     

Two geometric inequalities for the torus

Given an arbitrary Riemannian metric on the torus, a sharp lower bound for the area and a sharp upper bound for the first eigenvalue of the Laplacian is given in terms of the primitive length spectrum.     

Error bounds in the gap metric for dissipative balanced approximations

We derive an error bound in the gap metric for positive real balanced truncation and positive real singular perturbation approximation. We prove these results by working in the context of dissipative driving-variable systems, as in behavioral and state/signal systems theory. In such a framework no prior distinction is made between inputs and outputs. Dissipativity preserving balanced truncation of dissipative driving-variable systems is addressed and a gap metric error bound is obtained. Bounded real and positive real input–state–output systems are manifestations of a dissipative driving-variable system through particular decompositions of the signal space. Under such decompositions the existing bounded real and positive real balanced truncation schemes can be seen as special cases of dissipative balanced truncation and the new positive real error bounds follow.     

On the first eigenvalue of the mean finsler-laplacian

In this paper, we prove that several different definitions of the Finsler-Laplacian are equivalent. Then we prove that any Berwald metric is affinely equivalent to its mean metric and give some upper or lower bound estimates for the first eigenvalue of the mean Laplacian on Berwald manifolds, which generalize some results in Riemannian geometry.     

A rigidity theorem in Alexandrov spaces with lower curvature bound

Distance functions of metric spaces with lower curvature bound, by definition, enjoy various metric inequalities; triangle comparison, quadruple comparison and the inequality of Lang–Schroeder–Sturm. The purpose of this paper is to study the extremal cases of these inequalities and to prove rigidity results. The spaces which we shall deal with here are Alexandrov spaces which possibly have infinite dimension and are not supposed to be locally compact.     

Topological lower bounds on the distance between area preserving diffeomorphisms

Area preserving diffeomorphisms of the 2-disk which are Identity near the boundary form a group which can be equipped, using theL ²-norm on its Lie algebra, with a right invariant metric. In this paper we give a lower bound on the distance between diffeomorphisms which is invariant under area preserving changes of coordinates and which improves the lower bound induced by the Calabi invariant. In the case of renormalizable and infinitely renormalizable maps, our estimate can be improved and computed.     

The Socle of a Metric n-Lie Algebra

We define the socle of an n-Lie algebra as the sum of all the minimal ideals. An n-Lie algebra is called metric if it is endowed with an invariant nondegenerate symmetric bilinear form. We characterize the socle of a metric n-Lie algebra, which is closely related to the radical and the center of the metric n-Lie algebra. In particular, the socle of a metric n-Lie algebra is reductive, and a metric n-Lie algebra is solvable if and only if the socle coincides with its center. We also calculate the metric dimensions of simple and reductive n-Lie algebras and give a lower bound in the nonreductive case.