Related papers: Wilf Equivalence for the Charge Statistic
We consider two related problems arising from a question of R. Graham on quasirandom phenomena in permutation patterns. A ``pattern'' in a permutation $\sigma$ is the order type of the restriction of $\sigma : [n] \to [n]$ to a subset $S…
We consider a Wilson-Dirac operator with improved chiral properties. We show that, for arbitrarily rough gauge fields, it satisfies the index theorem if we identify the zero modes with the small real eigenvalues of the fermion operator and…
The motivation of this paper is to investigate the joint distribution of succession and Eulerian statistics. We first investigate the enumerators for the joint distribution of descents, big ascents and successions over all permutations in…
We give a sufficient condition for the two dashed patterns $\tau^{(1)}-\tau^{(2)}-\cdots-\tau^{(\ell)}$ and $\tau^{(\ell)}-\tau^{(\ell-1)}-\cdots-\tau^{(1)}$ to be (strongly) Wilf-equivalent. This permits to solve in a unified way several…
Let $S$ be a numerical semigroup of embedding dimension $e$ and conductor $c$. The question of Wilf is, if $\#(\mathbb N\setminus S)/c\leq e-1/e$. \noindent In (An asymptotic result concerning a question of Wilf, arXiv:1111.2779v1…
Using recently proposed soliton equations we derive a basic identity for the scaling violation of $N=2$ supersymmetric gauge theories $\sum_i a_i\partial F/\partial a_i-2F=8 \pi i b_1 u$. Here $F$ is the prepotential, $a_i$'s are 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…
In [S. Kitaev and J. Remmel: Classifying descents according to parity] the authors refine the well-known permutation statistic "descent" by fixing parity of (exactly) one of the descent's numbers. In this paper, we generalize the results of…
In our joint paper with W. Fulton (math.AG/9804041) we prove a formula for the cohomology class of a quiver variety. This formula is general enough to give new expressions for all known types of Schubert polynomials. In the present paper we…
In a recent paper, Goyt and Sagan studied distributions of certain set partition statistics over pattern restricted sets of set partitions that were counted by the Fibonacci numbers. Their study produced a class of $q$-Fibonacci numbers,…
We study new statistics on permutations that are variations on the descent and the inversion statistics. In particular, we consider the alternating descent set of a permutation sigma = sigma_1sigma_2...sigma_n defined as the set of indices…
We propose and prove a trinomial version of the celebrated Bailey's lemma. As an application we obtain new fermionic representations for characters of some unitary as well as nonunitary models of N = 2 superconformal field theory (SCFT). We…
In 2000, Babson and Steingr\'{i}msson generalized the notion of permutation patterns to the so-called vincular patterns, and they showed that many Mahonian statistics can be expressed as sums of vincular pattern occurrence statistics. STAT…
Random integers, sampled uniformly from $[1,x]$, share similarities with random permutations, sampled uniformly from $S_n$. These similarities include the Erd\H{o}s--Kac theorem on the distribution of the number of prime factors of a random…
We present a class of permutations for which the number of distinctly ordered subsequences of each permutation approaches an almost optimal value as the length of the permutation grows to infinity.
We consider the two permutation statistics which count the distinct pairs obtained from the last two terms of occurrences of patterns t_1...t_{m-2}m(m-1) and t_1...t_{m-2}(m-1)m in a permutation, respectively. By a simple involution in…
The dual character of invariance under transformations and definability by some operations has been used in classical work by for example Galois and Klein. Following Tarski, philosophers of logic have claimed that logical notions themselves…
A permutation $\sigma$ of a multiset is called Stirling permutation if $\sigma(s)\ge \sigma(i)$ as soon as $\sigma(i)=\sigma(j)$ and $i<s<j.$ In our paper we study Stirling polynomials that arise in the generating function for descent…
A bijection between $(31245,32145,31254,32154)$-avoiding permutations and $(31425,32415,31524,32514)$-avoiding permutations is constructed, which preserves five classical set-valued statistics. Combining with two codings of permutations due…
We discuss the computation of transport coefficients in large N_f QCD and the O(N) model for massive particles. The calculation is organized using the 1/N expansion of the 2PI effective action to next-to-leading order. For the gauge theory,…