• 대한수학회지
• /
• 제52권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.

• 한국수학사학회지
• /
• 제27권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.

• 한국컴퓨터그래픽스학회논문지
• /
• 제7권1호
• /
• pp.19-25
• /
• 2001

본 논문에서는 평면 다항식 피타고리안 호도그라프 곡선을 그 근들의 관점에서 특별한 기하학적 재 매개화하는 것에 관하여 연구한다. 피타고라스 호도그라프 곡선들은 그 호도그라프의 근들에 의하여 완전히 결정된다. 피타고라스 호도그라프 곡선들의 근들의 자취는 아주 흥미로운 기하학적 성질들을 만족함을 보인다.

• 대한수학회보
• /
• 제59권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𝜋).

• 전기학회논문지
• /
• 제67권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.

• 대한수학회보
• /
• 제51권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.

• 정보보호학회논문지
• /
• 제21권2호
• /
• pp.3-11
• /
• 2011

$F_{3^m}$에서의 Tate 페어링 또는 ${\eta}_T$ 페어링 알고리즘 계산을 위하여 효율적인 세제곱근 계산은 매우 중요하다. $x^{1/3}$의 다항식 표현 중 0이 아닌 계수들의 개수를 $x^{1/3}$의 헤밍웨이트라 할 때, 이 헤밍웨이트가 세제곱근 연산의 효율성을 결정하게 된다. O. Ahmadi 등은 $f(x)=x^m+ax^k+b$ (a, $b{\in}F_3$)가 $F_3[x]$의 삼항 기약다항식이라 할 때, $F_{3^m}=F_3[x]/(f)$을 생성하는 모든 삼항 기약다항식에 대하여 $x^{1/3}$의 헤밍웨이트를 계산하였다. 본 논문에서는 Shifted Polynomial Basis(SPB)가 기존의 결과보다 $x^{1/3}$의 헤밍웨이트를 낮출 수 있음을 보이며, 모듈로 감산 연산이 필요 없는 가장 적합한 SPB를 제공한다.

• 대한수학회지
• /
• 제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.

• 한국수학사학회지
• /
• 제36권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.

• 대한수학회지
• /
• 제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$.