• 제목/요약/키워드: Partition algebra

검색결과 14건 처리시간 0.021초

Cellularity of a Larger Class of Diagram Algebras

  • BI, N. KARIMILLA
    • Kyungpook Mathematical Journal
    • /
    • 제55권4호
    • /
    • pp.837-858
    • /
    • 2015
  • In this paper, we realize the algebra of ${\mathbb{Z}}_2$ relations, signed partition algebras and partition algebras as tabular algebras and prove the cellularity of these algebras using the method of [2]. Using the results of Graham and Lehrer in [1], we give the modular representations of the algebra of ${\mathbb{Z}}_2$-relations, signed partition algebras and partition algebras.

ON CLASS ALGEBRAS

  • Choi, Eun-Mi;Lee, Hei-Sook
    • 대한수학회지
    • /
    • 제40권2호
    • /
    • pp.273-286
    • /
    • 2003
  • Let $F^{\alpha}$G be a twisted group algebra. A subalgebra of $F^{\alpha}$G generated by all class sums of partition P of G is called a projective class algebra in $F^{alpha}$G associated with partition P. In this paper we study various partitions of G determined by actions of certain operator groups on G and construct projective class algebras depending on the actions. With regard to projective class algebras, we investigate structures of associated skew group algebras and fixed group algebras.

Note on Cellular Structure of Edge Colored Partition Algebras

  • Kennedy, A. Joseph;Muniasamy, G.
    • Kyungpook Mathematical Journal
    • /
    • 제56권3호
    • /
    • pp.669-682
    • /
    • 2016
  • In this paper, we study the cellular structure of the G-edge colored partition algebras, when G is a finite group. Further, we classified all the irreducible representations of these algebras using their cellular structure whenever G is a finite cyclic group. Also we prove that the ${\mathbb{Z}}/r{\mathbb{Z}}$-Edge colored partition algebras are quasi-hereditary over a field of characteristic zero which contains a primitive $r^{th}$ root of unity.

PROJECTIVE SCHUR ALGEBRAS AS CLASS ALGEBRAS

  • Choi, Eun-Mi;Lee, Hei-Sook
    • 대한수학회보
    • /
    • 제38권4호
    • /
    • pp.803-814
    • /
    • 2001
  • A projective Schur algebra associated with a partition of finite group G can be constructed explicitly by defining linear transformations of G. We will consider various linear transformations and count the number of equivalent classes in a finite group. Then we construct projective Schur algebra dimension is determined by the number of classes.

  • PDF

On the Tensor Product of m-Partition Algebras

  • Kennedy, A. Joseph;Jaish, P.
    • Kyungpook Mathematical Journal
    • /
    • 제61권4호
    • /
    • pp.679-710
    • /
    • 2021
  • We study the tensor product algebra Pk(x1) ⊗ Pk(x2) ⊗ ⋯ ⊗ Pk(xm), where Pk(x) is the partition algebra defined by Jones and Martin. We discuss the centralizer of this algebra and corresponding Schur-Weyl dualities and also index the inequivalent irreducible representations of the algebra Pk(x1) ⊗ Pk(x2) ⊗ ⋯ ⊗ Pk(xm) and compute their dimensions in the semisimple case. In addition, we describe the Bratteli diagrams and branching rules. Along with that, we have also constructed the RS correspondence for the tensor product of m-partition algebras which gives the bijection between the set of tensor product of m-partition diagram of Pk(n1) ⊗ Pk(n2) ⊗ ⋯ ⊗ Pk(nm) and the pairs of m-vacillating tableaux of shape [λ] ∈ Γkm, Γkm = {[λ] = (λ1, λ2, …, λm)|λi ∈ Γk, i ∈ {1, 2, …, m}} where Γk = {λi ⊢ t|0 ≤ t ≤ k}. Also, we provide proof of the identity $(n_1n_2{\cdots}n_m)^k={\sum}_{[{\lambda}]{\in}{\Lambda}^k_{{n_1},{n_2},{\ldots},{n_m}}}$ f[λ]mk[λ] where mk[λ] is the multiplicity of the irreducible representation of $S{_{n_1}}{\times}S{_{n_2}}{\times}....{\times}S{_{n_m}}$ module indexed by ${[{\lambda}]{\in}{\Lambda}^k_{{n_1},{n_2},{\ldots},{n_m}}}$, where f[λ] is the degree of the corresponding representation indexed by ${[{\lambda}]{\in}{\Lambda}^k_{{n_1},{n_2},{\ldots},{n_m}}}$ and ${[{\lambda}]{\in}{\Lambda}^k_{{n_1},{n_2},{\ldots},{n_m}}}=\{[{\lambda}]=({\lambda}_1,{\lambda}_2,{\ldots},{\lambda}_m){\mid}{\lambda}_i{\in}{\Lambda}^k_{n_i},i{\in}\{1,2,{\ldots},m\}\}$ where ${\Lambda}^k_{n_i}=\{{\mu}=({\mu}_1,{\mu}_2,{\ldots},{\mu}_t){\vdash}n_i{\mid}n_i-{\mu}_1{\leq}k\}$.

PLA에 기초한 디지털논리스위칭함수 구성 (The Construction of the Digital Logic Switching Functions using PLA)

  • 박춘명
    • 한국정보통신학회논문지
    • /
    • 제12권10호
    • /
    • pp.1794-1800
    • /
    • 2008
  • 본 논문에서는 PLA를 사용하여 디지털논리 스위칭함수를 효과적으로 구성하는 방법을 제안하였다. 제안한 방법은 먼저 포스트 대수를 기반으로 MIN 대수연산과 MAX 대수연산을 제안하였고, 이를 구현하기 위해 T-gate에 대해 논의하였다. 그리고 PLA의 기본 회로인 MIN 배열, MAX 배열과 리터럴에 대해 논의하였다. PLA를 사용하여 디지털논리스위칭함수를 설계하기 위해 변수분할, 모듈러 구조, 리터럴 생성기, 복호기와 인버터를 제안하였다. 제안한 방법은 좀 더 콤펙트하고 확장성이 용이하다.

GRADED BETTI NUMBERS OF GOOD FILTRATIONS

  • Lamei, Kamran;Yassemi, Siamak
    • 대한수학회보
    • /
    • 제57권5호
    • /
    • pp.1231-1240
    • /
    • 2020
  • The asymptotic behavior of graded Betti numbers of powers of homogeneous ideals in a polynomial ring over a field has recently been reviewed. We extend quasi-polynomial behavior of graded Betti numbers of powers of homogenous ideals to ℤ-graded algebra over Noetherian local ring. Furthermore our main result treats the Betti table of filtrations which is finite or integral over the Rees algebra.

DUAL PRESENTATION AND LINEAR BASIS OF THE TEMPERLEY-LIEB ALGEBRAS

  • Lee, Eon-Kyung;Lee, Sang-Jin
    • 대한수학회지
    • /
    • 제47권3호
    • /
    • pp.445-454
    • /
    • 2010
  • The braid group $B_n$ maps homomorphically into the Temperley-Lieb algebra $TL_n$. It was shown by Zinno that the homomorphic images of simple elements arising from the dual presentation of the braid group $B_n$ form a basis for the vector space underlying the Temperley-Lieb algebra $TL_n$. In this paper, we establish that there is a dual presentation of Temperley-Lieb algebras that corresponds to the dual presentation of braid groups, and then give a simple geometric proof for Zinno's theorem, using the interpretation of simple elements as non-crossing partitions.

SPHERICAL FUNCTIONS ON PROJECTIVE CLASS ALGEBRAS

  • Choi, Eun-Mi
    • 대한수학회보
    • /
    • 제43권1호
    • /
    • pp.189-212
    • /
    • 2006
  • Let $F^{\alpha}G$ be a twisted group algebra with basis ${{\mu}g|g\;{\in}\;G}$ and $P\;=\;{C_g|g\;{\in}\;G}$ be a partition of G. A projective class algebra associated with P is a subalgebra of $F^{\alpha}G$ generated by all class sums $\sum\limits{_{x{\in}C_g}}\;{\mu}_x$. A main object of the paper is to find interrelationships of projective class algebras in $F^{\alpha}G$ and in $F^{\alpha}H$ for H < G. And the a-spherical function will play an important role for the purpose. We find functional properties of a-spherical functions and investigate roles of $\alpha-spherical$ functions as characters of projective class algebras.

A Two-Step Screening Algorithm to Solve Linear Error Equations for Blind Identification of Block Codes Based on Binary Galois Field

  • Liu, Qian;Zhang, Hao;Yu, Peidong;Wang, Gang;Qiu, Zhaoyang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제15권9호
    • /
    • pp.3458-3481
    • /
    • 2021
  • Existing methods for blind identification of linear block codes without a candidate set are mainly built on the Gauss elimination process. However, the fault tolerance will fall short when the intercepted bit error rate (BER) is too high. To address this issue, we apply the reverse algebra approach and propose a novel "two-step-screening" algorithm by solving the linear error equations on the binary Galois field, or GF(2). In the first step, a recursive matrix partition is implemented to solve the system linear error equations where the coefficient matrix is constructed by the full codewords which come from the intercepted noisy bitstream. This process is repeated to derive all those possible parity-checks. In the second step, a check matrix constructed by the intercepted codewords is applied to find the correct parity-checks out of all possible parity-checks solutions. This novel "two-step-screening" algorithm can be used in different codes like Hamming codes, BCH codes, LDPC codes, and quasi-cyclic LDPC codes. The simulation results have shown that it can highly improve the fault tolerance ability compared to the existing Gauss elimination process-based algorithms.