• Journal of the Korean Mathematical Society
• /
• v.48 no.5
• /
• pp.1065-1081
• /
• 2011

For any field F, a polynomial f $\in$ F[$x_1,x_2,{\ldots},x_k$] can be associated with a polytope, called its Newton polytope. If the polynomial f has integrally indecomposable Newton polytope, in the sense of Minkowski sum, then it is absolutely irreducible over F, i.e., irreducible over every algebraic extension of F. We present some results giving new integrally indecomposable classes of polygons. Consequently, we have some criteria giving many types of absolutely irreducible bivariate polynomials over arbitrary fields.

• Journal for History of Mathematics
• /
• v.29 no.5
• /
• pp.257-266
• /
• 2016

This paper is a sequel to our paper [3]. Although polynomials in the tianyuanshu induce perfectly the algebraic structure of polynomials, the tianyuan(天元) is always chosen by a specific unknown in a given problem, it can't carry out the role of the indeterminate in ordinary polynomials. Further, taking the indeterminate as a variable, one can study mathematical structures of polynomials via those of polynomial functions. Thus the theory of polynomials in East Asian mathematics could not be completely materialized. In the previous paper [3], we show that Jeong Yag-yong disclosed in his Gugo Wonlyu(勾股源流) the mathematical structures of Pythagorean polynomials, namely polynomials p(a, b, c) where a, b, c are the three sides gou(勾), gu(股), xian(弦) of a right triangle, respectively. In this paper, we show that Jeong obtained his results through his recognizing Pythagorean polynomials as polynomial functions of three variables a, b, c.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.25 no.10
• /
• pp.1166-1172
• /
• 1988

This paper presents an efficient method of analyzing linear time-varying systems via Taylor polynomials. While the approach suggested by Sparis and Mouroutsos gives an implicit form for unknown state vector and requires to solve a linear algebraic equation with large dimension when the number of terms increases, the method proposed in this paper shows an explicit form and has no need to solve any linear algebraic equation.

• Communications of Mathematical Education
• /
• v.29 no.4
• /
• pp.661-685
• /
• 2015

This study is to search for a program of professional development of mathematics teachers on the viewpoint of content knowledge of mathematics. To do this, we select algebraic subject as content knowledge for solution of polynomials and develop material for group study based on selected subject. We supply the developed material to teachers and discuss the possibility of application and the acceptability of it. For discussion, we collect data through tests and questionnaire. Through analysing the data, we obtain the positive result.

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

• Journal of applied mathematics & informatics
• /
• v.32 no.3_4
• /
• pp.529-537
• /
• 2014

The paper introduces a new product of polynomials defined over a field. It is a generalization of the ordinary product with inner polynomial getting non-overlapping segments obtained by multiplying with coefficients and variable with expanding powers. It has been called 'Ordered Power Product' (OPP). Considering two rings of polynomials $R_m[x]=F[x]modulox^m-1$ and $R_n[x]=F[x]modulox^n-1$, over a field F, the paper then considers the newly introduced product of the two polynomial rings. Properties and algebraic structure of the product of two rings of polynomials are studied and it is shown to be a ring. Using the new type of product of polynomials, we define a new product of two cyclic codes and devise a method of getting a cyclic code from the 'ordered power product' of two cyclic codes. Conditions for the OPP of the generators polynomials of component codes, giving a cyclic code are examined. It is shown that OPP cyclic code so obtained is more efficient than the one that can be obtained by Kronecker type of product of the same component codes.

• Journal of the Korean Mathematical Society
• /
• v.49 no.1
• /
• pp.99-112
• /
• 2012

This paper attempts to present a numerical method for solving optimal control problems. The method is based upon constructing the n-th degree Jacobi polynomials to approximate the control vector and use differentiation matrix to approximate derivative term in the state system. The system dynamics are then converted into system of algebraic equations and hence the optimal control problem is reduced to constrained optimization problem. Numerical examples illustrate the robustness, accuracy and efficiency of the proposed method.

• Bulletin of the Korean Mathematical Society
• /
• v.53 no.3
• /
• pp.699-709
• /
• 2016

Our paper is devoted to the study of certain diophantine equations on the ring of polynomials over a finite field, which are intimately related to algebraic formal power series which have partial quotients of unbounded degree in their continued fraction expansion. In particular it is shown that there are Pisot formal power series with degree greater than 2, having infinitely many large partial quotients in their simple continued fraction expansions. This generalizes an earlier result of Baum and Sweet for algebraic formal power series.

• Bulletin of the Korean Mathematical Society
• /
• v.53 no.1
• /
• pp.1-20
• /
• 2016

The general number field sieve (GNFS) is asymptotically the fastest known factoring algorithm. One of the most important steps of GNFS is to select a good polynomial pair. A standard way of polynomial selection (being used in factoring RSA challenge numbers) is to select a nonlinear polynomial for algebraic sieving and a linear polynomial for rational sieving. There is another method called a nonlinear method which selects two polynomials of the same degree greater than one. In this paper, we generalize Montgomery's method [12] using geometric progression (GP) (mod N) to construct a pair of nonlinear polynomials. We also introduce GP of length d + k with $1{\leq}k{\leq}d-1$ and show that we can construct polynomials of degree d having common root (mod N), where the number of such polynomials and the size of the coefficients can be precisely determined.

• International Journal of Control, Automation, and Systems
• /
• v.2 no.3
• /
• pp.319-332
• /
• 2004

This paper proposes some further improvements on N.K. Bose's 2D stability test for polynomials with real coefficients by revealing symmetric properties of the polynomials, resultants occurring in the test and by generalizing Sturm's method. The improved test can be fulfilled by a totally algebraic algorithm with a finite number of steps and the computational complexity is largely reduced as it involves only certain real variable polynomials with degrees not exceeding half of their previous complex variable counterparts. Nontrivial examples for 2D polynomials having both numerical and literal coefficients are also shown to illustrate the computational advantage of the proposed method.