• 제목/요약/키워드: symmetric group

검색결과 219건 처리시간 0.027초

A Parallel Iterative Algorithm for Solving The Eigenvalue Problem of Symmetric matrices

  • Baik, Ran
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • 제4권2호
    • /
    • pp.99-110
    • /
    • 2000
  • This paper is devoted to the parallelism of a numerical matrix eigenvalue problem. The eigenproblem arises in a variety of applications, including engineering, statistics, and economics. Especially we try to approach the industrial techniques from mathematical modeling. This paper has developed a parallel algorithm to find all eigenvalues. It is contributed to solve a specific practical problem, a vibration problem in the industry. Also we compare the runtime between the serial algorithm and the parallel algorithm for the given problems.

  • PDF

ON SUB-KAC ALGEBRAS AND SUBGROUPS

  • Lee, Jung-Rye
    • 한국수학교육학회지시리즈B:순수및응용수학
    • /
    • 제6권1호
    • /
    • pp.1-8
    • /
    • 1999
  • Let $K_{\alpha}(G)$ (resp. $K_s(G)$) be the abelian (resp. symmetric) Kac algebra for a locally compact group G. We show that there exists a one-to-one correspondence between the subgroups of G and the sub-Kac algebras of $K_{\alpha}(G)$ (resp. $K_s(G)$). Moreover we obtain similar correspondences between the subgroups of G and the reduced Kac algebras of $K_{\alpha}(G)$ (resp. $K_s(G)$).

  • PDF

GENUS DISTRIBUTIONS FOR BOUQUETS OF DIPOLES

  • Jin Hwan Kim;Jaeun Lee
    • 대한수학회지
    • /
    • 제35권1호
    • /
    • pp.225-234
    • /
    • 1998
  • We compute genus distributions for bouquets of dipoles by using the method concerning the cycle structure of permutations in the symmetric group. From this, we can deduce that every bouquet of dipoles is upper embeddable. We find a foumula for computing the embedding polynomials for bouquets of dipoles.

  • PDF

STRONG COMPATIBILITY IN CERTAIN QUASIGROUP NONUNIFORM HOMOGENEOUS SPACES OF DEGREE 4

  • Im, Bokhee;Ryu, Ji-Young
    • 호남수학학술지
    • /
    • 제41권3호
    • /
    • pp.595-607
    • /
    • 2019
  • We consider quasigroups $Q({\Gamma})$ obtained as certain double covers of the symmetric group $S_3$ of degree 3, for directed graphs ${\Gamma}$ on the vertex set $S_3$. We completely characterize the strong compatibility of elements of $Q({\Gamma})$ for any quasigroup nonuniform homogeneous space of degree 4. For such homogeneous spaces, we classify all the strong and weak compatibility graphs of $Q({\Gamma})$.

WHEN ALL PERMUTATIONS ARE COMBINATORIAL SIMILARITIES

  • Viktoriia Bilet;Oleksiy Dovgoshey
    • 대한수학회보
    • /
    • 제60권3호
    • /
    • pp.733-746
    • /
    • 2023
  • Let (X, d) be a semimetric space. A permutation Φ of the set X is a combinatorial self similarity of (X, d) if there is a bijective function f : d(X × X) → d(X × X) such that d(x, y) = f(d(Φ(x), Φ(y))) for all x, y ∈ X. We describe the set of all semimetrics ρ on an arbitrary nonempty set Y for which every permutation of Y is a combinatorial self similarity of (Y, ρ).

A NOTE ON g-SEMISIMPLICITY OF A FINITE-DIMENSIONAL MODULE OVER THE RATIONAL CHEREDNIK ALGEBRA OF TYPE A

  • Gicheol Shin
    • 충청수학회지
    • /
    • 제36권2호
    • /
    • pp.77-86
    • /
    • 2023
  • The purpose of this paper is to show that a certain finite dimensional representation of the rational Cherednik algebra of type A has a basis consisting of simultaneous eigenvectors for the actions of a certain family of commuting elements, which are introduced in the author's previous paper. To this end, we introduce a combinatorial object, which is called a restricted arrangement of colored beads, and consider an action of the affine symmetric group on the set of the arrangements.

우성안에 따른 길이식별 인지능력 차이에 관한 연구 (The Study on Difference in Length Cognition Ability in Dominant Eye)

  • 남건우;박대성
    • 대한물리치료과학회지
    • /
    • 제15권4호
    • /
    • pp.11-17
    • /
    • 2008
  • Background: Human body is formed of symmetric bilateral structures that are comprised of eye, upper arm, lower arm and etc. but, we are used only dominant components. The purpose of this study was to analysis length cognition ability in dominant eye. Methods: Total 88 persons (male 18, female 70) were participated in this study. They were tested with ‘hole in the card’ test for identification of dominant eye's side, then the length cognition ability was measured in right & left axillary level by describing 10cm line. Results: The results by independent t-test were as follows. In difference of length cognition ability in right axillary level between right dominant eyed group & left dominant eyed group, right dominant eyed group was superior to left dominant eyed group, but significant difference was not existed statistically(p>.05). In left axillary level, right dominant eyed group was superior to left dominant eyed group, but significant difference was not existed statistically(p>.05). Conclusion: These result can be applied to the learning of palpation & observation skill in physical therapy, although this study was not identify a relation between dominant eye & dominant hand.

  • PDF

암호화된 이미지에서 대칭키 암호화 알고리듬을 이용한 가역 비밀이미지 공유 기법 (Reversible Secret Sharing Scheme Using Symmetric Key Encryption Algorithm in Encrypted Images)

  • 전병현;신상호;정기현;이준호;유기영
    • 한국멀티미디어학회논문지
    • /
    • 제18권11호
    • /
    • pp.1332-1341
    • /
    • 2015
  • This paper proposes a novel reversible secret sharing scheme using AES algorithm in encrypted images. In the proposed scheme, a role of the dealer is divided into an image provider and a data hider. The image provider encrypts the cover image with a shared secret key and sends it to the dealer. The dealer embeds the secret data into the encrypted image and transmits encrypted shadow images to the corresponding participants. We utilize Galois polynomial arithmetic operation over 28 and the coefficient of the higher-order term is fixed to one in order to prevent the overflow. In experimental results, we demonstrate that the PSNR is sustained close to 44dB and the embedding capacity is 524,288 bits.