• 대한수학회논문집
• /
• 제35권2호
• /
• pp.371-399
• /
• 2020

Let P_s := 𝔽₂[x₁, x₂, …, x_s] = ⊕_n⩾0(P_s)_n be the polynomial algebra viewed as a graded left module over the mod 2 Steenrod algebra, ${\mathfrak{A}}$. The grading is by the degree of the homogeneous terms (P_s)_n of degree n in the variables x₁, x₂, …, x_s of grading 1. We are interested in the hit problem, set up by F. P. Peterson, of finding a minimal system of generators for ${\mathfrak{A}}$-module P_s. Equivalently, we want to find a basis for the 𝔽₂-graded vector space ${\mathbb{F}}_2{\otimes}_{\mathfrak{A}}$ P_s. In this paper, we study the hit problem in the case s = 5 and the degree n = 5(2^t - 1) + 6 · 2^t with t an arbitrary positive integer.

• 대한수학회지
• /
• 제45권3호
• /
• pp.835-840
• /
• 2008

The main result of this paper shows that every reciprocal Littlewood polynomial, one with {-1, 1} coefficients, of odd degree at least 7 has at least five unimodular roots, and every reciprocal Little-wood polynomial of even degree at least 14 has at least four unimodular roots, thus improving the result of Mukunda. We also give a sketch of alternative proof of the well-known theorem characterizing Pisot numbers whose minimal polynomials are in $$A_N=\{[{X^d+ \sum\limits^{d-1}_{k=0} a_k\;X^k{\in} \mathbb{Z}[X]\;:\;a_k={\pm}N,\;0{\leqslant}k{\leqslant}d-1}\}$$ for positive integer $N{\geqslant}2$.

• Journal of Ship and Ocean Technology
• /
• 제11권4호
• /
• pp.21-28
• /
• 2007

Recently the importance of the utilization of engineering data is gradually increasing. Engineering data contains the experiences and know-how of experts. Data mining technique is useful to extract knowledge or information from the accumulated existing data. This paper deals with generating optimal polynomials using genetic programming (GP) as the module of Data Mining system. Low order Taylor series are used to approximate the polynomial easily as a nonlinear function to fit the accumulated data. The overfitting problem is unavoidable because in real applications, the size of learning samples is minimal. This problem can be handled with the extended data set and function node stabilization method. The Data Mining system for the ship design based on polynomial genetic programming is presented.

• 대한수학회논문집
• /
• 제35권4호
• /
• pp.1299-1307
• /
• 2020

We show that the Liechti-Strenner's example for the closed nonorientable surface in [13] minimizes the dilatation within the class of pseudo-Anosov homeomorphisms with an orientable invariant foliation and all but the first coefficient of the characteristic polynomial of the action induced on the first cohomology nonpositive. We also show that the Liechti-Strenner's example of orientation-reversing homeomorphism for the closed orientable surface in [13] minimizes the dilatation within the class of pseudo-Anosov homeomorphisms with an orientable invariant foliation and all but the first coefficient of the characteristic polynomial p(x) of the action induced on the first cohomology nonpositive or all but the first coefficient of p(x)(x ± 1)², p(x)(x² ± 1), or p(x)(x² ± x + 1) nonpositive.

• 대한수학회지
• /
• 제51권4호
• /
• pp.751-771
• /
• 2014

We study the structure of idempotents in polynomial rings, power series rings, concentrating in the case of rings without identity. In the procedure we introduce right Insertion-of-Idempotents-Property (simply, right IIP) and right Idempotent-Reversible (simply, right IR) as generalizations of Abelian rings. It is proved that these two ring properties pass to power series rings and polynomial rings. It is also shown that ${\pi}$-regular rings are strongly ${\pi}$-regular when they are right IIP or right IR. Next the noncommutative right IR rings, right IIP rings, and Abelian rings of minimal order are completely determined up to isomorphism. These results lead to methods to construct such kinds of noncommutative rings appropriate for the situations occurred naturally in studying standard ring theoretic properties.

• 대한수학회보
• /
• 제49권2호
• /
• pp.381-394
• /
• 2012

We generalize the insertion-of-factors-property by setting nilpotent products of elements. In the process we introduce the concept of a nil-IFP ring that is also a generalization of an NI ring. It is shown that if K$\ddot{o}$the's conjecture holds, then every nil-IFP ring is NI. The class of minimal noncommutative nil-IFP rings is completely determined, up to isomorphism, where the minimal means having smallest cardinality.

• 대한수학회보
• /
• 제54권4호
• /
• pp.1123-1139
• /
• 2017

The aim in this note is to describe some classes of rings in relation to factorization by prime radical, upper nilradical, and Jacobson radical. We introduce the concepts of tpr ring, tunr ring, and tjr ring in the process, respectively. Their ring theoretical structures are investigated in relation to various sorts of factor rings and extensions. We also study the structure of noncommutative tpr (tunr, tjr) rings of minimal order, which can be a base of constructing examples of various ring structures. Various sorts of structures of known examples are studied in relation with the topics of this note.

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

In this paper, some properties for a PI-ring satisfying the descending chain condition on essential left ideals are studied: Let R be a ring with a polynomial identity satisfying the descending chain condition on essential ideals. Then all minimal prime ideals in R are maximal ideals. Moreover, if R has only finitely many minimal prime ideals, then R is left and right Artinian. Consequently, if every primeideal of R is finitely generated as a left ideal, then R is left and right Artinian. A finitely generated PI-algebra over a commutative Noetherian ring satisfying the descending chain condition on essential left ideals is a finite module over its center.(omitted)

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1996년도 하계학술대회 논문집 B
• /
• pp.1212-1215
• /
• 1996

As usual systems, robot manipulators have also physical constraints for operating. It is a difficult problem that we operate manipulator in the minimal time under these constraints. In this pater, we solve this problem dividing it into two steps. In the first step, we find the minimal time trajectories by optimizing qubic polynomial joint trajectories using evolutionary algorithms. In the second step, we optimize controller for robot manipulator to track precisely trajectories optimized in the previous step.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2005년도 제36회 하계학술대회 논문집 D
• /
• pp.2793-2795
• /
• 2005

고장검출식별시스템의 성능을 좌우하는 가장 중요한 요소는 잔차발생알고리즘이다. 잔차발생기구는 측정된 입출력변수 정보에 근거하여 설계되며 고장의 검출 및 식별이 가능하도록 감결합(decoupling) 특성을 가져야 한다. 본 논문에서는 전달함수 접근 방법 중 최근 제안된 최소차 다항식 기저(minimal polynomial basis)를 이용한 잔차발생기구 설계기법을 소개하고, 이를 VTOL의 센서 및 구동장치고장 검출에 적용하여 그 성능을 검토하였다.