2000 character limit reached
Pinnacles for Complex Reflection Groups (2510.03580v1)
Published 4 Oct 2025 in math.CO
Abstract: We study, characterize, and enumerate the admissible pinnacle sets of nonexceptional complex reflection groups $G(m,p,n)$, which include all generalized symmetric groups $\mathbb{Z}_m \wr S_n$ as special cases. This generalizes the work of Davis--Nelson--Petersen--Tenner for symmetric groups $S_n$ and Gonz\'alez--Harris--Rojas Kirby--Smit Vega Garcia--Tenner for signed symmetric groups $\mathbb{Z}_2 \wr S_n$. As a consequence, we prove a conjecture of Gonz\'alez--Harris--Rojas Kirby--Smit Vega Garcia--Tenner for pinnacles of signed permutations.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.