An upper bound for the Lusternik-Schnirelmann category of the symplectic group
classification
🧮 math.AT
keywords
categorygroupsymplecticaboveachievedbinomboundbounded
read the original abstract
We prove that the LS category of the symplectic group $Sp(n)$ is bounded above by $\binom{n+1}{2}$. This is achieved by computing the number of critical levels of a height function.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.