• Title/Summary/Keyword: n-th polynomial

Search Result 30, Processing Time 0.023 seconds

GALOIS POLYNOMIALS

  • Lee, Ji-Eun;Lee, Ki-Suk
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.32 no.2
    • /
    • pp.171-177
    • /
    • 2019
  • We associate a positive integer n and a subgroup H of the group G(n) with a polynomial $J_{n,H}(x)$, which is called the Galois polynomial. It turns out that $J_{n,H}(x)$ is a polynomial with integer coefficients for any n and H. In this paper, we provide an equivalent condition for a subgroup H to provide the Galois polynomial which is irreducible over ${\mathbb{Q}}$.

SEMI-CYCLOTOMIC POLYNOMIALS

  • LEE, KI-SUK;LEE, JI-EUN;Kim, JI-HYE
    • Honam Mathematical Journal
    • /
    • v.37 no.4
    • /
    • pp.469-472
    • /
    • 2015
  • The n-th cyclotomic polynomial ${\Phi}_n(x)$ is irreducible over $\mathbb{Q}$ and has integer coefficients. The degree of ${\Phi}_n(x)$ is ${\varphi}(n)$, where ${\varphi}(n)$ is the Euler Phi-function. In this paper, we define Semi-Cyclotomic Polynomial $J_n(x)$. $J_n(x)$ is also irreducible over $\mathbb{Q}$ and has integer coefficients. But the degree of $J_n(x)$ is $\frac{{\varphi}(n)}{2}$. Galois Theory will be used to prove the above properties of $J_n(x)$.

POLYNOMIAL REPRESENTATIONS FOR n-TH ROOTS IN FINITE FIELDS

  • Chang, Seunghwan;Kim, Bihtnara;Lee, Hyang-Sook
    • 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.

IRREDUCIBILITY OF GALOIS POLYNOMIALS

  • Shin, Gicheol;Bae, Jae Yun;Lee, Ki-Suk
    • Honam Mathematical Journal
    • /
    • v.40 no.2
    • /
    • pp.281-291
    • /
    • 2018
  • We associate a positive integer n and a subgroup H of the group $({\mathbb{Z}}/n{\mathbb{Z}})^{\times}$ with a polynomial $J_n,H(x)$, which is called the Galois polynomial. It turns out that $J_n,H(x)$ is a polynomial with integer coefficients for any n and H. In this paper, we provide an equivalent condition for a subgroup H to provide the Galois polynomial which is irreducible over ${\mathbb{Q}}$ in the case of $n=p^{e_1}_1{\cdots}p^{e_r}_r$ (prime decomposition) with all $e_i{\geq}2$.

CIRCLE APPROXIMATION USING PARAMETRIC POLYNOMIAL CURVES OF HIGH DEGREE IN EXPLICIT FORM

  • Ahn, Young Joon
    • Communications of the Korean Mathematical Society
    • /
    • v.37 no.4
    • /
    • pp.1259-1267
    • /
    • 2022
  • In this paper we present a full circle approximation method using parametric polynomial curves with algebraic coefficients which are curvature continuous at both endpoints. Our method yields the n-th degree parametric polynomial curves which have a total number of 2n contacts with the full circle at both endpoints and the midpoint. The parametric polynomial approximants have algebraic coefficients involving rational numbers and radicals for degree higher than four. We obtain the exact Hausdorff distances between the circle and the approximation curves.

GALOIS POLYNOMIALS FROM QUOTIENT GROUPS

  • Lee, Ki-Suk;Lee, Ji-eun;Brandli, Gerold;Beyne, Tim
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.31 no.3
    • /
    • pp.309-319
    • /
    • 2018
  • Galois polynomials are defined as a generalization of the cyclotomic polynomials. The definition of Galois polynomials (and cyclotomic polynomials) is based on the multiplicative group of integers modulo n, i.e. ${\mathbb{Z}}_n^*$. In this paper, we define Galois polynomials which are based on the quotient group ${\mathbb{Z}}_n^*/H$.