• Communications of the Korean Mathematical Society
• /
• v.9 no.4
• /
• pp.773-782
• /
• 1994

Investigation of the number of representations as well as of projective representations of a finite group has been important object since the early of this century. The numbers are very related to the number of conjugacy classes of G, so that this gives some informations on finite groups and on group characters. A generally well-known fact is that the number of non-equivlaent irreducible representations, which we shall write as n.i.r. of G is less than or equal to the number of conjugacy classes of G, and the equality holds over an algebraically closed field of characteristic not dividing $\mid$G$\mid$. A remarkable result on the numbers due to Reynolds can be stated as follows.

• Journal of the Korean Mathematical Society
• /
• v.34 no.2
• /
• pp.453-467
• /
• 1997

A transitive permutation representation of a group G is said to be multiplicity-free if all of its irreducible constituents are distinct. The character corresponding to the action is called the permutation character, given by $(1_H)^G$, where H is the stabilizer of a point. Multiplicity-free permutation characters are of interest in the study of centralizer algebras and distance-transitive graphs, and all finite simple groups are known to have such characters. In this article, we extend to the alternating groups the result of J. Saxl who determined the multiplicity-free permutation representations of the symmetric groups. We classify all subgroups H for which $(1_H)^An, n > 18$, is multiplicity-free.

• Bulletin of the Korean Mathematical Society
• /
• v.54 no.5
• /
• pp.1757-1771
• /
• 2017

Let K be a field and G be a group of its automorphisms. It follows from Speiser's generalization of Hilbert's Theorem 90, [10] that any K-semilinear representation of the group G is isomorphic to a direct sum of copies of K, if G is finite. In this note three examples of pairs (K, G) are presented such that certain irreducible K-semilinear representations of G admit a simple description: (i) with precompact G, (ii) K is a field of rational functions and G permutes the variables, (iii) K is a universal domain over field of characteristic zero and G its automorphism group. The example (iii) is new and it generalizes the principal result of [7].

• Communications of the Korean Mathematical Society
• /
• v.38 no.1
• /
• pp.123-135
• /
• 2023

It is proved that there is a one to one correspondence between representations of C^*-ternary ring M and C^*-algebra 𝒜(M). We discuss primitive and modular ideals of a C^*-ternary ring and prove that a closed ideal I is primitive or modular if and only if so is the ideal 𝒜(I) of 𝒜(M). We also show that a closed ideal in M is primitive if and only if it is the kernel of some irreducible representation of M. Lastly, we obtain approximate identity characterization of strongly quasi-central C^*-ternary ring and the ideal structure of the TRO V ⊗^tmin B for a C^*-algebra B.

• Kyungpook Mathematical Journal
• /
• v.62 no.1
• /
• pp.1-28
• /
• 2022

In this paper, we define the G-Brauer algebras $D^G_f(x)$, where G is a cyclic group, called cyclic G-Brauer algebras, as the linear span of r-signed 1-factors and the generalized m, k signed partial 1-factors is to analyse the multiplication of basis elements in the quotient $^{\rightarrow}_{I_f}^G(x,2k)$. Also, we define certain symmetric matrices $^{\rightarrow}_T_{m,k}^{[\lambda]}(x)$ whose entries are indexed by generalized m, k signed partial 1-factor. We analyse the irreducible representations of $D^G_f(x)$ by determining the quotient $^{\rightarrow}_{I_f}^G(x,2k)$ of $D^G_f(x)$ by its radical. We also find the eigenvalues and eigenspaces of $^{\rightarrow}_T_{m,k}^{[\lambda]}(x)$ for some values of m and k using the representation theory of the generalised symmetric group. The matrices $T_{m,k}^{[\lambda]}(x)$ whose entries are indexed by generalised m, k signed partial 1-factors, which helps in determining the non semisimplicity of these cyclic G-Brauer algebras $D^G_f(x)$, where G = ℤ_r.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.45 no.2
• /
• pp.49-54
• /
• 2008

In cryptosystems based on finite fields, a modular multiplication operation is the most crucial part of finite field arithmetic. Also, in multipliers with resource constrained environments, bit-serial output structures are used in general. This paper proposes two efficient bit-serial output multipliers with the polynomial basis representation for irreducible trinomials. The proposed multipliers have lower time complexity compared to previous bit-serial output multipliers. One of two proposed multipliers requires the time delay of $(m+1){\cdot}MUL+(m+1){\cdot}ADD$ which is more efficient than so-called Interleaved Multiplier with the time delay of $m{\cdot}MUL+2m{\cdot}ADD$. Therefore, in elliptic curve cryptosystems and pairing based cryptosystems with small characteristics, the proposed multipliers can result in faster overall computation. For example, if the characteristic of the finite fields used in cryprosystems is small then the proposed multipliers are approximately two times faster than previous ones.

• Journal of English Language & Literature
• /
• v.57 no.3
• /
• pp.473-493
• /
• 2011

This paper aims, first, to trace the trajectory of Sebastian Barry's dramatic works in terms of retrieving the hidden (hi)stories of his family members, and second, to analyze his most successful play to date in both critical and commercial senses, The Steward of Christendom, in terms of the tension or even rupture between Irish national history and the dramatic representation of it. If contemporary Irish drama as a whole can be seen as an act of mirroring up to nation, Barry's is a refracting than reflecting act. Whereas modern Irish drama tends to have helped, however inadvertently, consolidate the nation-state by imagining Ireland through its other (either in the form of the British empire or the Protestant Unionist north), Barry's drama aims at cracking the surface homogeneity of Irish identity by re-imagining "ourselves" (a forgotten part of which is a community of southern Catholic loyalists). Furthermore, the "ourselves" re-imagined in Barry's drama is more fractured than unified, irreducible in its multiplicity than acquiescent in its singularity. The playwright's foremost concern is to retrieve the lives of "history's leftovers, men and women defeated and discarded by their times" and re-member those men and women who have been expunged from the imagined community of the Irish nation. This he does by endowing "every life" with "an after-life" and "every demon" with "a fairy tale." The Steward of Christendom is Barry's dramatic attempt to bestow upon the historically demonized Thomas Dunne, an Irish policeman in the British Empire, his fairy-tale redemption.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.12C
• /
• pp.1288-1298
• /
• 2002

To implement elliptic curve cryptosystem in GF(2$\^$m/) at high speed, a fast divider is required. Although bit-parallel architecture is well suited for high speed division operations, elliptic curve cryptosystem requires large m(at least 163) to support a sufficient security. In other words, since the bit-parallel architecture has an area complexity of 0(m$\^$m/), it is not suited for this application. In this paper, we propose a new serial-in serial-out systolic array for computing division operations in GF(2$\^$m/) using the standard basis representation. Based on a modified version of tile binary extended greatest common divisor algorithm, we obtain a new data dependence graph and design an efficient bit-serial systolic divider. The proposed divider has 0(m) time complexity and 0(m) area complexity. If input data come in continuously, the proposed divider can produce division results at a rate of one per m clock cycles, after an initial delay of 5m-2 cycles. Analysis shows that the proposed divider provides a significant reduction in both chip area and computational delay time compared to previously proposed systolic dividers with the same I/O format. Since the proposed divider can perform division operations at high speed with the reduced chip area, it is well suited for division circuit of elliptic curve cryptosystem. Furthermore, since the proposed architecture does not restrict the choice of irreducible polynomial, and has a unidirectional data flow and regularity, it provides a high flexibility and scalability with respect to the field size m.