19 research outputs found

    On the Ring of Simultaneous Invariants for the Gleason–MacWilliams Group

    Get PDF
    AbstractWe construct a canonical generating set for the polynomial invariants of the simultaneous diagonal action (of arbitrary number of l factors) of the two-dimensional finite unitary reflection group G of order 192, which is called the group No. 9 in the list of Shephard and Todd, and is also called the Gleason–MacWilliams group. We find this canonical set in the vector space (⊗i=1lV)G, where V denotes the (dual of the) two-dimensional vector space on which the group G acts, by applying the techniques of Weyl (i.e., the polarization process of invariant theory) to the invariants C [ x, y ]G0of the two-dimensional group G0of order 48 which is the intersection of G and SL(2, C). It is shown that each element in this canonical set corresponds to an irreducible representation which appears in the decomposition of the action of the symmetric group Sl. That is, by letting the symmetric group Slacts on each element of the canonical generating set, we get an irreducible subspace on which the symmetric group Slacts irreducibly, and all these irreducible subspaces give the decomposition of the whole space (⊗i=1lV)G. This also makes it possible to find the generating set of the simultaneous diagonal action (of arbitrary l factors) of the group G. This canonical generating set is different from the homogeneous system of parameters of the simultaneous diagonal action of the group G. We can construct Jacobi forms (in the sense of Eichler and Zagier) in various ways from the invariants of the simultaneous diagonal action of the group G, and our canonical generating set is very fit and convenient for the purpose of the construction of Jacobi forms

    Self-Dual Codes

    Get PDF
    Self-dual codes are important because many of the best codes known are of this type and they have a rich mathematical theory. Topics covered in this survey include codes over F_2, F_3, F_4, F_q, Z_4, Z_m, shadow codes, weight enumerators, Gleason-Pierce theorem, invariant theory, Gleason theorems, bounds, mass formulae, enumeration, extremal codes, open problems. There is a comprehensive bibliography.Comment: 136 page

    OBSERVATION ON THE WEIGHT ENUMERATORS FROM CLASSICAL INVARIANT THEORY

    Get PDF
    The purpose of this paper is to collect computations related to the weight enumerators and to present some relationships among invariant rings.The latter is done by combining two maps,the Brou\'e-Enguehard map and Igusa's \rho homomorphism. For the completeness of the story,some formulae are given which are not necessarily used in the present manuscript.Sections 1 and 2 contain no new result

    Jacobi polynomials and design theory II

    Full text link
    In this paper, we introduce some new polynomials associated to linear codes over Fq\mathbb{F}_{q}. In particular, we introduce the notion of split complete Jacobi polynomials attached to multiple sets of coordinate places of a linear code over Fq\mathbb{F}_{q}, and give the MacWilliams type identity for it. We also give the notion of generalized qq-colored tt-designs. As an application of the generalized qq-colored tt-designs, we derive a formula that obtains the split complete Jacobi polynomials of a linear code over Fq\mathbb{F}_{q}.Moreover, we define the concept of colored packing (resp. covering) designs. Finally, we give some coding theoretical applications of the colored designs for Type~III and Type~IV codes.Comment: 28 page

    An extensive English language bibliography on graph theory and its applications

    Get PDF
    Bibliography on graph theory and its application
    corecore