Half Inverse Riordan Arrays and Their Related Vertical Recurrence Relation

We discuss two different procedures to study the half Riordan arrays and their inverses. One of the procedures shows that every Riordan array is the half Riordan array of a unique Riordan array. It is well known that every Riordan array has its half Riordan array. Therefore, this paper answers the converse question: Is every Riordan array the half Riordan array of some Riordan arrays? In addition, this paper shows that the vertical recurrence relation of the column entries of the half Riordan array is equivalent to the horizontal recurrence relation of the original Riordan array''s row entries.     

Characterization of $(c)$-Riordan Arrays, Gegenbauer-Humbert-Type Polynomial Sequences, and $(c)$-Bell Polynomials

Here presented are the definitions of(c)-Riordan arrays and(c)-Bell polynomials which are extensions of the classical Riordan arrays and Bell polynomials.The characterization of(c)-Riordan arrays by means of the A-and Z-sequences is given,which corresponds to a horizontal construction of a(c)-Riordan array rather than its definition approach through column generating functions.There exists a one-to-one correspondence between GegenbauerHumbert-type polynomial sequences and the set of(c)-Riordan arrays,which generates the sequence characterization of Gegenbauer-Humbert-type polynomial sequences.The sequence characterization is applied to construct readily a(c)-Riordan array.In addition,subgrouping of(c)-Riordan arrays by using the characterizations is discussed.The(c)-Bell polynomials and its identities by means of convolution families are also studied.Finally,the characterization of(c)-Riordan arrays in terms of the convolution families and(c)-Bell polynomials is presented.     

A Family of Asymmetrical Orthogonal Arrays with Run Sizes 4p^2

Nowadays orthogonal arrays play important roles in statistics, computer science, coding theory and cryptography. The usual difference matrices are essential for the construction of many mixed orthogonal arrays. But there are also many orthogonal arrays, especially mixed-level or asymmetrical which can not be obtained by the usual difference matrices. In order to construct these asymmetrical orthogonal arrays, a class of special matrices, so-called generalized difference matrices, were discovered by Zhang（1989, 1990, 1993） by the orthogonal decompositions of projective matrices. In this article, an interesting equivalent relationship between the orthogonal arrays and the generalized difference matrices is presented. As an application, a family of orthogonal arrays of run sizes 4p2, such as L36（6^13^42^10）, are constructed.     

Numericals for total variation-based reconstruction of motion blurred images

In this paper image with horizontal motion blur, vertical motion blur and angled motion blur are considered. We construct several difference schemes to the highly nonlinear term ·(u)/((|u|)～(1/2)2+β) of the total variation-based image motion deblurring problem. The large nonlinear system is linearized by fixed point iteration method. An algebraic multigrid method with Krylov subspace acceleration is used to solve the corresponding linear equations as in [7]. The algorithms can restore the image very well. We give some numerical experiments to demonstrate that our difference schemes are efficient and robust.     

一类试验次数为4p2的非对称正交表的构造

Nowadays orthogonal arrays play important roles in statistics,computer science, coding theory and cryptography.The usual difference matrices are essential for the con- struction of many mixed orthogonal arrays.But there are also many orthogonal arrays, especially mixed-level or asymmetrical which can not be obtained by the usual difference matrices.In order to construct these asymmetrical orthogonal arrays,a class of special matrices,so-called generalized difference matrices,were discovered by Zhang(1989,1990, 1993) by the orthogonal decompositions of projective matrices.In this article,an interesting equivalent relationship between the orthogonal arrays and the generalized difference matri- ces is presented.As an application,a family of orthogonal arrays of run sizes 4p~2,such as L_(36)(6~13~42~(10)),are constructed.     

Matrix Representation of Recursive Sequences of Order $3$ and Its Applications

Here presented is a matrix representation of recursive number sequences of order $3$ defined by $a_n=pa_{n-1}+qa_{n-2}+ra_{n-3}$ with arbitrary initial conditions $a_0,$ $a_1=0$, and $a_2$ and their special cases of Padovan number sequence and Perrin number sequence with initial conditions $a_0=a_1=0$ and $a_2=1$ and $a_0=3$, $a_1=0$, and $a_2=2$, respectively. The matrix representation is used to construct many well known and new identities of recursive number sequences as well as Pavodan and Perrin sequences.     

Applying Estimation Techniques to a Bar Graph

Bar graphs are convenient for showing comparisons among items．The bars may be either horizontal or vertical,and they are used to show the amounts of different items．Figure 1 is an example of a typical bar graph．The graph shows the average sales price of existing homes in the Northeast United States for three years——1970,1980,and 1997．     

信赖域策略的内点投影既约Hessian方法解非线性约束优化

A interior point scaling projected reduced Hessian method with combination of nonmonotonic backtracking technique and trust region strategy for nonlinear equality constrained optimization with nonegative constraint on variables is proposed. In order to deal with large problems,a pair of trust region subproblems in horizontal and vertical subspaces is used to replace the general full trust region subproblem. The horizontal trust region subproblem in the algorithm is only a general trust region subproblem while the vertical trust region subproblem is defined by a parameter size of the vertical direction subject only to an ellipsoidal constraint. Both trust region strategy and line search technique at each iteration switch to obtaining a backtracking step generated by the two trust region subproblems. By adopting the l1 penalty function as the merit function, the global convergence and fast local convergence rate of the proposed algorithm are established under some reasonable conditions. A nonmonotonic criterion and the second order correction step are used to overcome Maratos effect and speed up the convergence progress in some ill-conditioned cases.     

ON THE INVARIANT SUBMANIFOLDS OF RIEMANNIAN PRODUCT MANIFOLD

In this paper, the vertical and horizontal distributions of an invariant submanifold of a Riemannian product manifold are discussed. An invariant real space form in a Riemannian product manifold is researched. Finally, necessary and sufficient conditions are given on an invariant submanifold of a Riemannian product manifold to be a locally symmetric and real space form.     

A construction of maximal linearly independent array

Let M be a subset of r-dimensional vector space Vτ （F2） over a finite field F2, consisting of n nonzero vectors, such that every t vectors of M are linearly independent over F2. Then M is called （n, t）-linearly independent array of length n over Vτ（F2）. The （n, t）-linearly independent array M that has the maximal number of elements is called the maximal （r, t）-linearly independent array, and the maximal number is denoted by M（r, t）. It is an interesting combinatorial structure, which has many applications in cryptography and coding theory. It can be used to construct orthogonal arrays, strong partial balanced designs. It can also be used to design good linear codes, In this paper, we construct a class of maximal （r, t）-linearly independent arrays of length r ＋ 2, and provide some enumerator theorems.     

Riordan 矩阵的$(m,r,s)$-Halves

Riordan矩阵的垂直一半和水平一半已经被许多学者分别研究过.本文给出了Riordan矩阵的$(m,r,s)$-halves的定义.利用此定义能够统一的讨论Riordan矩阵的垂直一半和水平一半.作为应用,通过对Pascal和Delannoy矩阵的$(m,r,s)$-halves的研究,可以得到了一些与Fibonacci, Pell和Jacobsthal序列相关的等式.     

A symbolic treatment of Riordan arrays

We approach Riordan arrays and their generalizations via umbral symbolic methods. This new approach allows us to derive fundamental aspects of the theory of Riordan arrays as immediate consequences of the umbral version of the classical Abel?s identity for polynomials. In particular, we obtain a novel non-recursive formula for Riordan arrays and derive, from this new formula, some known recurrences and a new recurrence relation for Riordan arrays.     

Riordan arrays and r-Stirling number identities

By using the theory of Riordan arrays, we establish four pairs of general r-Stirling number identities, which reduce to various identities on harmonic numbers, hyperharmonic numbers, the Stirling numbers of the first and second kind, the r-Stirling numbers of the first and second kind, and the r-Lah numbers. We further discuss briefly the connections between the r-Stirling numbers and the Cauchy numbers, the generalized hyperharmonic numbers, and the poly-Bernoulli polynomials. Many known identities are shown to be special cases of our results, and the combinatorial interpretations of several particular identities are also presented as supplements.     

Riordan阵与含有Genocchi数的一些恒等式

In this paper, using generating functions and Riordan arrays, we get some identities relating Genocchi numbers with Stirling numbers and Cauchy numbers.     

Identities on Bell polynomials and Sheffer sequences

In this paper, we study exponential partial Bell polynomials and Sheffer sequences. Two new characterizations of Sheffer sequences are presented, which indicate the relations between Sheffer sequences and Riordan arrays. Several general identities involving Bell polynomials and Sheffer sequences are established, which reduce to some elegant identities for associated sequences and cross sequences.     

The Cauchy numbers

We study many properties of Cauchy numbers in terms of generating functions and Riordan arrays and find several new identities relating these numbers with Stirling, Bernoulli and harmonic numbers. We also reconsider the Laplace summation formula showing some applications involving the Cauchy numbers.     

Riordan阵的差分性质及其应用

本文考虑了Riordan阵的差分性质, 并给出一些涉及经典组合序列的差分恒等式, 包括广义Stirling数, 第一类和第二类Stirling数, 第一类和第二类B型Stirling数以及Gegenbauer-Humbert型多项式.     

Hsu-Riordan 阵/partial monoid

本文首先对Shapiro的Riordan群进行了推广。给出了Hsu-Riordan partial monoid的概念，然后在此框架内，对徐利治先生的两类扩展型广义Stirling数偶进行了统一处理；建立了Hsu-Wang转换定理。Brown-Sprugnoli转换公式，以及广义Brown转换引理-它揭示了一些不同类型的Hsu-Riordan阵之间转换的方法。由此可产生大量的恒等式。