• 제목/요약/키워드: cyclotomic field

검색결과 23건 처리시간 0.018초

SCALAR EXTENSION OF SCHUR ALGEBRAS

  • Choi, Eun-Mi
    • 대한수학회보
    • /
    • 제42권3호
    • /
    • pp.453-467
    • /
    • 2005
  • Let K be an algebraic number field. If k is the maximal cyclotomic subextension in K then the Schur K-group S(K) is obtained from the Schur k-group S(k) by scalar extension. In the paper we study projective Schur group PS(K) which is a generalization of Schur group, and prove that a projective Schur K-algebra is obtained by scalar extension of a projective Schur k-algebra where k is the maximal radical extension in K with mild condition.

ℓ-RANKS OF CLASS GROUPS OF FUNCTION FIELDS

  • Bae, Sung-Han;Jung, Hwan-Yup
    • 대한수학회지
    • /
    • 제49권1호
    • /
    • pp.49-67
    • /
    • 2012
  • In this paper we give asymptotic formulas for the number of ${\ell}$-cyclic extensions of the rational function field $k=\mathbb{F}_q(T)$ with prescribe ${\ell}$-class numbers inside some cyclotomic function fields, and density results for ${\ell}$-cyclic extensions of k with certain properties on the ideal class groups.

MINIMAL QUADRATIC RESIDUE CYCLIC CODES OF LENGTH $2^{n}$

  • BATRA SUDHIR;ARORA S. K.
    • Journal of applied mathematics & informatics
    • /
    • 제18권1_2호
    • /
    • pp.25-43
    • /
    • 2005
  • Let F be a finite field of prime power order q(odd) and the multiplicative order of q modulo $2^{n}\;(n>1)\;be\; {\phi}(2^{n})/2$. If n > 3, then q is odd number(prime or prime power) of the form $8m{\pm}3$. If q = 8m - 3, then the ring $R_{2^n} = F[x]/ < x^{2^n}-1 >$ has 2n primitive idempotents. The explicit expressions for these primitive idempotents are obtained and the minimal QR cyclic codes of length $2^{n}$ generated by these idempotents are completely described. If q = 8m + 3 then the expressions for the 2n - 1 primitive idempotents of $R_{2^n}$ are obtained. The generating polynomials and the upper bounds of the minimum distance of minimal QR cyclic codes generated by these 2n-1 idempotents are also obtained. The case n = 2,3 is dealt separately.