• Title/Summary/Keyword: Galois point

Search Result 7, Processing Time 0.02 seconds

RELATING GALOIS POINTS TO WEAK GALOIS WEIERSTRASS POINTS THROUGH DOUBLE COVERINGS OF CURVES

  • Komeda, Jiryo;Takahashi, Takeshi
    • Journal of the Korean Mathematical Society
    • /
    • v.54 no.1
    • /
    • pp.69-86
    • /
    • 2017
  • The point $P{\in}{\mathbb{P}}^2$ is referred to as a Galois point for a nonsingular plane algebraic curve C if the projection ${\pi}_P:C{\rightarrow}{\mathbb{P}}^1$ from P is a Galois covering. In contrast, the point $P^{\prime}{\in}C^{\prime}$ is referred to as a weak Galois Weierstrass point of a nonsingular algebraic curve C' if P' is a Weierstrass point of C' and a total ramification point of some Galois covering $f:C^{\prime}{\rightarrow}{\mathbb{P}}^1$. In this paper, we discuss the following phenomena. For a nonsingular plane curve C with a Galois point P and a double covering ${\varphi}:C{\rightarrow}C^{\prime}$, if there exists a common ramification point of ${\pi}_P$ and ${\varphi}$, then there exists a weak Galois Weierstrass point $P^{\prime}{\in}C^{\prime}$ with its Weierstrass semigroup such that H(P') = or , which is a semigroup generated by two positive integers r and 2r + 1 or 2r - 1, such that P' is a branch point of ${\varphi}$. Conversely, for a weak Galois Weierstrass point $P^{\prime}{\in}C^{\prime}$ with H(P') = or , there exists a nonsingular plane curve C with a Galois point P and a double covering ${\varphi}:C{\rightarrow}C^{\prime}$ such that P' is a branch point of ${\varphi}$.

LINEAR AUTOMORPHISMS OF SMOOTH HYPERSURFACES GIVING GALOIS POINTS

  • Hayashi, Taro
    • Bulletin of the Korean Mathematical Society
    • /
    • v.58 no.3
    • /
    • pp.617-635
    • /
    • 2021
  • Let X be a smooth hypersurface X of degree d ≥ 4 in a projective space ℙn+1. We consider a projection of X from p ∈ ℙn+1 to a plane H ≅ ℙn. This projection induces an extension of function fields ℂ(X)/ℂ(ℙn). The point p is called a Galois point if the extension is Galois. In this paper, we will give necessary and sufficient conditions for X to have Galois points by using linear automorphisms.

NUMBER OF WEAK GALOIS-WEIERSTRASS POINTS WITH WEIERSTRASS SEMIGROUPS GENERATED BY TWO ELEMENTS

  • Komeda, Jiryo;Takahashi, Takeshi
    • Journal of the Korean Mathematical Society
    • /
    • v.56 no.6
    • /
    • pp.1463-1474
    • /
    • 2019
  • Let C be a nonsingular projective curve of genus ${\geq}2$ over an algebraically closed field of characteristic 0. For a point P in C, the Weierstrass semigroup H(P) is defined as the set of non-negative integers n for which there exists a rational function f on C such that the order of the pole of f at P is equal to n, and f is regular away from P. A point P in C is referred to as a weak Galois-Weierstrass point if P is a Weierstrass point and there exists a Galois morphism ${\varphi}:C{\rightarrow}{\mathbb{p}}^1$ such that P is a total ramification point of ${\varphi}$. In this paper, we investigate the number of weak Galois-Weierstrass points of which the Weierstrass semigroups are generated by two positive integers.

GALOIS CORRESPONDENCES FOR SUBFACTORS RELATED TO NORMAL SUBGROUPS

  • Lee, Jung-Rye
    • Communications of the Korean Mathematical Society
    • /
    • v.17 no.2
    • /
    • pp.253-260
    • /
    • 2002
  • For an outer action $\alpha$ of a finite group G on a factor M, it was proved that H is a, normal subgroup of G if and only if there exists a finite group F and an outer action $\beta$ of F on the crossed product algebra M $\times$$_{\alpha}$ G = (M $\times$$_{\alpha}$ F. We generalize this to infinite group actions. For an outer action $\alpha$ of a discrete group, we obtain a Galois correspondence for crossed product algebras related to normal subgroups. When $\alpha$ satisfies a certain condition, we also obtain a Galois correspondence for fixed point algebras. Furthermore, for a minimal action $\alpha$ of a compact group G and a closed normal subgroup H, we prove $M^{G}$ = ( $M^{H}$)$^{{beta}(G/H)}$for a minimal action $\beta$ of G/H on $M^{H}$.f G/H on $M^{H}$.TEX> H/.

TORSION POINTS OF ELLIPTIC CURVES WITH BAD REDUCTION AT SOME PRIMES II

  • Yasuda, Masaya
    • Bulletin of the Korean Mathematical Society
    • /
    • v.50 no.1
    • /
    • pp.83-96
    • /
    • 2013
  • Let K be a number field and fix a prime number $p$. For any set S of primes of K, we here say that an elliptic curve E over K has S-reduction if E has bad reduction only at the primes of S. There exists the set $B_{K,p}$ of primes of K satisfying that any elliptic curve over K with $B_{K,p}$-reduction has no $p$-torsion points under certain conditions. The first aim of this paper is to construct elliptic curves over K with $B_{K,p}$-reduction and a $p$-torsion point. The action of the absolute Galois group on the $p$-torsion subgroup of E gives its associated Galois representation $\bar{\rho}_{E,p}$ modulo $p$. We also study the irreducibility and surjectivity of $\bar{\rho}_{E,p}$ for semistable elliptic curves with $B_{K,p}$-reduction.

Efficient Algorithm and Architecture for Elliptic Curve Cryptographic Processor

  • Nguyen, Tuy Tan;Lee, Hanho
    • JSTS:Journal of Semiconductor Technology and Science
    • /
    • v.16 no.1
    • /
    • pp.118-125
    • /
    • 2016
  • This paper presents a new high-efficient algorithm and architecture for an elliptic curve cryptographic processor. To reduce the computational complexity, novel modified Lopez-Dahab scalar point multiplication and left-to-right algorithms are proposed for point multiplication operation. Moreover, bit-serial Galois-field multiplication is used in order to decrease hardware complexity. The field multiplication operations are performed in parallel to improve system latency. As a result, our approach can reduce hardware costs, while the total time required for point multiplication is kept to a reasonable amount. The results on a Xilinx Virtex-5, Virtex-7 FPGAs and VLSI implementation show that the proposed architecture has less hardware complexity, number of clock cycles and higher efficiency than the previous works.

Design of A Reed-Solomon Decoder for UWB Systems (UWB 시스템 용 Reed-Solomon 복호기 설계)

  • Cho, Yong-Suk
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.4C
    • /
    • pp.191-196
    • /
    • 2011
  • In this paper, we propose a design method of Reed-Solomon (23, 17) decoder for UWB using direct decoding method. The direct decoding algorithm is more efficient for the case of relatively small error correction capability. The proposed decoder requires only 9 $GF(2^m)$ multipliers in obtaining the error-locator polynomial and the error-evaluator polynomial, whereas other decoders need about 20 multipliers. Thus, the attractive feature of this decoder is its remarkable simplicity from the point of view of hardware implementation. Futhermore, the proposed decoder has very simple control circuit and short decoding delay. Therefore this decoder can be implemented by simple hardware and also save buffer memory which stores received sequence.