B-值双随机Dirchlet级数的收敛性

主要研究了B-值双随机Dirichlet级数在不同条件(i){Xn}服从强大数定律,且 (ii){Xn}独立不同分布,且 等条件下的收敛性,得出了收敛横坐标的简洁公式．     

两两PQD序列的完全收敛性和强大数定律

给出两两PQD序列部分和的几个不等式,研究了一类广泛的随机变量序列两两PQD列的收敛性质,得到了与PA序列相类似的完全收敛性和强大数定律的结果.     

含有大的悬挂树图的Ramseygoodness结论(英文)

设H是阶为n的连通图.在H的某一个顶点上悬挂一棵阶为j的树,得到图H_j,用H_j表示这样的图形族.本文证明:当j充分大时,有r(G,H_j)=(x(G)-1)(n+j-1)+s(G),其中x(G),s(G)分别表示图G的色数和色数剩余.     

离散随机变量序列的强偏差定理

利用分析方法建立了用不等式表示的用对数似然比刻划的任意相依离散随机变量序列的强偏差定理,作为推论得到了更一般的离散随机变量序列加权和的强大数定律.     

Conditioning of Random Conic Systems Under a General Family of Input Distributions

We consider the conic feasibility problem associated with the linear homogeneous system Ax≤0, x≠0. The complexity of iterative algorithms for solving this problem depends on a condition number C(A). When studying the typical behavior of algorithms under stochastic input, one is therefore naturally led to investigate the fatness of the tails of the distribution of C(A). Introducing the very general class of uniformly absolutely continuous probability models for the random matrix A, we show that the distribution tails of C(A) decrease at algebraic rates, both for the Goffin–Cheung–Cucker number C _G and the Renegar number C _R . The exponent that drives the decay arises naturally in the theory of uniform absolute continuity, which we also develop in this paper. In the case of C _G , we also discuss lower bounds on the tail probabilities and show that there exist absolutely continuous input models for which the tail decay is subalgebraic. R. Hauser was supported by a grant of the Nuffield Foundation under the “Newly Appointed Lecturers” grant scheme (project number NAL/00720/G) and through grant GR/S34472 from the Engineering and Physical Sciences Research Council of the UK. The research in this paper was conducted while T. Müller was a research student at the University of Oxford. He was partially supported by EPSRC, the Oxford University Department of Statistics, Bekker-la-Bastide fonds, Dr. Hendrik Muller’s Vaderlandsch fonds, and Prins Bernhard Cultuurfonds.     

On Taylor-like integral representations of analytic functions

Let f be an analytic function in a complex domain D and (without loss of generality) assume 0∈D. Then the paper’s aim is to derive a Taylor-like integral expression for f, i.e. an integral representation analogous to the corresponding power series, say, ∑ _k=0^∞ a _k t ^k /k!. We start from the simplest case f(t)=e ^t , which leads to the identity

The physics of categorization

In the context of cognition, categorization is the process through which several elements (i.e., words) are grouped into a single set which by naming becomes an abstraction of its elements. For example, tiger, kitty, and max can be categorized as Cats. In this article, we aim to show how the physical, biological and cognitive dimensions are related in the process of categorization or abstraction through the physics of computation. Drawing on Landauer's principle, we show that the price paid in terms of entropy is higher when grouping elements of low ranking (high probability) than when grouping elements of high ranking (low probability). Therefore, the logic of the cognitive process of abstraction is explained through constraints imposed by memory on the computation of categories. © 2015 Wiley Periodicals, Inc. Complexity 21: 269–274, 2016     

On the solutions of a higher‐order difference equation in terms of generalized Fibonacci sequences

This paper deals with the solutions, stability character, and asymptotic behavior of the difference equation where and the initial values x_?k,x_{?k + 1},…,x₀ are nonzero real numbers, such that their solutions are associated to Horadam numbers. Copyright © 2015 John Wiley & Sons, Ltd.     

Hypercomplex analysis and integration of systems of ordinary differential equations

We review the theory of hypercomplex numbers and hypercomplex analysis with the ultimate goal of applying them to issues related to the integration of systems of ordinary differential equations (ODEs). We introduce the notion of hypercomplexification, which allows the lifting of some results known for scalar ODEs to systems of ODEs. In particular, we provide another approach to the construction of superposition laws for some Riccati‐type systems, we obtain invariants of Abel‐type systems, we derive integrable Ermakov systems through hypercomplexification, we address the problem of linearization by hypercomplexification, and we provide a solution to the inverse problem of the calculus of variations for some systems of ODEs. Copyright © 2016 John Wiley & Sons, Ltd.     

A note on powers in finite fields

The study of solutions to polynomial equations over finite fields has a long history in mathematics and is an interesting area of contemporary research. In recent years, the subject has found important applications in the modelling of problems from applied mathematical fields such as signal analysis, system theory, coding theory and cryptology. In this connection, it is of interest to know criteria for the existence of squares and other powers in arbitrary finite fields. Making good use of polynomial division in polynomial rings over finite fields, we have examined a classical criterion of Euler for squares in odd prime fields, giving it a formulation that is apt for generalization to arbitrary finite fields and powers. Our proof uses algebra rather than classical number theory, which makes it convenient when presenting basic methods of applied algebra in the classroom.