• Title/Summary/Keyword: orthogonal groups

Search Result 80, Processing Time 0.027 seconds

IDENTITIES ARISING FROM GAUSS SUMS FOR SYMPLECTIC AND ORTHOGONAL GROUPS

  • Chae, Hi-Joon;Kim, Dae-San
    • Journal of the Korean Mathematical Society
    • /
    • v.47 no.2
    • /
    • pp.409-424
    • /
    • 2010
  • We express Gauss sums for symplectic and orthogonal groups over finite fields as averages of exponential sums over certain maximal tori. Together with our previous results, we obtain some interesting identities involving various classical Gauss and Kloosterman sums.

On the Fixed Points of Gradient Flows on Orthogonal Groups

  • Hori, Gen
    • Proceedings of the IEEK Conference
    • /
    • 2002.07b
    • /
    • pp.1204-1207
    • /
    • 2002
  • The fixed points of two known gradient flows defined on adjoint orbits of orthogonal groups are analyzed through the critical point analysis of the potential functions. The results show that some known properties of these gradient flows are shared with the gradient flows of the same potential functions with respect to other metrics.

  • PDF

Orthogonal projection of points in CAD/CAM applications: an overview

  • Ko, Kwanghee;Sakkalis, Takis
    • Journal of Computational Design and Engineering
    • /
    • v.1 no.2
    • /
    • pp.116-127
    • /
    • 2014
  • This paper aims to review methods for computing orthogonal projection of points onto curves and surfaces, which are given in implicit or parametric form or as point clouds. Special emphasis is place on orthogonal projection onto conics along with reviews on orthogonal projection of points onto curves and surfaces in implicit and parametric form. Except for conics, computation methods are classified into two groups based on the core approaches: iterative and subdivision based. An extension of orthogonal projection of points to orthogonal projection of curves onto surfaces is briefly explored. Next, the discussion continues toward orthogonal projection of points onto point clouds, which spawns a different branch of algorithms in the context of orthogonal projection. The paper concludes with comments on guidance for an appropriate choice of methods for various applications.

Quasi-Orthogonal STBC with Iterative Decoding in Bit Interleaved Coded Modulation

  • Sung, Chang-Kyung;Kim, Ji-Hoon;Lee, In-Kyu
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.4A
    • /
    • pp.426-433
    • /
    • 2008
  • In this paper, we present a method to improve the performance of the four transmit antenna quasi-orthogonal space-time block code (STBC) in the coded system. For the four transmit antenna case, the quasi-orthogonal STBC consists of two symbol groups which are orthogonal to each other, but intra group symbols are not. In uncoded system with the matched filter detection, constellation rotation can improve the performance. However, in coded systems, its gain is absorbed by the coding gain especially for lower rate code. We propose an iterative decoding method to improve the performance of quasi-orthogonal codes in coded systems. With conventional quasi-orthogonal STBC detection, the joint ML detection can be improved by iterative processing between the demapper and the decoder. Simulation results shows that the performance improvement is about 2dB at 1% frame error rate.

INFINITE FAMILIES OF RECURSIVE FORMULAS GENERATING POWER MOMENTS OF TERNARY KLOOSTERMAN SUMS WITH SQUARE ARGUMENTS ASSOCIATED WITH O-(2n, q)

  • Kim, Dae-San
    • Journal of the Korean Mathematical Society
    • /
    • v.48 no.2
    • /
    • pp.267-288
    • /
    • 2011
  • In this paper, we construct eight infinite families of ternary linear codes associated with double cosets with respect to certain maximal parabolic subgroup of the special orthogonal group $SO^-$(2n, q). Here q is a power of three. Then we obtain four infinite families of recursive formulas for power moments of Kloosterman sums with square arguments and four infinite families of recursive formulas for even power moments of those in terms of the frequencies of weights in the codes. This is done via Pless power moment identity and by utilizing the explicit expressions of exponential sums over those double cosets related to the evaluations of "Gauss sums" for the orthogonal groups $O^-$(2n, q).

LOW RANK ORTHOGONAL BUNDLES AND QUADRIC FIBRATIONS

  • Insong Choe ;George H. Hitching
    • Journal of the Korean Mathematical Society
    • /
    • v.60 no.6
    • /
    • pp.1137-1169
    • /
    • 2023
  • Let C be a curve and V → C an orthogonal vector bundle of rank r. For r ≤ 6, the structure of V can be described using tensor, symmetric and exterior products of bundles of lower rank, essentially due to the existence of exceptional isomorphisms between Spin(r, ℂ) and other groups for these r. We analyze these structures in detail, and in particular use them to describe moduli spaces of orthogonal bundles. Furthermore, the locus of isotropic vectors in V defines a quadric subfibration QV ⊂ ℙV . Using familiar results on quadrics of low dimension, we exhibit isomorphisms between isotropic Quot schemes of V and certain ordinary Quot schemes of line subbundles. In particular, for r ≤ 6 this gives a method for enumerating the isotropic subbundles of maximal degree of a general V , when there are finitely many.