Using Fox Derivatives in Treating Groups of the Form F/[R′, F]

For a factor group with respect to periodic part of a group of the form F/[R′, F], an embedding in the matrix group is defined. The criteria for a matrix to belong to an image of this group and for elements to be conjugate are specified. Some statements having a direct bearing on groups of the form in question are proved. Application of the results obtained allows us to refine the answer in [7] to a question by O. Chapuis concerning the universal classification of ∀-free soluble groups with two generators. Supported by RFBR grant No. 02-01-00293 and by FP “Universities of Russia” grant No. UR.04.01.227. __________ Translated from Algebra i Logika, Vol. 45, No. 1, pp. 114–125, January–February, 2006.     

Some Penrose transforms in complex differential geometry

In this article, we review a construction in the complex geometry often known as the Penrose transform. We then present two new applications of this transform. One concerns the construction of symmetries of the massless field equations from mathematical physics. The other concerns obstructions to the embedding of CR structures on the three-sphere. Dedicated to Professor Sheng GONG on the occasion of his 75th birthday     

On formulas of Ramanujan and Evans

We give short elementary proofs of a formula of Ramanujan as interpreted by Bradley, and a companion formula originally proved by W. Chu. We also give an elementary proof of a generalization of an identity originally proved using modular functions and used to study a generating function for the number of partitions with specified crank. Research partially supported by NSF grant DMS 99-70865. 2000 Mathematics Subject Classification Primary—39A70, 11P83; Secondary—33C20     

Quantum Bayesian computation

Quantum Bayesian computation is an emerging field that levers the computational gains available from quantum computers. They promise to provide an exponential speed-up in Bayesian computation. Our article adds to the literature in three ways. First, we describe how quantum von Neumann measurement provides quantum versions of popular machine learning algorithms such as Markov chain Monte Carlo and deep learning that are fundamental to Bayesian learning. Second, we describe quantum data encoding methods needed to implement quantum machine learning including the counterparts to traditional feature extraction and kernel embeddings methods. Third, we show how quantum algorithms naturally calculate Bayesian quantities of interest such as posterior distributions and marginal likelihoods. Our goal then is to show how quantum algorithms solve statistical machine learning problems. On the theoretical side, we provide quantum versions of high dimensional regression, Gaussian processes and stochastic gradient descent. On the empirical side, we apply a quantum FFT algorithm to Chicago house price data. Finally, we conclude with directions for future research.     

SYSTEM OF COINCIDENCE THEOREMS IN PRODUCT TOPOLOGICAL SPACES AND APPLICATIONS (Ⅰ)

A new notion of finite continuous topological space (in short, FC-space) with out convexity structure was introduced. A new continuous selection theorem was established in FC-spaces. By applying the continuous selection theorem, some new coincidence theorems for two families of set-valued mappings defined on product space of noncompact FC-spaces are proved under much weak assumptions. These results generalize many known results in recent literature. Some applications will be given in a follow-up paper.     

达布定理和比较定理思想在中值定理类问题中的运用

微分达布定理表明区间内的导函数具有介值性,这使得我们在考虑一些数学分析问题时,往往可以不需要最高阶导函数的连续性.而在微分方程理论中,比较定理的思想对于解的估计非常重要.本文利用比较定理的思想将中值定理类问题转化为微分方程解的估计问题,对于在数学分析的学习中提高学生的认识和兴趣很有意义.     

On martingale tail sums for the path length in random trees

For a martingale (X_n) converging almost surely to a random variable X, the sequence (X_n– X) is called martingale tail sum. Recently, Neininger (Random Structures Algorithms 46 (2015), 346–361) proved a central limit theorem for the martingale tail sum of Régnier's martingale for the path length in random binary search trees. Grübel and Kabluchko (in press) gave an alternative proof also conjecturing a corresponding law of the iterated logarithm. We prove the central limit theorem with convergence of higher moments and the law of the iterated logarithm for a family of trees containing binary search trees, recursive trees and plane‐oriented recursive trees. © 2016 Wiley Periodicals, Inc. Random Struct. Alg., 50, 493–508, 2017     

Corrigendum to “New algebraic properties of an amalgamated algebra along an ideal”

At some point, after publication, we realized that Proposition 4.1(2) and Theorem 4.4 in [2 D’Anna, M., Finocchiaro, C. A., Fontana, M. (2016). New algebraic properties of an amalgamated algebra along an ideal. Commun. Algebra 44(5):1836–1851.[Taylor & Francis Online], [Web of Science ®] , [Google Scholar]] hold under the assumption (not explicitly declared) that B = f(A)+J. Furthermore, we provide here the exact value for the embedding dimension of A?^fJ, also when B≠f(A)+J, under the hypothesis that J is finitely generated as an ideal of the ring f(A)+J.     

具有势函数的弱f-稳态映射的若干结果

本文研究了与拉回度量有关广义泛函Φ_f,H.利用应力能量张量的方法,得到具有势函数的弱f-稳态映射的一些刘维尔型定理.     

Stress Concentration at Interacting Spherical Inclusions in a Transversely Isotropic Body

An elastic-equilibrium problem is rigorously solved for a transversely isotropic body containing a finite number of arbitrarily arranged and oriented transversely isotropic spherical inclusions or an infinite periodic array of such inclusions. The solution is found based on the superposition principle for general solutions of single-particle problems and the addition theorems for partial vector solutions of the elastic equilibrium equations. The numerical results presented allow assessing the influence of matrix anisotropy on the stress concentration between inclusions