2008
DOI: 10.48550/arxiv.0812.1432
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Polynomial Representation of $E_7$ and Its Combinatorial and PDE Implications

Xiaoping Xu

Abstract: In this paper, we use partial differential equations to find the decomposition of the polynomial algebra over the basic irreducible module of E 7 into a sum of irreducible submodules.Moreover, we obtain a combinatorial identity, saying that the dimensions of certain irreducible modules of E 7 are correlated by the binomial coefficients of fifty-five. Furthermore, we prove that two families of irreducible submodules with three integral parameters are solutions of the fundamental invariant differential operator … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
5
0

Year Published

2009
2009
2009
2009

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(5 citation statements)
references
References 34 publications
0
5
0
Order By: Relevance
“…Furthermore, we prove that the codes C 3 (V ) of the exceptional simple Lie algebras F 4 , E 6 , E 7 and E 8 on their minimal irreducible modules and adjoint modules are all ternary orthogonal codes with large minimal distances. This coding theoretic phenomena was observed when we investigated the polynomial representations of these algebras in [26]- [28]. It is also well known that determining the minimal distance of a linear code is in general very difficult.…”
Section: Introductionmentioning
confidence: 59%
See 4 more Smart Citations
“…Furthermore, we prove that the codes C 3 (V ) of the exceptional simple Lie algebras F 4 , E 6 , E 7 and E 8 on their minimal irreducible modules and adjoint modules are all ternary orthogonal codes with large minimal distances. This coding theoretic phenomena was observed when we investigated the polynomial representations of these algebras in [26]- [28]. It is also well known that determining the minimal distance of a linear code is in general very difficult.…”
Section: Introductionmentioning
confidence: 59%
“…(5) The ternary weight code of E 7 on its minimal module is an orthogonal [28,7,12]code. (6) The ternary weight code of E 7 on its adjoint module is an orthogonal [63,7,27]-code.…”
Section: Theorem 3 (1)mentioning
confidence: 99%
See 3 more Smart Citations