English
Related papers

Related papers: Signed Mahonian Polynomials on Colored Derangement…

200 papers

This paper studies the number of monic integer polynomials $f$ of height at most $H$ whose Galois group, endowed with the action on the roots, is isomorphic to a prescribed permutation group $(G,\Omega)$. New upper bounds are obtained for…

Number Theory · Mathematics 2026-03-17 Or Ben-Porath

A relationship between signed Eulerian polynomials and the classical Eulerian polynomials on $\mathfrak{S}_n$ was given by D\'{e}sarm\'{e}nien and Foata in 1992, and a refined version, called signed Euler-Mahonian identity, together with a…

Combinatorics · Mathematics 2020-07-28 Sen-Peng Eu , Zhicong Lin , Yuan-Hsun Lo

We consider several generalizations of the classical $\gamma$-positivity of Eulerian polynomials (and their derangement analogues) using generating functions and combinatorial theory of continued fractions. For the symmetric group, we prove…

Combinatorics · Mathematics 2022-03-22 Heesung Shin , Jiang Zeng

A classical result states that the parity balance of the number of excedances of all permutations (derangements, respectively) of length $n$ is the Euler number. In 2010, Josuat-Verg\`{e}s gives a $q$-analogue with $q$ representing the…

Combinatorics · Mathematics 2020-06-25 Hsin-Chieh Liao

Consider a crystallographic root system together with its Weyl group $W$ acting on the weight lattice $M$. Let $Z[M]^W$ and $S^*(M)^W$ be the $W$-invariant subrings of the integral group ring $Z[M]$ and the symmetric algebra $S^*(M)$…

Rings and Algebras · Mathematics 2012-05-28 Sanghoon Baek , Erhard Neher , Kirill Zainoulline

We present a formula for a generalisation of the Eulerian polynomial, namely the generating polynomial of the joint distribution of major index and descent statistic over the set of signed multiset permutations. It has a description in…

Combinatorics · Mathematics 2025-04-11 Elena Tielker

In this paper, we construct a mixed-base number system over the generalized symmetric group $G(m,1,n)$, which is a complex reflection group with a root system of type $B_n^{(m)}$. We also establish one-to-one correspondence between all…

Combinatorics · Mathematics 2023-05-09 Hasan Arslan , Alnour Altoum , Mariam Zaarour

The permanent of an $n \times n$ matrix $M = (m_{ij})$ is defined as $\mathrm{per}(M) = \sum_{\sigma \in S_n} \prod_{i=1}^n m_{i,\sigma(i)}$, where $S_n$ denotes the symmetric group on $\{1,2,\ldots,n\}$. The permanental polynomial of $M$,…

Combinatorics · Mathematics 2025-09-19 Sarbari Mitra , Soumya Bhoumik

We consider a bivariate polynomial that generalizes both the length and reflection length generating functions in a finite Coxeter group. In seeking a combinatorial description of the coefficients, we are led to the study of a new Mahonian…

Combinatorics · Mathematics 2010-10-25 T. Kyle Petersen

We study the distribution of the major index with sign on some parabolic quotients of the symmetric group, extending and generalizing simultaneously results Gessel-Simion and Adin-Gessel-Roichman, and on some special trees that we call…

Combinatorics · Mathematics 2012-04-20 Fabrizio Caselli

We study two weighted graph coloring problems, in which one assigns $q$ colors to the vertices of a graph such that adjacent vertices have different colors, with a vertex weighting $w$ that either disfavors or favors a given color. We…

Mathematical Physics · Physics 2015-05-13 Shu-Chiuan Chang , Robert Shrock

Following Britz, Johnsen, Mayhew and Shiromoto, we consider demi\-ma\-troids as a(nother) natural generalization of matroids. As they have shown, demi\-ma\-troids are the appropriate combinatorial objects for studying Wei's duality. Our…

Combinatorics · Mathematics 2019-07-24 Jose Martinez-Bernal , Miguel A. Valencia-Bucio , Rafael H. Villarreal

In recent, H. Sun defined a new kind of refined Eulerian polynomials, namely, \begin{eqnarray*} A_n(p,q)=\sum_{\pi\in \mathfrak{S}_n}p^{{\rm odes}(\pi)}q^{{\rm edes}(\pi)} \end{eqnarray*} for $n\geq 1$, where ${odes}(\pi)$ and ${edes}(\pi)$…

Combinatorics · Mathematics 2018-10-19 Yidong Sun , Liting Zhai

To every integer monic polynomial of degree m can be associated a `replacement rule' that generates a word W* from another word W consisting of symbols belonging to a finite `alphabet' of size 2m. This rule applied iteratively on almost any…

General Mathematics · Mathematics 2007-05-23 A. K. Gupta , A. K. Mittal

This paper describes an improvement in the upper bound for the magnitude of a coefficient of a term in the chromatic polynomial of a general graph. If $a_r$ is the coefficient of the $q^r$ term in the chromatic polynomial $P(G,q)$, where…

Combinatorics · Mathematics 2007-05-23 Shu-Chiuan Chang

We provide a direct connection between Springer theory, via Green polynomials, the irreducible representations of the pin cover $\wti W$, a certain double cover of the Weyl group $W$, and an extended Dirac operator for graded Hecke…

Representation Theory · Mathematics 2013-05-08 Dan Ciubotaru , Xuhua He

We provide combinatorial interpretation for the $\gamma$-coefficients of the basic Eulerian polynomials that enumerate permutations by the excedance statistic and the major index as well as the corresponding $\gamma$-coefficients for…

Combinatorics · Mathematics 2015-05-01 Zhicong Lin , Jiang Zeng

We find a combinatorial interpretation of Shareshian and Wachs' $q$-binomial-Eulerian polynomials, which leads to an alternative proof of their $q$-$\gamma$-positivity using group actions. Motivated by the sign-balance identity of…

Combinatorics · Mathematics 2020-05-18 Zhicong Lin , David G. L. Wang , Jiang Zeng

A permutation is called mod-k-alternating if its entries are restricted to having the same remainder as the index, modulo some integer $k \geq 1.$ In this paper, we find the sign-balance for mod-k-alternating permutations with respect to…

Combinatorics · Mathematics 2024-08-01 Hiranya Kishore Dey , Iswar Mahato

We introduce a family of polynomials, which arise in three distinct ways: in the large $N$ expansion of a matrix integral, as a weighted enumeration of factorisations of permutations, and via the topological recursion. More explicitly, we…

Combinatorics · Mathematics 2025-07-02 Xavier Coulter , Norman Do , Ellena Moskovsky