• Journal of applied mathematics & informatics
• /
• v.26 no.3_4
• /
• pp.751-755
• /
• 2008

Formanek([2]) proved that $M_n(K)$, the matrix algebra has a nontrivial central polynomial when char K = 0. Also Razmyslov([3]) showed the same result using the essential weak identity. In this article we explicitly compute Formanek's central polynomial for $M_2(\mathbb{C})$ and $M_3(\mathbb{C})$ and classify the coefficients of the central polynomial.

• Communications for Statistical Applications and Methods
• /
• v.9 no.1
• /
• pp.241-248
• /
• 2002

The problem of wavelet density estimation based on Shannon's wavelets is studied when the sample observations are contaminated with random noise. In this paper we will discuss the asymptotic normality for deconvolving wavelet density estimator of the unknown density f(x) when courier transform of random noise has polynomial descent.

• Korean Journal of Mathematics
• /
• v.30 no.2
• /
• pp.231-238
• /
• 2022

In this paper we prove some results by using a simple but elegant techniques to improve and strengthen some generalizations and refinements of two widely known polynomial inequalities and thereby deduce some useful corollaries.

• Communications of the Korean Mathematical Society
• /
• v.35 no.2
• /
• pp.533-546
• /
• 2020

Since Sheffer introduced the so-called Sheffer polynomials in 1939, the polynomials have been extensively investigated, applied and classified. In this paper, by using matrix algebra, specifically, some properties of Pascal and Wronskian matrices, we aim to present certain interesting identities involving the 2-variable truncated exponential based Sheffer polynomial sequences. Also, we use the main results to give some interesting identities involving so-called 2-variable truncated exponential based Miller-Lee type polynomials. Further, we remark that a number of different identities involving the above polynomial sequences can be derived by applying the method here to other combined generating functions.

• Journal of the Korean Mathematical Society
• /
• v.53 no.2
• /
• pp.475-488
• /
• 2016

We study the structure of central elements in relation with polynomial rings and introduce quasi-commutative as a generalization of commutative rings. The Jacobson radical of the polynomial ring over a quasi-commutative ring is shown to coincide with the set of all nilpotent polynomials; and locally finite quasi-commutative rings are shown to be commutative. We also provide several sorts of examples by showing the relations between quasi-commutative rings and other ring properties which have roles in ring theory. We examine next various sorts of ring extensions of quasi-commutative rings.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.7
• /
• pp.41-47
• /
• 2015

The bandwidth minimization problem (BMP) has been classified as NP-complete because the polynomial time algorithm to find the optimal solution has been unknown yet. This paper suggests polynomial time heuristic algorithm is to find the solution of bandwidth minimization problem. To find the minimum bandwidth ${\phi}^*=_{min}{\phi}(G)$, ${\phi}(G)=_{max}\{{\mid}f(v_i)-f(v_j):v_i,v_j{\in}E\}$ for given graph G=(V,E), m=|V|,n=|E|, the proposed algorithm sets the maximum degree vertex $v_i$ in graph G into global central point (GCP), and labels the median value ${\lceil}m+1/2{\rceil}$ between [1,m] range. The graph G is partitioned into subgroup, the maximum degree vertex in each subgroup is set to local central point (LCP), and we adjust the label of LCP per each subgroup as possible as minimum distance from GCP. The proposed algorithm requires O(mn) time complexity for label to all of vertices. For various twelve graph, the proposed algorithm can be obtains the same result as known optimal solution. For one graph, the proposed algorithm can be improve on known solution.

• Korean Journal of Mathematics
• /
• v.31 no.2
• /
• pp.145-152
• /
• 2023

Let $P(z):=\sum\limits^{n}_{j=0}A_jz^j$, A_j ∈ ℂ^m×m, 0 ≤ j ≤ n be a matrix polynomial of degree n, such that A_n ≥ A_n-1 ≥ . . . ≥ A₀ ≥ 0, A_n > 0. Then the eigenvalues of P(z) lie in the closed unit disk. This theorem proved by Dirr and Wimmer [IEEE Trans. Automat. Control 52(2007), 2151-2153] is infact a matrix extension of a famous and elegant result on the distribution of zeros of polynomials known as Eneström-Kakeya theorem. In this paper, we prove a more general result which inter alia includes the above result as a special case. We also prove an improvement of a result due to Lê, Du, Nguyên [Oper. Matrices, 13(2019), 937-954] besides a matrix extention of a result proved by Mohammad [Amer. Math. Monthly, vol.74, No.3, March 1967].

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

This paper proposes an infeasible interior-point algorithm with full-Newton step for linear programming. We introduce a special self-regular proximity to induce the feasibility step and also to measure proximity to the central path. The result of polynomial complexity coincides with the best-known iteration bound for infeasible interior-point methods, namely, O(n log n/${\varepsilon}$).

• 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.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2005.11a
• /
• pp.287-292
• /
• 2005

This paper presents a rational polynomial approximation method to estimate modal parameters of wind excited structures using incomplete noisy measurements of structural responses and partial measurements of wind velocities only. A stochastic model of the excitation wind force acting on the structure is estimated from partial measurements of wind velocities. Then the transfer functions of the structure are approximated as rational polynomial functions. From the poles and zeros of the estimated rational polynomial functions, the modal parameters, such as natural frequencies, damping ratios, and mode shapes are extracted. Since the frequency characteristics of wind forces acting on structures can be assumed as a smooth Gaussian process especially around the natural frequencies of the structures according to the central limit theorem (Brillinger, 1969; Yaglom, 1987), the estimated modal parameters are robust and reliable with respect to the assumed stochastic input models. To verify the proposed method, the modal parameters of a TV transmission tower excited by gust wind are estimated. Comparison study with the results of other researchers shows the efficacy of the suggested method.