• Kyungpook Mathematical Journal
• /
• v.64 no.1
• /
• pp.133-159
• /
• 2024

In a previous work we studied generalized Stirling numbers of the second kind S^{(a₂,b₂,p₂)}_a1,b1 (p₁, k), where a₁, a₂, b₁, b₂ are given complex numbers, a₁, a₂ ≠ 0, and p₁, p₂ are non-negative integers given. In this work we use these generalized Stirling numbers to define Bernoulli polynomials in two variables B_p1,p2 (x₁, x₂), and Euler polynomials in two variables E_p1p2 (x₁, x₂). By using results for S^{(1,x₂,p₂)}_1,x1 (p₁, k), we obtain generalizations, to the bivariate case, of some well-known properties from the standard case, as addition formulas, difference equations and sums of powers. We obtain some identities for bivariate Bernoulli and Euler polynomials, and some generalizations, to the bivariate case, of several known identities for Bernoulli and Euler numbers and polynomials of the standard case.

• The Pure and Applied Mathematics
• /
• v.8 no.2
• /
• pp.127-135
• /
• 2001

The main object of this paper is to present a transformation formula for a finite series involving $_3F_2$ and some identities associated with the binomial coefficients by making use of the theory of Legendre polynomials $P_{n}$(x) and some summation theorems for hypergeometric functions $_pF_q$. Some integral formulas are also considered.

• Bulletin of the Korean Mathematical Society
• /
• v.42 no.4
• /
• pp.679-690
• /
• 2005

Let K be a commutative ring with unity, R a prime K-algebra of characteristic different from 2, d a non-zero derivation of R, I a non-zero right ideal of R, f($x_1,{\cdots},\;x_n$) a multilinear polynomial in n non-commuting variables over K, a $\in$ R. Supppose that, for any $x_1,{\cdots},\;x_n\;\in\;I,\;a[d(f(x_1,{\cdots},\;x_n)),\;f(x_1,{\cdots},\;x_n)]$ = 0. If $[f(x_1,{\cdots},\;x_n),\;x_{n+1}]x_{n+2}$ is not an identity for I and $$S_4(I,\;I,\;I,\;I)\;I\;\neq\;0$$, then aI = ad(I) = 0.

• Journal of applied mathematics & informatics
• /
• v.34 no.1_2
• /
• pp.145-156
• /
• 2016

It is known that certain convolution sums can be expressed as a combination of divisor functions and Bernoulli formula. In this article, we consider relationship between fifth-order combinatoric convolution sums of divisor functions and Bernoulli polynomials. As applications of these identities, we give a concrete interpretation in terms of the procedural modeling method.

• Korean Journal of Mathematics
• /
• v.28 no.3
• /
• pp.603-611
• /
• 2020

In this manuscript, we discuss the relationship between prime rings and automorphisms satisfying differential identities involving commutators and anti-commutators on Lie ideals. In addition, we provide an example which shows that we cannot expect the same conclusion in case of semiprime rings.

• Communications of the Korean Mathematical Society
• /
• v.17 no.3
• /
• pp.383-387
• /
• 2002

Let p be an odd prime, and let f($\varkappa$) be the interpolating polynomial associated with a table of data points (j+1, (equation omitted) ) for 0$\leq$j$\leq$p. In this article, we find congruence identities modulo p of (p-1)!f($\varkappa$), (p-2)!f($\varkappa$), and (p-3)!f($\varkappa$). Moreover we present some conjectures of these types.

• Communications of the Korean Mathematical Society
• /
• v.36 no.4
• /
• pp.641-650
• /
• 2021

The notions of skew-commuting/commuting/semi-commuting/skew-centralizing/semi-centralizing mappings play an important role in ring theory. ${\mathfrak{C}}^*$-algebras with these properties have been studied considerably less and the existing results are motivating the researchers. This article elaborates the structure of prime rings and ${\mathfrak{C}}^*$-algebras satisfying certain functional identities involving automorphisms.

• Journal of applied mathematics & informatics
• /
• v.37 no.3_4
• /
• pp.219-234
• /
• 2019

We use the definition of Euler polynomials of the second kind with (p, q)-numbers to identify some identities and properties of these polynomials. We also investigate some relationships between (p, q)-Euler polynomials of the second kind, (p, q)-Bernoulli polynomials, and (p, q)-tangent polynomials by using the properties of (p, q)-exponential function.

• Kyungpook Mathematical Journal
• /
• v.50 no.2
• /
• pp.177-193
• /
• 2010

Working with the various special functions of mathematical physics and applied mathematics we often encounter inverse relations of the type $F_n(x)=\sum\limits_{k=0}^{n}A^n_kG_k(x)$ and $ G_n(x)=\sum\limits_{k=0}^{n}B_k^nF_k(x)$, where 0, 1, 2,$\cdots$. Here $F_n(x)$, $G_n(x)$ denote special polynomial functions, and $A_k^n$, $B_k^n$ denote coefficients found by use of the orthogonal properties of $F_n(x)$ and $G_n(x)$, or by skillful series manipulations. Typically $G_n(x)=x^n$ and $F_n(x)=P_n(x)$, the n-th Legendre polynomial. We give a collection of inverse series pairs of the type $f(n)=\sum\limits_{k=0}^{n}A_k^ng(k)$ if and only if $g(n)=\sum\limits_{k=0}^{n}B_k^nf(k)$, each pair being based on some reasonably well-known special function. We also state and prove an interesting generalization of a theorem of Rainville in this form.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.11
• /
• pp.4680-4700
• /
• 2015

Broadcast encryption is an efficient way to distribute confidential information to a set of receivers using broadcast channel. It allows the broadcaster to dynamically choose the receiver set during each encryption. However, most broadcast encryption schemes in the literature haven't taken into consideration the receiver's privacy protection, and the scanty privacy preserving solutions are often less efficient, which are not suitable for practical scenarios. In this paper, we propose an efficient dynamic anonymous broadcast encryption scheme that has the shortest ciphertext length. The scheme is constructed over the composite order bilinear groups, and adopts the Lagrange interpolation polynomial to hide the receivers' identities, which yields efficient decryption algorithm. Security proofs show that, the proposed scheme is both secure and anonymous under the threat of adaptive adversaries in standard model.