• Bulletin of the Korean Mathematical Society
• /
• v.54 no.2
• /
• pp.521-541
• /
• 2017

In this note we elaborate first on well-known theorems for annihilators of polynomials over IFP rings by investigating the concrete shapes of nonzero constant annihilators. We consider next a generalization of IFP which preserves Abelian property, in relation with annihilators of polynomials, observing the basic structure of rings satisfying such condition.

• Journal of applied mathematics & informatics
• /
• v.18 no.1_2
• /
• pp.301-310
• /
• 2005

The coefficients of the Rudin-Shapiro polynomials are $\pm1$. In this paper we first replace-1 coefficient by 0 which on that case the structure of the coefficients will be on base 2. Then using the results obtained for the numbers on base 2, we introduce a quite fast algorithm to calculate the autocorrelation coefficients. Main facts: Regardless of frequencies, finding the autocorrelations of those polynomials on which their coefficients lie in the unit disk has been a telecommunication's demand. The Rudin-Shapiro polynomials have a very special form of coefficients that allow us to use 'Machine language' for evaluating these values.

• Journal of the Korean Mathematical Society
• /
• v.47 no.4
• /
• pp.719-733
• /
• 2010

We observe a structure on the products of coefficients of nilpotent polynomials, introducing the concept of n-semi-Armendariz that is a generalization of Armendariz rings. We first obtain a classification of reduced rings, proving that a ring R is reduced if and only if the n by n upper triangular matrix ring over R is n-semi-Armendariz. It is shown that n-semi-Armendariz rings need not be (n+1)-semi-Armendariz and vice versa. We prove that a ring R is n-semi-Armendariz if and only if so is the polynomial ring over R. We next study interesting properties and useful examples of n-semi-Armendariz rings, constructing various kinds of counterexamples in the process.

• Journal for History of Mathematics
• /
• v.28 no.6
• /
• pp.301-310
• /
• 2015

Since Jiuzhang Suanshu, the main tools in the theory of right triangles, known as Gougushu in East Asia were algebraic identities about three sides of a right triangle derived from the Pythagorean theorem. Using tianyuanshu up to siyuanshu, Song-Yuan mathematicians could skip over those identities in the theory. Chinese Mathematics in the 17-18th centuries were mainly concerned with the identities along with the western geometrical proofs. Jeong Yag-yong (1762-1836), a well known Joseon scholar and writer of the school of Silhak, noticed that those identities can be derived through algebra and then wrote Gugo Wonlyu (勾股源流) in the early 19th century. We show that Jeong reveals the algebraic structure of polynomials with the three indeterminates in the book along with their order structure. Although the title refers to right triangles, it is the first pure algebra book in Joseon mathematics, if not in East Asia.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.52 no.7
• /
• pp.424-433
• /
• 2003

Evolutionary design related to the optimal design of Polynomial Neural Networks (PNNs) structure for model identification of complex and nonlinear system is studied in this paper. The PNN structure is consisted of layers and nodes like conventional neural networks but is not fixed and can be changable according to the system environments. three types of polynomials such as linear, quadratic, and modified quadratic is used in each node that is connected with various kinds of multi-variable inputs. Inputs and order of polynomials in each node are very important element for the performance of model. In most cases these factors are decided by the background information and trial and error of designer. For the high reliability and good performance of the PNN, the factors must be decided according to a logical and systematic way. In the paper evolutionary algorithm is applied to choose the optimal input variables and order. Evolutionary (genetic) algorithm is a random search optimization technique. The evolved PNN with optimally chosen input variables and order is not fixed in advance but becomes fully optimized automatically during the identification process. Gas furnace and pH neutralization processes are used in conventional PNN version are modeled. It shows that the designed PNN architecture with evolutionary structure optimization can produce the model with higher accuracy than previous PNN and other works.

• The Transactions of the Korean Institute of Electrical Engineers C
• /
• v.52 no.7
• /
• pp.424-424
• /
• 2003

Evolutionary design related to the optimal design of Polynomial Neural Networks (PNNs) structure for model identification of complex and nonlinear system is studied in this paper. The PNN structure is consisted of layers and nodes like conventional neural networks but is not fixed and can be changable according to the system environments. three types of polynomials such as linear, quadratic, and modified quadratic is used in each node that is connected with various kinds of multi-variable inputs. Inputs and order of polynomials in each node are very important element for the performance of model. In most cases these factors are decided by the background information and trial and error of designer. For the high reliability and good performance of the PNN, the factors must be decided according to a logical and systematic way. In the paper evolutionary algorithm is applied to choose the optimal input variables and order. Evolutionary (genetic) algorithm is a random search optimization technique. The evolved PNN with optimally chosen input variables and order is not fixed in advance but becomes fully optimized automatically during the identification process. Gas furnace and pH neutralization processes are used in conventional PNN version are modeled. It shows that the designed PNN architecture with evolutionary structure optimization can produce the model with higher accuracy than previous PNN and other works.

• Journal of the Earthquake Engineering Society of Korea
• /
• v.22 no.4
• /
• pp.245-251
• /
• 2018

In this paper, we address some issues in existing seismic hazard closed-form equations and present a novel seismic hazard equation form to overcome these issues. The presented equation form is based on higher-order polynomials, which can well describe the seismic hazard information with relatively high non-linearity. The accuracy of the proposed form is illustrated not only in the seismic hazard data itself but also in estimating the annual probability of failure (APF) of the structural systems. For this purpose, the information on seismic hazard is used in representative areas of the United States (West : Los Angeles, Central : Memphis and Kansas, East : Charleston). Examples regarding the APF estimation are the analyses of existing platform structure and nuclear power plant problems. As a result of the numerical example analyses, it is confirmed that the higher-order-polynomial-based hazard form presented in this paper could predict the APF values of the two example structure systems as well as the given seismic hazard data relatively accurately compared with the existing closed-form hazard equations. Therefore, in the future, it is expected that we can derive a new improved APF function by combining the proposed hazard formula with the existing fragility equation.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.26 no.3
• /
• pp.183-189
• /
• 2013

In this paper, uncertainties and failure criteria of structure are mathematically expressed by random variables and a limit state equation. A limit state equation is approximated by Fleishman's 3rd order polynomials and the theoretical moments of an approximated limit state equation are calculated. Fleishman introduced a 3rd order polynomial in terms of only standard normal distiribution random variables. But, in this paper, Fleishman's polynomial is extended to various random variables including beta, gamma, uniform distributions. Cumulants and a normalized limit state equation are used to calculate a theoretical moments of a limit state equation. A cumulative distribution function of a normalized limit state equation is approximated by a Pearson system.

• Communications of the Korean Mathematical Society
• /
• v.32 no.2
• /
• pp.233-260
• /
• 2017

Let R be a factorial domain. In this work we investigate the connections between the arithmetic of Int(R) (i.e., the ring of integer-valued polynomials over R) and its monadic submonoids (i.e., monoids of the form {$g{\in}Int(R){\mid}g{\mid}_{Int(R)}f^k$ for some $k{\in}{\mathbb{N}}_0$} for some nonzero $f{\in}Int(R)$). Since every monadic submonoid of Int(R) is a Krull monoid it is possible to describe the arithmetic of these monoids in terms of their divisor-class group. We give an explicit description of these divisor-class groups in several situations and provide a few techniques that can be used to determine them. As an application we show that there are strong connections between Int(R) and its monadic submonoids. If $R={\mathbb{Z}}$ or more generally if R has sufficiently many "nice" atoms, then we prove that the infinitude of the elasticity and the tame degree of Int(R) can be explained by using the structure of monadic submonoids of Int(R).

• Korean Journal of Mathematics
• /
• v.21 no.4
• /
• pp.421-428
• /
• 2013

We observe the basic structure of the products of coefficients of nilpotent (left) polynomials in skew polynomial rings. This study consists of a process to extend a well-known result for semi-Armendariz rings. We introduce the concept of ${\alpha}$-skew n-semi-Armendariz ring, where ${\alpha}$ is a ring endomorphism. We prove that a ring R is ${\alpha}$-rigid if and only if the n by n upper triangular matrix ring over R is $\bar{\alpha}$-skew n-semi-Armendariz. This result are applicable to several known results.