ON UNIFORM APPROXIMATION BY PARTIAL SUMS OF JACOBI SERIES ON ELLIPTIC REGION

In this paper, we discuss the relation between the partial sums of Jacobi serier onan elliptic region and the corresponding partial sums of Fourier series. From this we derivea precise approximation formula by the partial sums of Jacobi series on an elliptic region.     

避免$2$字母符号模式的具有偶数个符号的带符号排列

Let Dn be the set of all signed permutations on [n] = {1,... ,n} with even signs, and let ：Dn（T） be the set of all signed permutations in Dn which avoids a set T of signed patterns. In this paper, we find all the cardinalities of the sets Dn（T） where T B2. Some of the cardinalities encountered involve inverse binomial coefficients, binomial coefficients, Catalan numbers, and Fibonacci numbers.     

An almost sure central limit theorem for self-normalized weighted sums

Let X, X1 , X2 , ··· be a sequence of nondegenerate i.i.d. random variables with zero means, which is in the domain of attraction of the normal law. Let {a ni , 1≤i≤n, n≥1} be an array of real numbers with some suitable conditions. In this paper, we show that a central limit theorem for self-normalized weighted sums holds. We also deduce a version of ASCLT for self-normalized weighted sums.     

$B$值独立随机元序列加权和的完全收敛性和强大数律

In this paper, we obtain theorems of complete convergence and strong laws of large numbers for weighted sums of sequences of independent random elements in a Banach space of type p （1 ≤ p ≤ 2）. The results improve and extend the corresponding results on real random variables obtained by [1] and [2].     

两两NQD序列部分和的强大数定律

By using the moment inequality, maximal inequality and the truncated method of random variables, we establish the strong law of large numbers of partial sums for pairwise NQD sequences, which extends the corresponding result of pairwise NQD random variables.     

Strong Laws of Large Numbers for Weighted Sums of Ч-mixing Sequence

In this paper, strong laws of large numbers for weighted sums of Ч-mixing sequence are investigated. Our results extend the corresponding results for negatively associated sequence to the case of Ч-mixing sequence.     

Precise Large Deviations for Sums of Negatively Associated Random Variables with Common Dominatedly Varying Tails

In this paper, we obtain results on precise large deviations for non-random and random sums of negatively associated nonnegative random variables with common dominatedly varying tail distribution function. We discover that, under certain conditions, three precise large-deviation prob- abilities with different centering numbers are equivalent to each other. Furthermore, we investigate precise large deviations for sums of negatively associated nonnegative random variables with certain negatively dependent occurrences. The obtained results extend and improve the corresponding results of Ng, Tang, Yan and Yang （J. Appl. Prob., 41, 93-107, 2004）.     

A NOTE ON A STRONG UNIQUENESS THEOREM OF STRAUSS

In this paper we present a correction of the proofofa strong uniqueness theorem given by H.Strauss in1992 on approximation by reciprocals of functions of an n-dimensional space span (u_1,…,u_n) satisfyingcoefficient constraints.     

Complete Convergence for Weighted Sums of WOD Random Variables

In this article, we study the complete convergence for weighted sums of widely orthant dependent random variables. By using the exponential probability inequality, we establish a complete convergence result for weighted sums of widely orthant dependent ran-dom variables under mild conditions of weights and moments. The result obtained in the paper generalizes the corresponding ones for independent random variables and negatively dependent random variables.     

Inequalities of Maximum of Partial Sums and Weak Convergence for a Class of Weak Dependent Random Variables

In this paper, we establish a Rosenthal-type inequality of the maximum of partial sums for ρ^- -mixing random fields. As its applications we get the Hájeck -Rènyi inequality and weak convergence of sums of ρ^- -mixing sequence. These results extend related results for NA sequence and p^＊ -mixing random fields,     

Fibonacci数列倒数的无穷和

利用初等方法以及取整函数的性质研究了Fibonacci数列三次倒数的求和问题,获得了该和式倒数取整后的确切值,也就是给出了一个包含Fibonacci数列有趣的恒等式.     

The infinite sum of reciprocal Pell numbers

In this paper, we consider infinite sums derived from the reciprocals of the Pell numbers. Then applying the floor function to the reciprocals of this sums, we obtain a new and interesting identity involving the Pell numbers.     

Some alternating sums of Lucas numbers

We consider alternating sums of squares of odd and even terms of the Lucas sequence and alternating sums of their products. These alternating sums have nice representations as products of appropriate Fibonacci and Lucas numbers.     

On the Adjacency-Jacobsthal numbers

In this article, we define the adjacency-Jacobsthal sequence and then we obtain the combinatorial representations and the sums of adjacency-Jacobsthal numbers by the aid of generating function and generating matrix of the adjacency-Jacobsthal sequence. Also, we derive the determinantal and the permanental representations of adjacency-Jacobsthal numbers by using certain matrices which are obtained from generating matrix of adjacency-Jacobsthal numbers. Furthermore, using the roots of characteristic polynomial of the adjacency-Jacobsthal sequence, we produce the Binet formula for adjacency-Jacobsthal numbers. Finally, we give the relationships between adjacency-Jacobsthal numbers and Fibonacci, Pell, and Jacobsthal numbers.     

Combinatorial numbers in binary recurrences

We give several effective and explicit results concerning the values of some polynomials in binary recurrence sequences. First we provide an effective finiteness theorem for certain combinatorial numbers (binomial coefficients, products of consecutive integers, power sums, alternating power sums) in binary recurrence sequences, under some assumptions. We also give an efficient algorithm (based on genus 1 curves) for determining the values of certain degree 4 polynomials in such sequences. Finally, partly by the help of this algorithm we completely determine all combinatorial numbers of the above type for the small values of the parameter involved in the Fibonacci, Lucas, Pell and associated Pell sequences.      

Lacunary Polynomial Sums

Lacunary sums of multinomial coefficients from homogeneous polynomials are examined by explicit equations and recursive formulas. We also determine the special relationship between certain lacunary sums and the Fibonacci and Lucas numbers.     

On the Fibonacci and Lucas p-numbers, their sums, families of bipartite graphs and permanents of certain matrices

In this paper we consider certain generalizations of the well-known Fibonacci and Lucas numbers, the generalized Fibonacci and Lucas p-numbers. We give relationships between the generalized Fibonacci p-numbers, F_p(n), and their sums, , and the 1-factors of a class of bipartite graphs. Further we determine certain matrices whose permanents generate the Lucas p-numbers and their sums.     

The generalized order-k Fibonacci–Pell sequence by matrix methods

In this paper, we consider the usual and generalized order-k Fibonacci and Pell recurrences, then we define a new recurrence, which we call generalized order-k F–P sequence. Also we present a systematic investigation of the generalized order-k F–P sequence. We give the generalized Binet formula, some identities and an explicit formula for sums of the generalized order-k F–P sequence by matrix methods. Further, we give the generating function and combinatorial representations of these numbers. Also we present an algorithm for computing the sums of the generalized order-k Pell numbers, as well as the Pell numbers themselves.     

Wythoff partizan subtraction

We introduce a class of normal-play partizan games, called Complementary Subtraction. These games are instances of Partizan Subtraction where we take any set A of positive integers to be Left’s subtraction set and let its complement be Right’s subtraction set. In wythoff partizan subtraction we take the set A and its complement B from wythoff nim, as the two subtraction sets. As a function of the heap size, the maximum size of the canonical forms grows quickly. However, the value of the heap is either a number or, in reduced canonical form, a switch. We find the switches by using properties of the Fibonacci word and standard Fibonacci representations of integers. Moreover, these switches are invariant under shifts by certain Fibonacci numbers. The values that are numbers, however, are distinct, and we can find their binary representation in polynomial time using a representation of integers as sums of Fibonacci numbers, known as the ternary (or “the even”) Fibonacci representation.     

Notes on superstrings and the infinite sums of Fibonacci and Lucas numbers

Based on infinite sums of Fibonacci and Lucas numbers, a heuristic derivation of the dimensionality of heterotic superstrings is presented. Connections to quantum chaos are briefly explored.