Zobrazeno 1 - 10
of 45
pro vyhledávání: '"Bao-Xuan Zhu"'
Autor:
Bao Xuan Zhu
Publikováno v:
Acta Mathematica Sinica, English Series. 38:858-868
Autor:
Bao-Xuan Zhu
Publikováno v:
Journal of Algebraic Combinatorics. 54:999-1019
Based on the Stirling triangle of the second kind, the Whitney triangle of the second kind and one triangle of Riordan, we study a Stirling–Whitney–Riordan triangle $$[T_{n,k}]_{n,k}$$ satisfying the recurrence relation: $$\begin{aligned} T_{n,k}
Autor:
Bao-Xuan Zhu, Wan-Ming Guo
Publikováno v:
Linear Algebra and its Applications. 588:458-470
In this paper, we consider a generalized ordered Bell polynomial P n ( q ) defined by the following exponential generating function ∑ n ≥ 0 P n ( q ) n ! t n = e γ t ( β β + β ′ q − β ′ q e t β ) 1 + γ ′ β ′ . Using the method o
Autor:
Qingxiu Wang, Bao-Xuan Zhu
Publikováno v:
Proceedings of the Royal Society of Edinburgh: Section A Mathematics. 150:2573-2585
In 1987, Alavi, Malde, Schwenk and Erdős conjectured that the independence polynomial of any tree is unimodal. Although it attracts many researchers' attention, it is still open. Motivated by this conjecture, in this paper, we prove that rooted prod
Autor:
Bao-Xuan Zhu
Publikováno v:
Proceedings of the American Mathematical Society. 147:4673-4686
The aim of this paper is to develop analytic techniques to deal with Hankel-total positivity of sequences. We show two nonlinear operators preserving Stieltjes moment property of sequences. They actually both extend a result of Wang and Zhu that if (
Publikováno v:
European Journal of Combinatorics. 78:236-255
Let [ R n , k ] n , k ≥ 0 be an array of nonnegative numbers satisfying the recurrence relation R n , k = ( a 1 n + a 2 k + a 3 ) R n − 1 , k + ( b 1 n + b 2 k + b 3 ) R n − 1 , k − 1 + ( c 1 n + c 2 k + c 3 ) R n − 1 , k − 2 with R 0 , 0
Autor:
Bao-Xuan Zhu
Publikováno v:
Proceedings of the Royal Society of Edinburgh: Section A Mathematics. 149:831-847
Given a sequence of polynomials$\{x_k(q)\}_{k \ges 0}$, define the transformation$$y_n(q) = a^n\sum\limits_{i = 0}^n {\left( \matrix{n \cr i} \right)} b^{n-i}x_i(q)$$for$n\ges 0$. In this paper, we obtain the relation between the Jacobi continued fra
Autor:
Bao-Xuan Zhu, Yun Chen
Publikováno v:
Applied Mathematics and Computation. 342:35-44
An independent set in a graph G is a set of pairwise non-adjacent vertices. Let ik(G) denote the number of independent sets of cardinality k in G. Then, its generating function I ( G ; x ) = ∑ k = 0 α ( G ) i k ( G ) x k is called the independence
Autor:
Bao-Xuan Zhu
Many combinatorial numbers can be placed in the following generalized triangular array $[T_{n,k}]_{n,k\ge 0}$ satisfying the recurrence relation: \begin{equation*} T_{n,k}=\lambda(a_0n+a_1k+a_2)T_{n-1,k}+(b_0n+b_1k+b_2)T_{n-1,k-1}+\frac{d(da_1-b_1)}{
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::55a44bac77a763a4b0b8a7888b80412f