• Journal of the Korean Mathematical Society
• /
• v.52 no.1
• /
• pp.209-224
• /
• 2015

Computing square, cube and n-th roots in general, in finite fields, are important computational problems with significant applications to cryptography. One interesting approach to computational problems is by using polynomial representations. Agou, Del$\acute{e}$eglise and Nicolas proved results concerning the lower bounds for the length of polynomials representing square roots modulo a prime p. We generalize the results by considering n-th roots over finite fields for arbitrary n > 2.

• Journal for History of Mathematics
• /
• v.27 no.3
• /
• pp.165-182
• /
• 2014

After algebraic expressions for the roots of 3rd and 4th degree polynomial equations were given in the mid 16th century, seeking such a formula for the 5th and greater degree equations had been one main problem for algebraists for almost 200 years. Lagrange made careful and thorough investigation of various solving methods for equations with the purpose of finding a principle which could be applicable to general equations. In the process of doing this, he found a relation between the roots of the original equation and its auxiliary equation using permutations of the roots. Lagrange's ingenious idea of using permutations of roots of the original equation is regarded as the key factor of the Abel's proof of unsolvability by radicals of general 5th degree equations and of Galois' theory as well. This paper intends to examine Lagrange's contribution in the theory of polynomial equations, providing a detailed analysis of various solving methods of Lagrange and others before him.

• Journal of the Korea Computer Graphics Society
• /
• v.7 no.1
• /
• pp.19-25
• /
• 2001

In this paper, we study the special geometric reparametization of the (plane polynomial) Pythagorean Hodograph curves in the view point of their roots. The PH curves are completely determined by the roots of their hodographs. we show that the loci of roots of the PH curves satisfy some interesting geometric properties.

• Bulletin of the Korean Mathematical Society
• /
• v.59 no.5
• /
• pp.1269-1277
• /
• 2022

In this paper we consider a sequence of polynomials defined by some recurrence relation. They include, for instance, Poupard polynomials and Kreweras polynomials whose coefficients have some combinatorial interpretation and have been investigated before. Extending a recent result of Chapoton and Han we show that each polynomial of this sequence is a self-reciprocal polynomial with positive coefficients whose all roots are unimodular. Moreover, we prove that their arguments are uniformly distributed in the interval [0, 2𝜋).

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.67 no.2
• /
• pp.277-284
• /
• 2018

In this paper, a new numerical method of finding the roots of a nonlinear system is proposed, which extends the conventional fixed point iterative method by relaxing the constraints on it. The proposed method determines the real valued roots and expands the convergence region by relaxing the constraints on the conventional fixed point iterative method, which transforms the diverging root searching iterations into the converging iterations by employing the metric induced by the geometrical characteristics of a polynomial. A metric is set to measure the distance between a point of a real-valued function and its corresponding image point of its inverse function. The proposed scheme provides the convenience in finding not only the real roots of polynomials but also the roots of the nonlinear systems in the various application areas of science and engineering.

• Bulletin of the Korean Mathematical Society
• /
• v.51 no.2
• /
• pp.539-545
• /
• 2014

We show that roots of log-concave Alexander knot polynomials are dense in C. This in particular implies that the log-concavity and Hoste's conjecture on the Alexander polynomial of alternating knots are (essentially) independent.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.21 no.2
• /
• pp.3-11
• /
• 2011

Evaluation of cube roots in characteristic three finite fields is required for Tate (or modified Tate) pairing computation. The Hamming weights (the number of nonzero coefficients) in the polynomial representations of $x^{1/3}$ and $x^{2/3}$ determine the efficiency of cube roots computation, where $F_{3^m}$is represented as $F_3[x]/(f)$ and $f(x)=x^m+ax^k+b{\in}F_3[x]$ (a, $b{\in}F_3$) is an irreducible trinomial. O. Ahmadi et al. determined the Hamming weights of $x^{1/3}$ and $x^{2/3}$ for all irreducible trinomials. In this paper, we present formulas for cube roots in $F_{3^m}$ using the shifted polynomial basis(SPB). Moreover, we provide the suitable shifted polynomial basis bring no further modular reduction process.

• Journal of the Korean Mathematical Society
• /
• v.57 no.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.

• Journal for History of Mathematics
• /
• v.36 no.1
• /
• pp.1-17
• /
• 2023

Paper folding is a versatile tool that can be used not only as a mathematical model for analyzing the geometric properties of plane and spatial figures but also as a visual method for finding the real roots of polynomial equations. The historical evolution of origami's geometric and algebraic techniques has led to the discovery of definitions and properties that can enhance one's cognitive understanding of mathematical concepts and generate mathematical interest and motivation on an emotional level. This paper aims to examine the history of origami geometry, the utilization of origami for solving polynomial equations, and the process of determining the real roots of quadratic, cubic, and quartic equations through origami techniques.

• Journal of the Korean Mathematical Society
• /
• v.45 no.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$.