• Communications of the Korean Mathematical Society
• /
• v.36 no.2
• /
• pp.239-246
• /
• 2021

In this article, a study of generalized Bateman's matrix polynomials is presented. We obtained partial differential equations by using differential operators in the generalized Bateman's matrix polynomials for two variables. Then we introduced some different recurrence relationships of the generalized Bateman's matrix polynomials. Finally present the relationship between the generalized Bateman's matrix polynomials of one and two variables.

• The Korean Journal of Zoology
• /
• v.37 no.3
• /
• pp.318-323
• /
• 1994

The association of replication origins/termini with nuclear matrix during S phase was investigated by DNase digestion of halo structures in synchronized mouse LPI-1 cells. The binding of parental DNA to nuclear matrix was constant throughout S phase. When nuclear matrix was isolated from the cells pulse-labeled with 3H-thvmidine at various stases of S phase, total 3H-labels associated with nuclear matrix were specifically higher at So, Sa and Ss stages than other stases of S phase, suggesting that the newly synthesized DNAs at those stages are not excluded out of nuclear matrix. Similar patterns were obsenred from the pulse-chase experiments, in which cells were pulse-labeled at each stage of S phase and further incubated for 1 hr. These results suggest that the replication origins and termini are fixed at the nuclear matrix, and that the nuclear matrix binding fractions of DNA at 3C-pause may contain a large population of replication origins and termination sites.

• East Asian mathematical journal
• /
• v.39 no.5
• /
• pp.523-528
• /
• 2023

Let S_n = [S(i, j)]_1≤i,j≤n and S^*_n = [S(i + j, j)]_1≤i,j≤n where S(i, j) is the Stirling number of the second kind. Choi and Jo [On the determinants of the square-type Stirling matrix and Bell matrix, Int. J. Math. Math. Sci. 2021] obtained the diagonal entries of matrix U in the LU-factorization of S^*_n for calculating the determinant of S^*_n, where L = S_n. In this paper, we compute the all entries of U in the LU-factorization of matrix S^*_n. This implies the identities related to Stirling numbers of both kinds.

• The Pure and Applied Mathematics
• /
• v.6 no.2
• /
• pp.121-127
• /
• 1999

We can get the Pascal's matrix of order n by taking the first n rows of Pascal's triangle and filling in with 0's on the right. In this paper we obtain some well known combinatorial identities and a factorization of the Stirling matrix from the Pascal's matrix.

• Korean Journal of Mathematics
• /
• v.27 no.4
• /
• pp.949-968
• /
• 2019

In this work, we characterize some matrix classes concerning the Binomial sequence spaces b^r,s_∞ and b^r,s_p, where 1 ≤ p < ∞. Moreover, by using the notion of Hausdorff measure of noncompactness, we characterize the class of compact matrix operators from b^r,s₀, b^r,s_c and b^r,s_∞ into c₀, c and ℓ_∞, respectively.

• East Asian mathematical journal
• /
• v.35 no.3
• /
• pp.341-349
• /
• 2019

In this paper, we are concerned with the minimal positive solution to system of the nonlinear matrix equations $A_1X^2+B_1Y +C_1=0$ and $A_2Y^2+B_2X+C_2=0$, where $A_i$ is a positive matrix or a nonnegative irreducible matrix, $C_i$ is a nonnegative matrix and $-B_i$ is a nonsingular M-matrix for i = 1, 2. We apply Newton's method to system and present a modified Newton's iteration which is validated to be efficient in the numerical experiments. We prove that the sequences generated by the modified Newton's iteration converge to the minimal positive solution to system of nonlinear matrix equations.

• Journal of the Chungcheong Mathematical Society
• /
• v.36 no.2
• /
• pp.65-76
• /
• 2023

With the Stirling matrix S of the second kind and the Pascal matrix T, we study recurrence rules and sequences of certain sums over the matrix ST^k. We find a matrix E satisfying ST = ES and interrelations of S and the Stirling matrix of the first kind.

• Journal of applied mathematics & informatics
• /
• v.26 no.5_6
• /
• pp.1011-1020
• /
• 2008

The problem of finding Cramer rule for solutions of some restricted linear equation Ax = b has been widely discussed. Recently Wang and Qiao consider the following more general problem AXB = D, $R(X){\subset}T$, $N(X){\supset}\tilde{S}$. They present the solution of above general restricted matrix equation by using generalized inverses and give an explicit expression for the elements of the solution matrix for the matrix equation. In this paper we re-consider the restricted matrix equation and give an equivalent matrix equation to it. Through the equivalent matrix equation, we derive condensed Cramer rule for above restricted matrix equation. As an application, condensed determinantal expressions for $A_{T,S}^{(2)}$ A and $AA_{T,S}^{(2)}$ are established. Based on above results, we present a method for computing the solution of a kind of restricted matrix equation.

• Journal of applied mathematics & informatics
• /
• v.29 no.1_2
• /
• pp.485-495
• /
• 2011

Let $A_1$ and $A_2$ be $n{\times}n$ nonzero complex matrices, denote a linear combination of the two matrices by $A=c_1A_1+c_2A_2$, where $c_1$, $c_2$ are nonzero complex numbers. In this paper, we research the problem of the linear combinations in the general case. We give a sufficient and necessary condition for A is an involutive matrix and s+1-potent matrix, respectively, where $A_1$ is a tripotent matrix, with $A_1A_2=A_2A_1$. Then, using the results, we also give the sufficient and necessary conditions for the involutory of the linear combination A, where $A_1$ is a tripotent matrix, anti-idempotent matrix, and involutive matrix, respectively, and $A_2$ is a tripotent matrix, idempotent matrix, and involutive matrix, respectively, with $A_1A_2=A_2A_1$.

• Journal of applied mathematics & informatics
• /
• v.33 no.5_6
• /
• pp.627-633
• /
• 2015

In this paper, we generalize the concept of the energy of Seidel matrix S(G) which denoted by S^α(G) and obtain some results related to this matrix. Also, we obtain an upper and lower bound for S^α(G) related to all of graphs with |detS(G)| ≥ (n - 1); n ≥ 3.