English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Using combinatorial techniques, we answer two questions about simpleclassical Lie groups. Define $N(G,m)$ to be the number of conjugacy classes ofelements of finite order $m$ in a Lie group $G$, and $N(G,m,s)$ to be thenumber of such classes whose elements have $s$ distinct eigenvalues orconjugate pairs of eigenvalues. What is $N(G,m)$ for $G$ a unitary, orthogonal,or symplectic group? What is $N(G,m,s)$ for these groups? For some cases, thefirst question was answered a few decades ago via group-theoretic techniques.It appears that the second question has not been asked before; here it isinspired by questions related to enumeration of vacua in string theory. Ourcombinatorial methods allow us to answer both questions.

Counting Conjugacy Classes of Elements of Finite Order in Lie Groups