English
Related papers

Related papers: Signed words and permutations, IV; Fixed and pixed…

200 papers

We define a new statistic on the even hyperoctahedral groups which is a natural analogue of the odd length statistic recently defined and studied on Coxeter groups of types $A$ and $B$. We compute the signed (by length) generating function…

Combinatorics · Mathematics 2016-06-07 Francesco Brenti , Angela Carnevale

A new extension of the major index, defined in terms of Coxeter elements, is introduced. For the classical Weyl groups of type $B$, it is equidistributed with length. For more general wreath products it appears in an explicit formula for…

Combinatorics · Mathematics 2007-05-23 Ron M. Adin , Yuval Roichman

A signed permutation \pi = \pi_1\pi_2 \ldots \pi_n in the hyperoctahedral group B_n is a word such that each \pi_i \in {-n, \ldots, -1, 1, \ldots, n} and {|\pi_1|, |\pi_2|, \ldots, |\pi_n|} = {1,2,\ldots,n}. An index i is a peak of \pi if…

Combinatorics · Mathematics 2013-09-02 Francis Castro-Velez , Alexander Diaz-Lopez , Rosa Orellana , Jose Pastrana , Rita Zevallos

Fixed points ${\bf u}=\varphi({\bf u})$ of marked and primitive morphisms $\varphi$ over arbitrary alphabet are considered. We show that if ${\bf u}$ is palindromic, i.e., its language contains infinitely many palindromes, then some power…

Combinatorics · Mathematics 2015-09-14 Sébastien Labbé , Edita Pelantová

Binomial Eulerian polynomials first appeared in work of Postnikov, Reiner and Williams on the face enumeration of generalized permutohedra. They are $\gamma$-positive (in particular, palindromic and unimodal) polynomials which can be…

Combinatorics · Mathematics 2020-01-24 Christos A. Athanasiadis

We consider the monomial expansion of the $q$-Whittaker and modified Hall-Littlewood polynomialsarising from specialization of the modified Macdonald polynomial. The two combinatorial formulas for the latter due to Haglund, Haiman, and…

Combinatorics · Mathematics 2024-03-19 T V Ratheesh

Let $\Sigma=(\Gamma, \sigma)$ is a signed graph(or sigraph in short), where $\Gamma$ is a underlying graph of $\Sigma$ and $\sigma:E\longrightarrow \{+, -\}$ is a function. Consider $\Gamma=Cay(\mathbb{Z}_{p_{1}}\times…

Combinatorics · Mathematics 2020-11-12 Mohammad A. Iranmanesh , Nasrin Moghaddami

For a finite field of odd number of elements we construct families of permutation binomials and permutation trinomials with one fixed-point (namely zero) and remaining elements being permuted as disjoint cycles of same length. Binomials and…

Combinatorics · Mathematics 2023-06-28 Anitha G , P Vanchinathan

MacMahon's classic theorem states that the 'length' and 'major index' statistics are equidistributed on the symmetric group S_n. By defining natural analogues or generalizations of those statistics, similar equidistribution results have…

Combinatorics · Mathematics 2007-05-23 Dan Bernstein

Consider the regular representation of the sum over all permutations weighted by the sum of their descent, inversion, and fixed point multinomials. We compute the spectrum and the multiplicities of its elements of that matrix. Note that…

Combinatorics · Mathematics 2020-05-13 Hery Randriamaro

We introduce a two-parameter function $\phi_{q_+,q_-}$ on the infinite hyperoctahedral group, which is a bivariate refinement of the reflection length keeping track of the long and the short reflections separately. We show that this signed…

Representation Theory · Mathematics 2026-04-14 Marek Bożejko , Maciej Dołęga , Wiktor Ejsmont , Światosław R. Gal

This paper is concerned with multivariate refinements of the gamma-positivity of Eulerian polynomials by using the succession and fixed point statistics. Properties of the enumerative polynomials for permutations, signed permutations and…

Combinatorics · Mathematics 2020-08-11 Shi-Mei Ma , Jun Ma , Jean Yeh , Yeong-Nan Yeh

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…

Combinatorics · Mathematics 2007-06-22 Guo-Niu Han , Guoce Xin

For an odd prime power $q$ satisfying $q\equiv 1\pmod 3$ we construct totally $2(q-1) $ permutation polyomials, all giving involutory permutations with exactly $ 1+ \frac{q-1}3$ fixed points. Among them $(q-1)$ polynomials are trinomials,…

Combinatorics · Mathematics 2023-06-30 P Vanchinathan , Kevinsam B

We discover a family $A$ of sixteen statistics on fillings of any given Young diagram and prove new combinatorial formulas for modified Macdonald polynomials, that is, $$\tilde{H}_{\lambda}(X;q,t)=\sum_{\sigma\in…

Combinatorics · Mathematics 2025-07-08 Emma Yu Jin , Xiaowei Lin

The polynomial of the major index ${\rm maj}_W (\sigma)$ over the subset $T$ of the Coxeter group $W$ is called the Mahonian polynomial over $T$, where ${\rm maj}_W (\sigma)$ is a Mahonian statistic of an element $\sigma \in T$, whereas the…

Combinatorics · Mathematics 2024-11-11 Kathy Q. Ji , Dax T. X. Zhang

Let $S^B_n$ be the Coxeter group of type B. We denote the set of indices where $\sigma\in S^B_n$ has a peak as $Peak(\sigma)$ and let $P^{B}(S;n)=\{\sigma \in S^{B}_n~|~ Peak(\sigma)=S\}$. In \cite{metrics}, Diaz-Lopez, Haymaker, Keough,…

Up-down permutations are counted by tangent resp. secant numbers. Considering words instead, where the letters are produced by independent geometric distributions, there are several ways of introducing this concept; in the limit they all…

Combinatorics · Mathematics 2007-05-23 Helmut Prodinger

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

Phil Hanlon proved that the coefficients of the chromatic polynomial of a graph G are equal (up to sign) to the dimensions of the summands in a Hodge-type decomposition of the top homology of the coloring complex for G. We prove a type B…

Combinatorics · Mathematics 2013-07-30 Benjamin Braun , Sarah Crown Rundell