Related papers: Descent c-Wilf Equivalence

We study the signed Bernoulli convolution $$\nu_\beta^{(n)}=*_{j=1}^n \left (\frac12\delta_{\beta^{-j}}-\frac12\delta_{-\beta^{-j}}\right ),\ n\ge 1$$ where $\beta>1$ satisfies $$\beta^m=\beta^{m-1}+\cdots+\beta+1$$ for some integer $m\ge…

We study questions of even-Wilf-equivalence, the analogue of Wilf-equivalence when attention is restricted to pattern avoidance by permutations in the alternating group. Although some Wilf-equivalence results break when considering…

Let $s$ denote West's stack-sorting map. A permutation is called $t-\textit{sorted}$ if it is of the form $s^t(\mu)$ for some permutation $\mu$. We prove that the maximum number of descents that a $t$-sorted permutation of length $n$ can…

We prove that the examples by Smith and McMullen-Taubes provide infinitely many counterexamples to one direction of Donaldson's 4-6 question and the closely related Stabilising Conjecture. These are the first known counterexamples. In the…

We study the generating function of descent numbers for the permutations with descent pairs of prescribed parities, the distribution of which turns out to be a refinement of median Genocchi numbers. We prove the $\gamma$-positivity for the…

Our first main result shows that, for words with a fixed multiset of weak right-to-left minima, the statistics within each of the following three classes are equidistributed: 1. Mahonian statistics: $\textsf{inv}$, $\textsf{maj}$,…

A permutation is centrosymmetric if it is fixed by a half-turn rotation of its diagram. Initially motivated by a question by Alexander Woo, we investigate the question of whether the growth rate of a permutation class equals the growth rate…

Let $S_n$ denote the set of permutations of $[n]:=\{1,\cdots, n\}$, and denote a permutation $\sigma\in S_n$ by $\sigma=\sigma_1\sigma_2\cdots \sigma_n$. For $l\ge2$ an integer, let $A^{(n)}_{l;k}\subset S_n$ denote the event that the set…

The circular peak set of a permutation $\sigma$ is the set $\{\sigma(i)\mid \sigma(i-1)<\sigma(i)>\sigma(i+1)\}$. In this paper, we focus on the enumeration problems for permutations by circular peak sets. Let $cp_n(S)$ denote the number of…

We find a non-trivial representation of the symmetric group $S_n$ on the $n$-fold Deligne product $\mathcal{C}^{\boxtimes n}$ of a modular tensor category $\mathcal{C}$ for any $n \geq 2$. This is accomplished by checking that a particular…

Simsun permutations, Andr\'e I permutations and Andr\'e II permutations are three combinatorial models for Euler numbers. It's known that the descent statistic is equidistributed over the set of Andr\'e I permutations and the set of simsun…

Computing the reversal distances of signed permutations is an important topic in Bioinformatics. Recently, a new lower bound for the reversal distance was obtained via the plane permutation framework. This lower bound appears different from…

The concept of pattern avoidance respectively containment in permutations can be extended to permutations on multisets in a straightforward way. In this note we present a direct proof of the already known fact that the well-known…

We enumerate derangements with descents in prescribed positions. A generating function was given by Guo-Niu Han and Guoce Xin in 2007. We give a combinatorial proof of this result, and derive several explicit formulas. To this end, we…

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…

We consider the probability $p(S_n)$ that a pair of random permutations generates either the alternating group $A_n$ or the symmetric group $S_n$. Dixon (1969) proved that $p(S_n)$ approaches $1$ as $n\to\infty$ and conjectured that…

We prove a conjecture dating back to a 1978 paper of D.R.\ Musser~\cite{musserirred}, namely that four random permutations in the symmetric group $\mathcal{S}_n$ generate a transitive subgroup with probability $p_n > \epsilon$ for some…

Let $RG$ be the group ring of a finite group $G$ over a commutative ring $R$ with $1$. An element $x$ in $RG$ is said to be skew-symmetric with respect to an involution $\sigma$ of $RG$ if $\sigma(x)=-x.$ A structure theorem for the…

A symmetric quiver $(Q,\sigma)$ is a finite quiver without oriented cycles $Q=(Q_0,Q_1)$ equipped with a contravariant involution $\sigma$ on $Q_0\sqcup Q_1$. The involution allows us to define a nondegenerate bilinear form $<,>$ on a…

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…