English
Related papers

Related papers: Actions on permutations and unimodality of descent…

200 papers

Let $q>2$ be a prime power and $f={\tt x}^{q-2}+t{\tt x}^{q^2-q-1}$, where $t\in\Bbb F_q^*$. It was recently conjectured that $f$ is a permutation polynomial of $\Bbb F_{q^2}$ if and only if one of the following holds: (i) $t=1$, $q\equiv…

Number Theory · Mathematics 2012-10-03 Xiang-dong Hou

Let $G$ be a finite $p$-group and $k$ a field of characteristic $p>0$. We show that $G$ has a \emph{non-linear} faithful action on a polynomial ring $U$ of dimension $n=\mathrm{log}_p(|G|)$ such that the invariant ring $U^G$ is also…

Representation Theory · Mathematics 2014-02-26 Peter Fleischmann , Chris Woodcock

We investigate permutations in terms of their cycle structure and descent set. To do this, we generalize the classical bijection of Gessel and Reutenauer to deal with permutations that have some ascending and some descending blocks. We then…

Combinatorics · Mathematics 2009-09-01 Jacob Steinhardt

Gamma-positivity is an elementary property that polynomials with symmetric coefficients may have, which directly implies their unimodality. The idea behind it stems from work of Foata, Sch\"utzenberger and Strehl on the Eulerian…

Combinatorics · Mathematics 2018-12-04 Christos A. Athanasiadis

In algebraic, topological, and geometric combinatorics inequalities among the coefficients of combinatorial polynomials are frequently studied. Recently a notion called the alternatingly increasing property, which is stronger than…

Combinatorics · Mathematics 2020-01-14 Petter Brändén , Liam Solus

We prove several general formulas for the distributions of various permutation statistics over any set of permutations whose quasisymmetric generating function is a symmetric function. Our formulas involve certain kinds of plethystic…

Combinatorics · Mathematics 2020-08-21 Ira M. Gessel , Yan Zhuang

We give a new proof of the $\hat{U}$-theorem of B\'erczi, Doran, Hawes and Kirwan on the existence of geometric quotients for actions of graded unipotent groups in terms of stacks of filtrations and gradings introduced by Halpern-Leistner.…

Algebraic Geometry · Mathematics 2025-05-30 Ludvig Modin

For a finite subset $I$ of positive integers, the descent polynomial $\mathcal{D}(I;n)$ counts the number of permutations in $S_n$ that have descent set $I$. We generalize descent polynomials by considering permutations with a specific…

Combinatorics · Mathematics 2025-11-11 Jeongwon Lee , Nathan Lesnevich , Martha Precup

Finding distributions of permutation statistics over pattern-avoiding classes of permutations attracted much attention in the literature. In particular, Bukata et al. found distributions of ascents and descents on permutations avoiding any…

Combinatorics · Mathematics 2024-11-06 Tian Han , Sergey Kitaev

We define a new family of generalized Stirling permutations that can be interpreted in terms of ordered trees and forests. We prove that the number of generalized Stirling permutations with a fixed number of ascents is given by a natural…

Combinatorics · Mathematics 2021-05-11 J. Fernando Barbero G. , Jesús Salas , Eduardo J. S. Villaseñor

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

We construct, out of modular symbols, 1-traces that are invariant with respect to the actions of the Hopf algebra $\Hc_{1}$ on the crossed product $\Ac_{Q}$ of the algebra of modular forms of all levels by $\GL^+ (2,Q)$ investigated in…

Quantum Algebra · Mathematics 2007-05-23 Alain Connes , Henri Moscovici

In this work, we prove that the permutation group of a Reed-Solomon code is given by the polynomials of degree one that leave the set of evaluation points invariant. Our results provide a straightforward proof of the well-known cases of the…

Information Theory · Computer Science 2026-01-05 Eduardo Camps-Moreno , Jun Bo Lau , Hiram H. López , Welington Santos

We introduce a notion of {\em cyclic Schur-positivity} for sets of permutations, which naturally extends the classical notion of Schur-positivity, and it involves the existence of a bijection from permutations to standard Young tableaux…

Combinatorics · Mathematics 2019-08-22 Jonathan Bloom , Sergi Elizalde , Yuval Roichman

A bracket polynomial on the integers is a function formed using the operations of addition, multiplication and taking fractional parts. For a fairly large class of bracket polynomials we show that if p is a bracket polynomial of degree k-1…

Number Theory · Mathematics 2014-09-29 Matthew Tointon

Let $q=4$ and $k$ a positive integer. In this short note, we present a class of permutation polynomials over $\Bbb F_{q^{3k}}$. We also present a generalization.

Number Theory · Mathematics 2018-05-17 Neranga Fernando

It is known when we call a poset P, a $\mathcal{P}$-chain permutational poset, given a subset of permutations $\mathcal{P}$ of the symmetric group $S_{n}$. In this work, we use the same idea to study subsets of words of length $n$, that are…

Combinatorics · Mathematics 2025-12-16 Amrita Acharyya

When $A = \mathbb{k}[x_1, \ldots, x_n]$ and $G$ is a small subgroup of $\operatorname{GL}_n(\mathbb{k})$, Auslander's Theorem says that the skew group algebra $A \# G$ is isomorphic to $\operatorname{End}_{A^G}(A)$ as graded algebras. We…

Rings and Algebras · Mathematics 2020-12-09 Jason Gaddis , Ellen Kirkman , W. Frank Moore , Robert Won

The Stirling permutations introduced by Gessel-Stanley have recently received considerable attention. Motivated by Ji's work on $(\alpha,\beta)$-Eulerian polynomials (Sci China Math., 2025) and Yan-Yang-Lin's work on $1/k$-Eulerian…

Combinatorics · Mathematics 2025-07-28 Shi-Mei Ma , Jianfeng Wang , Guiying Yan , Jean Yeh , Yeong-Nan Yeh

Let $\sigma=(\sigma_1,..., \sigma_N)$, where $\sigma_i =\pm 1$, and let $C(\sigma)$ denote the number of permutations $\pi$ of $1,2,..., N+1,$ whose up-down signature $\mathrm{sign}(\pi(i+1)-\pi(i))=\sigma_i$, for $i=1,...,N$. We prove that…

Combinatorics · Mathematics 2007-05-23 F. C. S. Brown , T. M. A. Fink , K. Willbrand
‹ Prev 1 4 5 6 7 8 10 Next ›