Abstract
The Pohlmeyer-Rehren Lie algebra $\mathfrak{g}$ is an infinite-dimensional $\mathbb{Z}$-graded Lie algebra that was discovered in the context of string quantization in $d$-dimensional spacetime by K. Pohlmeyer and his collaborators and has more recently been reformulated in terms of the Euler-idempotents of the shuffle Hopf algebra. This thesis is divided into two major parts. In the first part, the structure theory of $\mathfrak{g}$ is discussed. $\mathfrak{g}_0$, the stratum of degree zero, is isomorphic to the classical Lie algebra $\mathfrak{so}(d,\mathbb{C})$. Now, each stratum is considered as a $\mathfrak{g}_0$-module, and a formula for the number of irreducible $\mathfrak{g}_0$-modules of each highest weight that occur is given. It is also shown that $\mathfrak{g}$ is not a Kac-Moody algebra. Based on computer-aided calculations, $\mathfrak{g}$ is conjectured to be generated by the strata of degrees $0$ and $1$, but not freely. In an effort to classify the relations, in the second part, the Philip Hall algorithm that iteratively lists (linear) basis elements of a Lie algebra $L(X)$ freely generated by a finite set of generators $X$ is modified. Any non-free finitely generated Lie algebra can be written as $L(X)/I$ with an ideal $I$ encoding the relations. Intended for cases where $I$ is not explicitly known, a variant of the algorithm iteratively lists a basis of $L(X)/I$ and a self-reduced basis of $I$. Further modifications that take advantage of restrictions enforced by a gradation on $L(X)/I$ are also given.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.