Search arXivSearch

arXiv · 2408.02424

Combinatorics of $q$-Mahonian numbers of type $B$ and log-concavity

Abstract

This paper is a continuation of earlier work of Arslan \cite{Ars}, who introduced the Mahonian number of type $B$ by using a new statistic on the hyperoctahedral group $B_{n}$, in response to questions he suggested in his paper entitled "{\it A combinatorial interpretation of Mahonian numbers of type $B$}" published in arXiv:2404.05099v1. We first give the Knuth-Netto formula and generating function for the subdiagonals on or below the main diagonal of the Mahonian numbers of type $B$, then its combinatorial interpretations by lattice path/partition and tiling. Next, we propose a $q$-analogue of Mahonian numbers of type $B$ by using a new statistics on the permutations of the hyperoctahedral group $B_n$ that we introduced, then we study their basic properties and their combinatorial interpretations by lattice path/partition and tiling. Finally, we prove combinatorially that the $q$-analogue of Mahonian numbers of type $B$ form a strongly $q$-log-concave sequence of polynomials in $k$, which implies that the Mahonian numbers of type $B$ form a log-concave sequence in $k$ and therefore unimodal.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ali Kessouri, Moussa Ahmia, Hasan Arslan, Salim Mesbahi. 2024-08-05. Combinatorics of $q$-Mahonian numbers of type $B$ and log-concavity. https://arxiv.org/abs/2408.02424

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

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO