• East Asian mathematical journal
• /
• v.16 no.2
• /
• pp.401-407
• /
• 2000

We give a generalization of the Bateman's polynomial $F_n(x)$ and also give two generating functions for the generalized polynomial.

• Journal of the Korean Mathematical Society
• /
• v.50 no.5
• /
• pp.1067-1082
• /
• 2013

In this paper, we will find some recurrence relations of classical multiple OPS between the same family with different parameters using the generating functions, which are useful to find structure relations and their connection coefficients. In particular, the differential-difference equations of Jacobi-Pineiro polynomials and multiple Bessel polynomials are given.

• Communications of the Korean Mathematical Society
• /
• v.28 no.1
• /
• pp.87-105
• /
• 2013

The aim of the present paper is to study some generating functions of generalized Bateman's and Pasternak's polynomials of two variables.

• Journal of applied mathematics & informatics
• /
• v.38 no.3_4
• /
• pp.291-300
• /
• 2020

This type of polynomial is a generating function that substitutes e^λt for e^t in the denominator of the generating function for the Bernoulli polynomial, but polynomials by using this generating function has interesting properties involving the location of the roots. We define these generation functions and observe the properties of the generation functions.

• Korean Journal of Mathematics
• /
• v.27 no.2
• /
• pp.417-423
• /
• 2019

In the paper, by virtue of the $Fa{\grave{a}}$ di Bruno formula, properties of the Bell polynomials of the second kind, and the Lah inversion formula, the author simplifies coefficients in a family of ordinary differential equations related to the generating function of the Mittag-Leffler polynomials.

• Bulletin of the Korean Mathematical Society
• /
• v.52 no.2
• /
• pp.467-481
• /
• 2015

Choi and Park introduced an invariant of a finite simple graph, called signed a-number, arising from computing certain topological invariants of some specific kinds of real toric manifolds. They also found the signed a-numbers of path graphs, cycle graphs, complete graphs, and star graphs. We introduce a signed a-polynomial which is a generalization of the signed a-number and gives a-, b-, and c-numbers. The signed a-polynomial of a graph G is related to the $Poincar\acute{e}$ polynomial $P_{M(G)}(z)$, which is the generating function for the Betti numbers of the real toric manifold M(G). We give the generating functions for the signed a-polynomials of not only path graphs, cycle graphs, complete graphs, and star graphs, but also complete bipartite graphs and complete multipartite graphs. As a consequence, we find the Euler characteristic number and the Betti numbers of the real toric manifold M(G) for complete multipartite graphs G.

• Journal of information and communication convergence engineering
• /
• v.8 no.3
• /
• pp.317-322
• /
• 2010

This paper presents an algorithm generating inverse element over finite fields GF($3^m$), and constructing method of inverse element generator based on inverse element generating algorithm. An inverse computing method of an element over GF($3^m$) which corresponds to a polynomial over GF($3^m$) with order less than equal to m-1. Here, the computation is based on multiplication, square and cube method derived from the mathematics properties over finite fields.

• Journal of the Korean Mathematical Society
• /
• v.54 no.5
• /
• pp.1595-1604
• /
• 2017

We give a complete formula for the characteristic polynomial of hyperplane arrangements ${\mathcal{J}}_n$ consisting of the hyperplanes $x_i+x_j=1$, $x_k=0$, $x_l=1$, $1{\leq}i$, j, k, $l{\leq}n$. The formula is obtained by associating hyperplane arrangements with graphs, and then enumerating central graphs via generating functions for the number of bipartite graphs of given order, size and number of connected components.

• Journal of Information Technology Application
• /
• v.3 no.3
• /
• pp.25-40
• /
• 2001

This paper deals with the problem of generating optimal polynomials using Genetic Programming(GP). The polynomial should approximate nonlinear response surfaces. Also, there should be a consideration regarding the size of the polynomial, It is not desirable if the polynomial is too large. To build small or medium size of polynomials that enable to model nonlinear response surfaces, we use the low order Tailor series in the function set of GP, and put the constrain on generating GP tree during the evolving process in order to prevent GP trees from becoming too large size of polynomials. Also, GAGPT(Group of Additive Genetic Programming Trees) is adopted to help achieving such purpose. Two examples are given to demonstrate our method.

• Bulletin of the Korean Mathematical Society
• /
• v.41 no.3
• /
• pp.521-540
• /
• 2004

In this paper, we give a sharp estimate on the cardinality of the set generating the convex hull containing the image of harmonic maps with polynomial growth rate on a certain class of manifolds into a Cartan-Hadamard manifold with sectional curvature bounded by two negative constants. We also describe the asymptotic behavior of harmonic maps on a complete Riemannian manifold into a regular ball in terms of massive subsets, in the case when the space of bounded harmonic functions on the manifold is finite dimensional.