Search arXivSearch

arXiv · 2008.02721

Signed Mahonian on Parabolic Quotients of Colored Permutation Groups

Abstract

We study the generating polynomial of the flag major index with each one-dimensional character, called signed Mahonian polynomial, over the colored permutation group, the wreath product of a cyclic group with the symmetric group. Using the insertion lemma of Han and Haglund-Loehr-Remmel and a signed extension established by Eu et al., we derive the signed Mahonian polynomial over the quotients of parabolic subgroups of the colored permutation group, for a variety of systems of coset representatives in terms of subsequence restrictions. This generalizes the related work over parabolic quotients of the symmetric group due to Caselli as well as to Eu et al. As a byproduct, we derive a product formula that generalizes Biagioli's result about the signed Mahonian on the even signed permutation groups.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sen-Peng Eu, Tung-Shan Fu, Yuan-Hsun Lo. 2021-05-01. Signed Mahonian on Parabolic Quotients of Colored Permutation Groups. https://arxiv.org/abs/2008.02721

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