Search arXivSearch

arXiv · 2508.02432

Descent sets of cyclic permutations in types B and D

Abstract

Elizalde constructed a bijection $ϕ$ from the cyclic permutations $π\in S_{n+1}$ to the symmetric group $S_n$ satisfying $\operatorname{Des}(π)\cap \{1,2,\ldots,n-1\}=\operatorname{Des}(ϕ(π))$. We give a corresponding result on the signed symmetric group $B_n$ by constructing a function $Φ$ from the cyclic signed permutations $π\in B_{n+1}$ to $B_n$ satisfying $\operatorname{Des}(π)\cap \{0,1,\ldots,n-1\}=\operatorname{Des}(Φ(π))$. Moreover, letting $D_{n+1}\subseteq B_{n+1}$ be the subgroup consisting of signed permutations with an even number of sign changes, we show that the restriction of $Φ$ to the cyclic signed permutations in $D_{n+1}$ or its complement is a bijection. Our function $Φ$ reduces to Elizalde's original bijection $ϕ$ under the natural identification of the symmetric groups as subgroups of the signed symmetric groups. One application of our results is asymptotic normality of the descent and flag major index statistics on the cyclic signed permutations in $B_{n}$ and $D_n$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Kevin Liu. 2025-08-04. Descent sets of cyclic permutations in types B and D. https://arxiv.org/abs/2508.02432

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO