• Kyungpook Mathematical Journal
• /
• 제62권2호
• /
• pp.347-361
• /
• 2022

Two virtual knot diagrams are said to be equivalent, if there is a sequence S of Reidemeister moves and virtual moves relating them. The difference of writhes of the two virtual knot diagrams gives a lower bound for the number of the first Reidemeister moves in S. In previous work, we introduced a polynomial q_K(t) for a virtual knot diagram K which gave a lower bound for the number of the third Reidemeister moves in the sequence S. In this paper we define a new polynomial from a coloring of a virtual knot diagram. Using this polynomial, we give a lower bound for the number of the second Reidemeister moves in S. The polynomial also suggests the design of the sequence S.

• 대한수학회지
• /
• 제57권5호
• /
• pp.1119-1133
• /
• 2020

In this paper, we derive an upper bound for the distance from a point in the immediate basin of a root of a complex polynomial to the root itself. We establish that if z is a point in the immediate basin of a root α of a polynomial p of degree d ≥ 12, then ${\mid}z-{\alpha}{\mid}{\leq}{\frac{3}{\sqrt{d}}\(6{\sqrt{310}}/35\)^d{\mid}N_p(z)-z{\mid}$, where N_p is the Newton map induced by p. This bound leads to a new bound of the expected total number of iterations of Newton's method required to reach all roots of every polynomial p within a given precision, where p is normalized so that its roots are in the unit disk.

• 한국수학교육학회지시리즈B:순수및응용수학
• /
• 제10권1호
• /
• pp.37-47
• /
• 2003

We will show that any linear perturbation of polynomials that introduces bounded perturbations into the roots of polynomial is some linear combination of the derivatives of a polynomial. And we will derive an absolute root bound functional which is in some sense better than the other known absolute root bound functionals.

• 대한수학회보
• /
• 제22권2호
• /
• pp.117-119
• /
• 1985

Let R be a commutative noetherian ring with 1.neq.0, denoting by .nu.(I) the cardinality of a minimal basis of the ideal I. Let A be a polynomial ring in n>0 variables with coefficients in R, and let M be a maximal ideal of A. Generally it is shown that .nu.(M $A_{M}$).leq..nu.(M).leq..nu.(M $A_{M}$)+1. It is well known that the lower bound is not always satisfied, and the most classical examples occur in nonfactional Dedekind domains. But in many cases, (e.g., A is a polynomial ring whose coefficient ring is a field) the lower bound is attained. In [2] and [3], the conditions when the lower bound is satisfied is investigated. Especially in [3], it is shown that .nu.(M)=.nu.(M $A_{M}$) if M.cap.R=p is a maximal ideal or $A_{M}$ (equivalently $R_{p}$) is not regular or n>1. Hence the problem of determining whether .nu.(M)=.nu.(M $A_{M}$) can be studied when p is not maximal, $A_{M}$ is regular and n=1. The purpose of this note is to provide some conditions in which the lower bound is satisfied, when n=1 and R is a regular local ring (hence $A_{M}$ is regular)./ is regular).

• Journal of applied mathematics & informatics
• /
• 제29권5_6호
• /
• pp.1285-1293
• /
• 2011

We establishes the polynomial convergence of a new class of path-following methods for semidefinite linear complementarity problems (SDLCP) whose search directions belong to the class of directions introduced by Monteiro [9]. Namely, we show that the polynomial iteration-complexity bound of the well known algorithms for linear programming, namely the predictor-corrector algorithm of Mizuno and Ye, carry over to the context of SDLCP.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1996년도 한국자동제어학술회의논문집(국내학술편); 포항공과대학교, 포항; 24-26 Oct. 1996
• /
• pp.751-753
• /
• 1996

The $H_{2}$/$H_{\infty}$ robust controller is designed by using polynomial approach. This controller can minimise a $H_{2}$ norm of error under the fixed bound of $H_{\infty}$ norm of mixed sensitivity function by employing the Youla parameterization and using polynomial approach at the same time. It is easy to apply this controller to adaptive system.

• 대한수학회논문집
• /
• 제33권2호
• /
• pp.631-638
• /
• 2018

Chellai et al. [3] gave an upper bound on the [1, 2]-domination number of tree and posed an open question "how to classify trees satisfying the sharp bound?". Yang and Wu [5] gave a partial solution for tree of order n with ${\ell}$-leaves such that every non-leaf vertex has degree at least 4. In this paper, we give a new upper bound on the [1, 2]-domination number of tree which extends the result of Yang and Wu. In addition, we design a polynomial time algorithm for solving the open question. By using this algorithm, we give a characterization on the [1, 2]-domination number for trees of order n with ${\ell}$ leaves satisfying $n-{\ell}$. Thereby, the open question posed by Chellai et al. is solved.

• 대한수학회보
• /
• 제54권6호
• /
• pp.2149-2154
• /
• 2017

In this paper, we obtain a simple lower bound for the number of positive (resp. negative) crossings in oriented link diagrams in terms of the maximal (resp. minimal) degree of the Jones polynomial.

• Journal of Power Electronics
• /
• 제18권5호
• /
• pp.1380-1397
• /
• 2018

The synchronous reluctance motor (SynRM) servo-drive system has highly nonlinear uncertainties owing to a convex construction effect. It is difficult for the linear control method to achieve good performance for the SynRM drive system. The nonlinear backstepping control system using upper bound with switching function is proposed to inhibit uncertainty action for controlling the SynRM drive system. However, this method uses a large upper bound with a switching function, which results in a large chattering. In order to reduce this chattering, a nonlinear backstepping control system using an adaptive law is proposed to estimate the lumped uncertainty. Since this method uses an adaptive law, it cannot achiever satisfactory performance. Therefore, a nonlinear backstepping control system using a reformed recurrent Hermite polynomial neural network with an adaptive law and an error estimated law is proposed to estimate the lumped uncertainty and to compensate the estimated error in order to enhance the robustness of the SynRM drive system. Further, the reformed recurrent Hermite polynomial neural network with two learning rates is derived according to an increment type Lyapunov function to speed-up the parameter convergence. Finally, some experimental results and a comparative analysis are presented to verify that the proposed control system has better control performance for controlling SynRM drive systems.

• 대한수학회보
• /
• 제54권2호
• /
• pp.507-519
• /
• 2017

We present an upper bound on the Cheeger constant of a distance-regular graph. Recently, the authors found an upper bound on the Cheeger constant of distance-regular graph under a certain restriction in their previous work. Our new bound in the current paper is much better than the previous bound, and it is a general bound with no restriction. We point out that our bound is explicitly computable by using the valencies and the intersection matrix of a distance-regular graph. As a major tool, we use the discrete Green's function, which is defined as the inverse of ${\beta}$-Laplacian for some positive real number ${\beta}$. We present some examples of distance-regular graphs, where we compute our upper bound on their Cheeger constants.