On weight spaces of polynomial representations of the general linear group as linear codes

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Modular irreducible representations of the symmetric group as linear codes

We describe a particularly easy way of evaluating the modular irreducible matrix representations of the symmetric group. It shows that Specht’s approach to the ordinary irreducible representations, along Specht polynomials, can be unified with Clausen’s approach to the modular irreducible representations using symmetrized standard bideterminants. The unified method, using symmetrized Specht pol...

متن کامل

Computation of Minimum Hamming Weight for Linear Codes

In this paper, we consider the minimum Hamming weight for linear codes over special finite quasi-Frobenius rings. Furthermore, we obtain minimal free $R$-submodules of a finite quasi-Frobenius ring $R$  which contain a linear code and derive the relation between their minimum Hamming weights. Finally, we suggest an algorithm that computes this weight using the Grobner basis and we show that und...

متن کامل

Notes on Polynomial Representations of General Linear Groups

Let F be an infinite field. For each pair (i, j) with 1 ≤ i, j ≤ n, let Xij : GLn(F ) → F be the coordinate function sending a matrix x to its entry xij . Let F [Xij ] denote the algebra generated by these functions. As this notation suggests, we identify F [Xij ] with the polynomial ring in n 2 indeterminants; this is admissible because the field F is infinite. Let V be a finite-dimensional F ...

متن کامل

Plethysm of Schur Functions and Irreducible Polynomial Representations of the Complex General Linear Group

We show the intimate connection Schur functions have with the irreducible polynomial representations of GL(n,C). Following Schur’s thesis, in Section 1, we prove that the characters of these representations are given by Schur functions. In the second section, we elaborate on how a specific combinatorial operation on symmetric functions called plethysm gives the characters of the composition of ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Combinatorial Theory, Series A

سال: 1994

ISSN: 0097-3165

DOI: 10.1016/0097-3165(94)90001-9