• Title/Summary/Keyword: Real Number Field

Search Result 392, Processing Time 0.029 seconds

EVALUATION OF THE ZETA FUNCTIONS OF TOTALLY REAL NUMBER FIELDS AND ITS APPLICATION

  • Lee, Jun Ho
    • East Asian mathematical journal
    • /
    • v.35 no.1
    • /
    • pp.85-90
    • /
    • 2019
  • In this paper, we are interested in the evaluation of special values of the Dedekind zeta function of a totally real number field. In particular, we revisit Siegel method for values of the zeta function of a totally real number field at negative odd integers and explain how this method is applied to the case of non-normal totally real number field. As one of its applications, we give divisibility property for the values in the special case

REAL QUADRATIC FUNCTION FIELDS OF MINIMAL TYPE

  • Byeon, Dongho;Keem, Jiae;Lee, Sangyoon
    • Communications of the Korean Mathematical Society
    • /
    • v.28 no.4
    • /
    • pp.735-740
    • /
    • 2013
  • In this paper, we will introduce the notion of the real quadratic function fields of minimal type, which is a function field analogue to Kawamoto and Tomita's notion of real quadratic fields of minimal type. As number field cases, we will show that there are exactly 6 real quadratic function fields of class number one that are not of minimal type.

IMAGINARY BICYCLIC FUNCTION FIELDS WITH THE REAL CYCLIC SUBFIELD OF CLASS NUMBER ONE

  • Jung, Hwan-Yup
    • Bulletin of the Korean Mathematical Society
    • /
    • v.45 no.2
    • /
    • pp.375-384
    • /
    • 2008
  • Let $k={\mathbb{F}}_q(T)$ and ${\mathbb{A}}={\mathbb{F}}_q[T]$. Fix a prime divisor ${\ell}$ q-1. In this paper, we consider a ${\ell}$-cyclic real function field $k(\sqrt[{\ell}]P)$ as a subfield of the imaginary bicyclic function field K = $k(\sqrt[{\ell}]P,\;(\sqrt[{\ell}]{-Q})$, which is a composite field of $k(\sqrt[{\ell}]P)$ wit a ${\ell}$-cyclic totally imaginary function field $k(\sqrt[{\ell}]{-Q})$ of class number one. und give various conditions for the class number of $k(\sqrt[{\ell}]{P})$ to be one by using invariants of the relatively cyclic unramified extensions $K/F_i$ over ${\ell}$-cyclic totally imaginary function field $F_i=k(\sqrt[{\ell}]{-P^iQ})$ for $1{\leq}i{\leq}{\ell}-1$.

ON THE PARITY OF THE CLASS NUMBER OF SOME REAL BIQUADRATIC FUNCTION FIELD

  • Ahn, Jaehyun;Jung, Hwanyup
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.23 no.1
    • /
    • pp.169-176
    • /
    • 2010
  • Let $k={\mathbb{F}}_q(T)$ and ${\mathbb{A}}={\mathbb{F}}_q[T]$. In this paper, we obtain the the criterion for the parity of the ideal class number h(${\mathcal{O}}_K$) of the real biquadratic function field $K=k(\sqrt{P_1},\;\sqrt{P_2})$, where $P_1$, $P_2{\in}{\mathbb{A}}$ be two distinct monic primes of even degree.

Real-Tim Sound Field Effect Implementation Using Block Filtering and QFT (Block Filtering과 QFT를 이용한 실시간 음장 효과구현)

  • Sohn Sung-Yong;Seo Jeongil;Hahn Minsoo
    • MALSORI
    • /
    • no.51
    • /
    • pp.85-98
    • /
    • 2004
  • It is almost impossible to generate the sound field effect in real time with the time-domain linear convolution because of its large multiplication operation requirement. To solve this, three methods are introduced to reduce the number of multiplication operations in this paper. Firstly, the time-domain linear convolution is replaced with the frequency-domain circular convolution. In other words, the linear convolution result can be derived from that of the circular convolution. This technique reduces the number of multiplication operations remarkably, Secondly, a subframe concept is introduced, i.e., one original frame is divided into several subframes. Then the FFT is executed for each subframe and, as a result, the number of multiplication operations can be reduced. Finally, the QFT is used in stead of the FFT. By combining all the above three methods into our final the SFE generation algorithm, the number of computations are reduced sufficiently and the real-time SFE generation becomes possible with a general PC.

  • PDF

NEW BOUNDS FOR FUNDAMENTAL UNITS AND CLASS NUMBERS OF REAL QUADRATIC FIELDS

  • Isikay, Sevcan;Pekin, Ayten
    • Bulletin of the Korean Mathematical Society
    • /
    • v.58 no.5
    • /
    • pp.1149-1161
    • /
    • 2021
  • In this paper, we present new bounds on the fundamental units of real quadratic fields ${\mathbb{Q}}({\sqrt{d}})$ using the continued fraction expansion of the integral basis element of the field. Furthermore, we apply these bounds to Dirichlet's class number formula. Consequently, we provide computational advantages to estimate the class numbers of such fields. We also give some numerical examples.

RELATIVE CLASS NUMBER ONE PROBLEM OF REAL QUADRATIC FIELDS AND CONTINUED FRACTION OF $\sqrt{m}$ WITH PERIOD 6

  • Lee, Jun Ho
    • East Asian mathematical journal
    • /
    • v.37 no.5
    • /
    • pp.613-617
    • /
    • 2021
  • Abstract. For a positive square-free integer m, let K = ℚ($\sqrt{m}$) be a real quadratic field. The relative class number Hd(f) of K of discriminant d is the ratio of class numbers 𝒪K and 𝒪f, where 𝒪K is the ring of integers of K and 𝒪f is the order of conductor f given by ℤ + f𝒪K. In 1856, Dirichlet showed that for certain m there exists an infinite number of f such that the relative class number Hd(f) is one. But it remained open as to whether there exists such an f for each m. In this paper, we give a result for existence of real quadratic field ℚ($\sqrt{m}$) with relative class number one where the period of continued fraction expansion of $\sqrt{m}$ is 6.

Study of the Real Number Field Extension Operand of Elliptic Curve Cryptography (타원곡선 암호의 실수체 확장 연산항에 관한 연구)

  • Woo, Chan-Il;Goo, Eun-Hee
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.15 no.9
    • /
    • pp.5790-5795
    • /
    • 2014
  • Elliptic curve cryptography (ECC) is an extremely important part of information protection systems because it has outstanding safety among public key encryption algorithms. On the other hand, as ECC cannot obtain accurate values using a real number field because of the slow calculation and errors from rounding off, studies of ECC have focused on a finite field. If ECC can be extended to the real number field, more diverse keys can be selected compared to ECC only based on a finite field. Accordingly, in this paper, a method for constructing a cryptographic system with a high degree of safety is proposed through the diversification of keys selected by the user based on the operant extension method instead of extracting keys only using integer values.