Explicit uniform bounds on integrals of Bessel functions and trace theorems for Fourier transforms

Explicit and partly sharp estimates are given of integrals over the square of Bessel functions with an integrable weight which can be singular at the origin. They are uniform with respect to the order of the Bessel functions and provide explicit bounds for some smoothing estimates as well as for the L² restrictions of Fourier transforms onto spheres in which are independent of the radius of the sphere. For more special weights these restrictions are shown to be Hölder continuous with a Hölder constant having this independence as well. To illustrate the use of these results a uniform resolvent estimate of the free Dirac operator with mass in dimensions is derived.     

Errata and addendum to “On the prime geodesic theorem for hyperbolic ‐manifolds” Math. Nachr. 291 (2018), no. 14–15, 2160–2167

We correct the exponent in the error term of the prime geodesic theorem for hyperbolic 3‐manifolds 1 and in Park's theorem for higher dimensions [ 3 , 2 ].     

Capable Lie algebras with the derived subalgebra of dimension 2 over an arbitrary field

In this paper, we classify all capable nilpotent Lie algebras with the derived subalgebra of dimension 2 over an arbitrary field. Moreover, the explicit structure of such Lie algebras of class 3 is given.     

Generalized sensitivity analysis of nonlinear programs using a sequence of quadratic programs

ABSTRACT

Local sensitivity information is obtained for KKT points of parametric NLPs that may exhibit active set changes under parametric perturbations; under appropriate regularity conditions, computationally relevant generalized derivatives of primal and dual variable solutions of parametric NLPs are calculated. Ralph and Dempe obtained directional derivatives of solutions of parametric NLPs exhibiting active set changes from the unique solution of an auxiliary quadratic program. This article uses lexicographic directional derivatives, a newly developed tool in nonsmooth analysis, to generalize the classical NLP sensitivity analysis theory of Ralph and Dempe. By viewing said auxiliary quadratic program as a parametric NLP, the results of Ralph and Dempe are applied to furnish a sequence of coupled QPs, whose unique solutions yield generalized derivative information for the NLP. A practically implementable algorithm is provided. The theory developed here is motivated by widespread applications of nonlinear programming sensitivity analysis, such as in dynamic control and optimization problems.     

含参广义集值强向量平衡问题的稳定性

本文借助集合极限的性质和弱f-性假设证明了含参广义集值强向量平衡问题解集映射的下半连续性,其方法不同于最近文献(Zhao,2016和Meng,2018).此外,建立了含参广义集值强向量平衡问题解集连通性的充分条件,并举例验证了所得结果的正确性.本文得结果推广和改进了已有文献(Gong,2008,Xu,2009,Chen,2010,Xu,2013和Zhao,2013)中相应结果.     

Characterizations of ( m,n )-Jordan Derivations and ( m,n )-Jordan Derivable Mappings on Some Algebras

Let R be a ring, M be a R-bimodule and m, n be two fixed nonnegative integers with m + n = 0. An additive mapping δ from R into M is called an(m, n)-Jordan derivation if(m +n)δ(A~2) = 2 mAδ(A) + 2nδ(A)A for every A in R. In this paper, we prove that every(m, n)-Jordan derivation with m = n from a C*-algebra into its Banach bimodule is zero. An additive mappingδ from R into M is called a(m, n)-Jordan derivable mapping at W in R if(m + n)δ(AB + BA) =2mδ(A)B + 2 mδ(B)A + 2 nAδ(B) + 2 nBδ(A) for each A and B in R with AB = BA = W. We prove that if M is a unital A-bimodule with a left(right) separating set generated algebraically by all idempotents in A, then every(m, n)-Jordan derivable mapping at zero from A into M is identical with zero. We also show that if A and B are two unital algebras, M is a faithful unital(A, B)-bimodule and U = [A M N B] is a generalized matrix algebra, then every(m, n)-Jordan derivable mapping at zero from U into itself is equal to zero.     

Law of the iterated logarithm for random graphs

A milestone in probability theory is the law of the iterated logarithm (LIL), proved by Khinchin and independently by Kolmogorov in the 1920s, which asserts that for iid random variables with mean 0 and variance 1 In this paper we prove that LIL holds for various functionals of random graphs and hypergraphs models. We first prove LIL for the number of copies of a fixed subgraph H. Two harder results concern the number of global objects: perfect matchings and Hamiltonian cycles. The main new ingredient in these results is a large deviation bound, which may be of independent interest. For random k‐uniform hypergraphs, we obtain the Central Limit Theorem and LIL for the number of Hamilton cycles.