Heat Kernel Bounds on Metric Measure Spaces and Some Applications

Let (X,d,μ) be a RCD^?(K,N) space with \(K\in \mathbb {R}\) and N∈[1,∞). We derive the upper and lower bounds of the heat kernel on (X,d,μ) by applying the parabolic Harnack inequality and the comparison principle, and then sharp bounds for its gradient, which are also sharp in time. For applications, we study the large time behavior of the heat kernel, the stability of solutions to the heat equation, and show the L^p boundedness of (local) Riesz transforms.     

On the Geometry of Metric Measure Spaces with Variable Curvature Bounds

Motivated by a classical comparison result of J. C. F. Sturm, we introduce a curvature-dimension condition CD(k, N) for general metric measure spaces, variable lower curvature bound \(k\) and upper dimension bound \(N\ge 1\). In the case of non-zero constant lower curvature, our approach coincides with the celebrated condition that was proposed by Sturm (Acta Math 196(1):133–177, 2006). We prove several geometric properties as sharp Bishop–Gromov volume growth comparison or a sharp generalized Bonnet–Myers theorem (Schneider’s Theorem). In addition, the curvature-dimension condition is stable with respect to measured Gromov–Hausdorff convergence, and it is stable with respect to tensorization of finitely many metric measure spaces provided a non-branching condition is assumed. We also briefly describe possible extensions for variable dimension bounds.     

On Measure Contraction Property without Ricci Curvature Lower Bound

Measure contraction properties M C P (K, N) are synthetic Ricci curvature lower bounds for metric measure spaces which do not necessarily have smooth structures. It is known that if a Riemannian manifold has dimension N, then M C P (K, N) is equivalent to Ricci curvature bounded below by K. On the other hand, it was observed in Rifford (Math. Control Relat. Fields 3(4), 467–487 2013) that there is a family of left invariant metrics on the three dimensional Heisenberg group for which the Ricci curvature is not bounded below. Though this family of metric spaces equipped with the Harr measure satisfy M C P (0,5). In this paper, we give sufficient conditions for a 2n+1 dimensional weakly Sasakian manifold to satisfy M C P (0, 2n + 3). This extends the above mentioned result on the Heisenberg group in Rifford (Math. Control Relat. Fields 3(4), 467–487 2013).     

Volume Growth and the Topology of Manifolds with Nonnegative Ricci Curvature

Let M ⁿ be a complete, open Riemannian manifold with Ric≥0. In 1994, Grigori Perelman showed that there exists a constant δ _n >0, depending only on the dimension of the manifold, such that if the volume growth satisfies \(\alpha_{M}:=\lim_{r\rightarrow \infty}\frac{\operatorname{Vol}(B_{p}(r))}{\omega_{n}r^{n}}\geq 1-\delta_{n}\), then M ⁿ is contractible. Here we employ the techniques of Perelman to find specific lower bounds for the volume growth, α(k,n), depending only on k and n, which guarantee the individual k-homotopy group of M ⁿ is trivial.     

<Emphasis Type="Italic">N</Emphasis>-extended symplectic connections in almost contact metric spaces

On a manifold with an almost contact metric structure we introduce the notions of intrinsic connection, N-extended connection and N-connection. It is shown that the Tanaka–Webster and Schouten–van Kampen connections are special cases of N-connection. We define new classes of N-connections, namely, the Vagner connection and canonical metric N-connection. We also define N-extended symplectic connection. It is proved that the N-extended symplectic connection exists on any manifold with a contact metric structure.     

Entropy numbers and interpolation

This paper settles a long-standing question by showing that in certain circumstances the entropy numbers of a map do not behave well under real interpolation. To do this, lemmas of combinatorial type are established and used to obtain lower bounds for the entropy numbers of a particular diagonal map acting between Lorentz sequence spaces. These lower bounds contradict the estimates from above that would be obtained if the behaviour of entropy numbers under real interpolation was as good as conjectured. The paper also provides sharp two-sided estimates of the entropy number e _n (T) of diagonal operators \({T:l_{p}\rightarrow l_{q}, T(\left( a_{k}\right)_{k=1}^{\infty}) = (( \lambda_{k}a_{k}) _{k=1}^{\infty}) ,}\) where 0 < p < q ≤ ∞ and \({\{\lambda _{i}\}_{i=1}^{\infty}}\) is a non-increasing sequence of non-negative numbers with λ _i  = λ _n for all i ≤ n.     

Szasz Analytic Functions and Noncompact Kähler Toric Manifolds

We show that the classical Szasz analytic function S _N (f)(x) is obtained by applying the pseudo-differential operator f(N ^?1 D _θ ) to the Bergman kernels for the Bargmann–Fock space. The expression generalizes immediately to any smooth polarized noncompact complete toric Kähler manifold, defining the generalized Szasz analytic function \(S_{h^{N}}(f)(x)\). About \(S_{h^{N}}(f)(x)\), we prove that it admits complete asymptotics and there exists a universal scaling limit. As an example, we will further compute \(S_{h^{N}}(f)(x)\) for the Bergman metric on the unit ball.     

The Local Metric Dimension of Strong Product Graphs

A vertex \(v\in V(G)\) is said to distinguish two vertices \(x,y\in V(G)\) of a nontrivial connected graph G if the distance from v to x is different from the distance from v to y. A set \(S\subset V(G)\) is a local metric generator for G if every two adjacent vertices of G are distinguished by some vertex of S. A local metric generator with the minimum cardinality is called a local metric basis for G and its cardinality, the local metric dimension of G. It is known that the problem of computing the local metric dimension of a graph is NP-Complete. In this paper we study the problem of finding exact values or bounds for the local metric dimension of strong product of graphs.     

Lower bounds on the signed total k-domination number of graphs

Let G be a graph with vertex set V(G). For any integer k ≥ 1, a signed total k-dominating function is a function f: V(G) → {?1, 1} satisfying ∑_x∈N(v)f(x) ≥ k for every v ∈ V(G), where N(v) is the neighborhood of v. The minimum of the values ∑_v∈V(G)f(v), taken over all signed total k-dominating functions f, is called the signed total k-domination number. In this note we present some new sharp lower bounds on the signed total k-domination number of a graph. Some of our results improve known bounds.     

The Einstein-Kähler metric on the third Cartan-Hartogs domain

In this paper we discuss the Einstein-Kahler metric on the third Cartan-Hartogs domain Y111（n, q; K）. Firstly we get the complete Einstein Kahler metric with explicit form on Y111（n, q; K） in the case of K=q/2 ＋ 1/q-1. Secondly we obtain the holomorphic sectional curvature under this metric and get the sharp estimate for this holomorphic curvature. Finally we prove that the complete Einstein-Kahler metric is equivalent to the Bergman metric on Y111（n, q; K） in case of K=q/2＋1/q-1.     

BMO and exponential Orlicz space estimates of the discrepancy function in arbitrary dimension

In the current paper, we obtain discrepancy estimates in exponential Orlicz and BMO spaces in arbitrary dimension d ≥ 3. In particular, we use dyadic harmonic analysis to prove that the dyadic product BMO and exp(L^2/(d?1)) norms of the discrepancy function of so-called digital nets of order two are bounded above by (logN)^(d?1)/2. The latter bound has been recently conjectured in several papers and is consistent with the best known low-discrepancy constructions. Such estimates play an important role as an intermediate step between the well-understood L_p bounds and the notorious open problem of finding the precise L_∞ asymptotics of the discrepancy function in higher dimensions, which is still elusive.     

Rectifier Circuits of Bounded Depth

Asymptotically tight bounds are obtained for the complexity of computation of the classes of (m, n)-matrices with entries from the set {0, 1,..., q ? 1} by rectifier circuits of bounded depth d, under some relations between m, n, and q. In the most important case of q = 2, it is shown that the asymptotics of the complexity of Boolean (m, n)-matrices, log n = o(m), logm = o(n), is achieved for the circuits of depth 3.     

Geometric interpretation of the Wagner curvature tensor in the case of a manifold with contact metric structure

Considering a manifold (φ, ξ, η, g, X, D) with contact metric structure, we introduce the concept of N-extended connection (connection on a vector bundle (D, π,X)), with N an endomorphism of the distribution D, and show that the curvature tensor of each N-extended connection for a suitably chosen endomorphism N coincides with the Wagner curvature tensor.     

The relative Chebyshev centers of finite sets in geodesic spaces

In the present paper we estimate variation in the relative Chebyshev radius R _W (M), where M and W are nonempty bounded sets of a metric space, as the sets M and W change. We find the closure and the interior of the set of all N-nets each of which contains its unique relative Chebyshev center, in the set of all N-nets of a special geodesic space endowed by the Hausdorff metric. We consider various properties of relative Chebyshev centers of a finite set which lie in this set.     

An elementary proof of the <Emphasis Type="Italic">A</Emphasis><Subscript>2</Subscript> bound

A martingale transform T, applied to an integrable locally supported function f, is pointwise dominated by a positive sparse operator applied to |f|, the choice of sparse operator being a function of T and f. As a corollary, one derives the sharp A _p bounds for martingale transforms, recently proved by Thiele-Treil-Volberg, as well as a number of new sharp weighted inequalities for martingale transforms. The (very easy) method of proof (a) only depends upon the weak-L ¹ norm of maximal truncations of martingale transforms, (b) applies in the vector valued setting, and (c) has an extension to the continuous case, giving a new elementary proof of the A ² bounds in that setting.     

Some refined bounds for the perturbation of the orthogonal projection and the generalized inverse

In this paper, we consider the perturbation of the orthogonal projection and the generalized inverse for an n × n matrix A and present some perturbation bounds for the orthogonal projections on the rang spaces of A and A^?, respectively. A combined bound for the orthogonal projection on the rang spaces of A and A^? is also given. The proposed bounds are sharper than the existing ones. From the combined bounds of the orthogonal projection on the rang spaces of A and A^?, we derived new perturbation bounds for the generalized inverse, which always improve the existing ones. The combined perturbation bound for the orthogonal projection and the generalized inverse is also given. Some numerical examples are given to show the advantage of the new bounds.     

On Jordan’s inequality

We present sharp upper and lower bounds for the function \(\sin (x)/x\). Our bounds are polynomials of degree 2n, where n is any nonnegative integer.     

Sharp Bounds for Exponential Approximations of NWUE Distributions

Let F be an NWUE distribution with mean 1 and G be the stationary renewal distribution of F. We would expect G to converge in distribution to the unit exponential distribution as its mean goes to 1. In this paper, we derive sharp bounds for the Kolmogorov distance between G and the unit exponential distribution, as well as between G and an exponential distribution with the same mean as G. We apply the bounds to geometric convolutions and to first passage times.     

On the Metric Dimension of Imprimitive Distance-Regular Graphs

A resolving set for a graph \({\Gamma}\) is a collection of vertices S, chosen so that for each vertex v, the list of distances from v to the members of S uniquely specifies v. The metric dimension of \({\Gamma}\) is the smallest size of a resolving set for \({\Gamma}\). Much attention has been paid to the metric dimension of distance-regular graphs. Work of Babai from the early 1980s yields general bounds on the metric dimension of primitive distance-regular graphs in terms of their parameters. We show how the metric dimension of an imprimitive distance-regular graph can be related to that of its halved and folded graphs. We also consider infinite families (including Taylor graphs and the incidence graphs of certain symmetric designs) where more precise results are possible.     

On the failure of concentration for the ℓ∞-ball

Let (X, d) be a compact metric space and µ a Borel probability on X. For each N ≥ 1 let d_∞^N be the ?_∞-product on X^N of copies of d, and consider 1-Lipschitz functions X^N → ? for d_∞^N.