Related papers: Lehmer code transforms and Mahonian statistics on …

Hertzsprung patterns, recently introduced by Anders Claesson, are subsequences of a permutation contiguous in both positions and values, and can be seen as a subclass of bivincular patterns. This paper investigates Hertzsprung patterns…

Permutations are usually enumerated by size, but new results can be found by enumerating them by inversions instead, in which case one must restrict one's attention to indecomposable permutations. In the style of the seminal paper by Simion…

This paper mainly studies problems about so called "permutation polynomials modulo $m$", polynomials with integer coefficients that can induce bijections over Z_m={0,...,m-1}. The necessary and sufficient conditions of permutation…

Not long ago, Claesson and Mansour proposed some conjectures about the enumeration of the permutations avoiding more than three Babson - Steingr\'\i msson patterns (generalized patterns of type $(1,2)$ or $(2,1)$). The avoidance of one, two…

In this paper, we propose a general framework that extends the theory of permutation patterns to higher dimensions and unifies several combinatorial objects studied in the literature. Our approach involves introducing the concept of a…

This paper studies permutation statistics that count occurrences of patterns. Their expected values on a product of $t$ permutations chosen randomly from $\Gamma \subseteq S_{n}$, where $\Gamma$ is a union of conjugacy classes, are…

A composite number $n$ is called Lehmer when $\phi(n) | n - 1$, where $\phi$ is the Euler totient function. In 1932, D.~H.~Lehmer conjectured that there are no composite Lehmer numbers and showed that Lehmer numbers must be odd and…

A result of Foata and Schutzenberger states that two statistics on permutations, the number of inversions and the inverse major index, have the same distribution on a descent class. We give a multivariate generalization of this property:…

We present some Markovian approaches to prove universality results for some functions on the symmetric group. Some of those statistics are already studied in [Kammoun, 2018, 2020] but not the general case. We prove, in particular, that the…

In this article, we consider systems of linear congruences in several variables and obtain necessary and sufficient conditions as well as explicit expressions for the number of solutions subject to certain restriction conditions. These…

Drawing on a problem posed by Hertzsprung in 1887, we say that a given permutation $\pi\in\mathcal{S}_n$ contains the Hertzsprung pattern $\sigma\in\mathcal{S}_k$ if there is factor $\pi(d+1)\pi(d+2)\cdots\pi(d+k)$ of $\pi$ such that…

Using techniques from Poisson approximation, we prove explicit error bounds on the number of permutations that avoid any pattern. Most generally, we bound the total variation distance between the joint distribution of pattern occurrences…

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…

We introduce a new notion of commutator which depends on a choice of subvariety in any variety of omega-groups. We prove that this notion encompasses Higgins's commutator, Froehlich's central extensions and the Peiffer commutator of…

A permutation is defined to be cycle-up-down if it is a product of cycles that, when written starting with their smallest element, have an up-down pattern. We prove bijectively and analytically that these permutations are enumerated by the…

We solve Lehmer's problem for a class of polynomials arising from Hermitian matrices over the Eisenstein and Gaussian integers, that is, we show that all such polynomials have Mahler measure at least Lehmer's number \tau_0 = 1.17628... .

The extension of pattern avoidance from ordinary permutations to those on multisets gave birth to several interesting enumerative results. We study permutations on regular multisets, i.e., multisets in which each element occurs the same…

We consider the problem of packing fixed-length patterns into a permutation, and develop a connection between the number of large patterns and the number of bonds in a permutation. Improving upon a result of Kaplansky and Wolfowitz, we…

In this article, we study a non-uniform distribution on permutations biased by their number of records that we call \emph{record-biased permutations}. We give several generative processes for record-biased permutations, explaining also how…

Motivated by recent work on (re)mixed Eulerian numbers, we provide a combinatorial interpretation of a subfamily of the remixed Eulerian numbers introduced by Nadeau and Tewari. More specifically, we show that these numbers can be realized…