Sums of series of Rogers dilogarithm functions

Some sums of series of Rogers dilogarithm functions are established by Abel’s functional equation.      

Hierarchies of sum rules for squares of spherical Bessel functions

A four-term recurrence relation for squared spherical Bessel functions is shown to yield closed-form expressions for several types of finite weighted sums of these functions. The resulting sum rules, which may contain an arbitrarily large number of terms, are found to constitute three independent hierarchies. Their use leads to an efficient numerical evaluation of these sums.     

Asymptotic stability of monostable wavefronts in discrete-time integral recursions

The aim of this work is to study the traveling wavefronts in a discrete-time integral recursion with a Gauss kernel in R2.We first establish the existence of traveling wavefronts as well as their precise asymptotic behavior.Then,by employing the comparison principle and upper and lower solutions technique,we prove the asymptotic stability and uniqueness of such monostable wavefronts in the sense of phase shift and circumnutation.We also obtain some similar results in R.     

Construction of nested orthogonal arrays

A (symmetric) nested orthogonal array is a symmetric orthogonal array OA(N,k,s,g) which contains an OA(M,k,r,g) as a subarray, where M<N and r<s. In this communication, some methods of construction of nested symmetric orthogonal arrays are given. Asymmetric nested orthogonal arrays are defined and a few methods of their construction are described.     

Explicit Evaluation of Euler and Related Sums

Ever since the time of Euler, the so-called Euler sums have been evaluated in many different ways. We give here a (presumably) new proof of the classical Euler sum. We show that several interesting analogues of the Euler sums can be evaluated by systematically analyzing some known summation formulas involving hypergeometric series. Many other identities related to the Euler sums are also presented. Research of the first author was supported by Korea Science and Engineering Foundation Grant R05-2003-10441-0. Research of the second author was supported by the Natural Sciences and Engineering Research Council of Canada Grant OGP0007353. 2000 Mathematics Subject Classification: Primary–11M06, 33B15, 33E20; Secondary–11M35, 11M41, 33C20     

On the denesting of nested square roots

We present the basic theory of denesting nested square roots, from an elementary point of view, suitable for lower level coursework. Necessary and sufficient conditions are given for direct denesting, where the nested expression is rewritten as a sum of square roots of rational numbers, and for indirect denesting, where the nested expression is rewritten as a sum of fourth-order roots of rational numbers. The theory is illustrated with several solved examples.     

Relative difference sets,graphs and inequivalence of functions between groups

For cryptographic purposes, we want to find functions with both low differential uniformity and dissimilarity to all linear functions and to know when such functions are essentially different. For vectorial Boolean functions, extended affine equivalence and the coarser Carlet–Charpin–Zinoviev (CCZ) equivalence are both used to distinguish between nonlinear functions. It remains hard to tell when CCZ equivalent functions are EA‐inequivalent. This paper presents a framework for solving this problem in full generality, for functions between arbitrary finite groups. This common framework is based on relative difference sets (RDSs). The CCZ and EA equivalence classes of perfect nonlinear (PN) functions are each derived, by quite different processes, from equivalence classes of splitting semiregular RDSs. By generalizing these processes, we obtain a much strengthened formula for all the graph equivalences which define the EA equivalence class of a given function, amongst those which define its CCZ equivalence class. © 2010 Wiley Periodicals, Inc. J Combin Designs 18: 260–273, 2010     

Local topological equivalence of nonsmooth functions in Hilbert spaces

In this paper we investigate the relation between nonsmooth functions with domain in a Hilbert space and their local approximations. We consider Lipschitz functions and define an approximation model with directional derivatives. The qualitative behaviour of the approximation is studied by means of the concept of topological equivalence. Using this concept we establish the existence of a local coordinate transformation between the original function and the local approximation.     

随机套分类模型中方差分量区间估计的改进

首先给出了随机套分类模型中方差分量基于由方差分析产生的平方和的区间估计.然后以此为基础进行了改进,推导出了同时依赖于均值与平方和的区间估计.二者的区间长度相同,但后者有较高的置信度.     

亏格为4黎曼曲面上循环群作用的拓扑分类

本文主要考虑循环群作用 Riemann曲面的分类问题 ,我们列出了所有的循环群作用亏格为 4Riem ann曲面的拓扑分类和弱拓扑分类     

Universal Affine Classification of Boolean Functions

In this paper we advance a practical solution of the classification problem of Boolean functions by the affine group – the largest group of linear transformations of variables. We show that the affine types (equivalence classes) can be arranged in a unique infinite sequence which contains all previous lists of types. The types are specified by their minimal representatives, spectral invariants, and stabilizer orders. A brief survey of the fundamental transformation groups is included.     

Convergence of two-dimensional branching recursions

The asymptotic distribution of branching type recursions (L_n) of the form is investigated in the two-dimensional case. Here is an independent copy of L_n−1 and A,B are random matrices jointly independent of . The asymptotics of L_n after normalization are derived by a contraction method. The limiting distribution is characterized by a fixed point equation. The assumptions of the convergence theorem are checked in some examples using eigenvalue decompositions and computer algebra.     

A New Method for Investigating Euler Sums

Euler discovered a recursion formula for the Riemann zeta function evaluated at the even integers. He also evaluated special Dirichlet series whose coefficients are the partial sums of the harmonic series. This paper introduces a new method for deducing Euler's formulas as well as a host of new relations, not only for the zeta function but for several allied functions.     

Numerically satisfactory solutions of hypergeometric recursions

Each family of Gauss hypergeometric functions

for fixed (not all equal to zero) satisfies a second order linear difference equation of the form

Because of symmetry relations and functional relations for the Gauss functions, many of the 26 cases (for different values) can be transformed into each other. In this way, only with four basic difference equations can all other cases be obtained. For each of these recurrences, we give pairs of numerically satisfactory solutions in the regions in the complex plane where , and being the roots of the characteristic equation.

     

The ABC of hyper recursions

Each member of the family of Gauss hypergeometric functions

f_n=₂F₁(a+ε₁n,b+ε₂n;c+ε₃n;z),