Related papers: Barycentric subdivisions and derangement polynomia…

The object of this paper is to give a systematic treatment of excedance-type polynomials. We first give a sufficient condition for a sequence of polynomials to have alternatingly increasing property, and then we present a systematic study…

We construct a new family of permutation group polynomials over finite fields of arbitrary characteristic, which are special types of bivariate local permutation polynomials. For this family, we explicitly construct their companion. We also…

In this paper, we answer two questions on local $h$-vectors, which were asked by Athanasiadis. First, we characterize all possible local $h$-vectors of quasi-geometric subdivisions of a simplex. Second, we prove that the local…

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…

Calogero-Sutherland models associated to the Weyl groups of type A and B with exchange terms included in the Hamiltonians systems have non-symmetric eigenfunctions, which are products of the ground state with members of a family of…

Let $i(\infty,k)$ be the limiting proportion, as $n \rightarrow \infty$, of permutations in the symmetric group of degree $n$ that fix a $k$-set. We give an algorithm for computing $i(\infty,k)$ and state the values of $i(\infty,k)$ for $k…

The polynomial $\sum_{\pi \in W}q^{maj(\pi)}$ of major index over a classical Weyl group $W$ with a generating set $S$ is called the Mahonian polynomial over $W$, and also the polynomial $\sum_{\pi \in W}(-1)^{l(\pi)}q^{maj(\pi)}$ of major…

A formula of Stembridge states that the permutation peak polynomials and descent polynomials are connected via a quadratique transformation. The aim of this paper is to establish the cycle analogue of Stembridge's formula by using cycle…

We study the characteristic polynomial of random permutation matrices following some measures which are invariant by conjugation, including Ewens' measures which are one-parameter deformations of the uniform distribution on the permutation…

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…

In the context of Stirling polynomials, Gessel and Stanley introduced the definition of Stirling permutation, which has attracted extensive attention over the past decades. Recently, we introduced Stirling permutation code and provided…

Denote the alternating and symmetric groups of degree $n$ by $A_n$ and $S_n$ respectively. Consider a permutation $\sigma\in S_n$ all of whose nontrivial cycles are of the same length. We find the minimal polynomials of $\sigma$ in the…

Let $G \leqslant {\rm Sym}(\Omega)$ be a finite transitive permutation group and recall that an element in $G$ is a derangement if it has no fixed points on $\Omega$. Let $\Delta(G)$ be the set of derangements in $G$ and define $\delta(G) =…

This paper studies symmetric tensor decompositions. For symmetric tensors, there exist linear relations of recursive patterns among their entries. Such a relation can be represented by a polynomial, which is called a generating polynomial.…

We define symmetric Dellac configurations as the Dellac configurations that are symmetric with respect to their centers. The symmetric Dellac configurations whose lengths are even were previously introduced by Fang and Fourier under the…

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…

We study the hypersimplex under the action of the symmetric group $S_n$ by coordinate permutation. We prove that the evaluation of its equivariant $H^*$-polynomial at $1$ is the permutation character of decorated ordered set partitions…

In this research announcement we present a new q-analog of a classical formula for the exponential generating function of the Eulerian polynomials. The Eulerian polynomials enumerate permutations according to their number of descents or…

We extend Stanley's work on alternating permutations with extremal number of fixed points in two directions: first, alternating permutations are replaced by permutations with a prescribed descent set; second, instead of simply counting…

As is well-known, poly-Bernoulli polynomials are defined in terms of polylogarithm functions. Recently, as degenerate version of such functions and polynomials, degenerate polylogarithm functions were introduced and degenertae…