Related papers: Alternating permutations and symmetric functions

We introduce the notion of crossings and nestings of a permutation. We compute the generating function of permutations with a fixed number of weak exceedances, crossings and nestings. We link alignments and permutation patterns to these…

Nield-Kuznetsov functions of the first kind are studied, which are solutions of an inhomogeneous parabolic Weber equation, and have applications in fluid flow problems. Connection formulas are constructed between them, numerically…

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…

We establish asymptotic expansions for factorial moments of following distributions: number of cycles in a random permutation, number of inversions in a random permutation, and number of comparisons used by the randomized quick sort…

There are numerous combinatorial objects associated to a Grassmannian permutation $w_\lambda$ that index cells of the totally nonnegative Grassmannian. We study several of these objects and their $q$-analogues in the case of permutations…

A detailed analysis of the remainder obtained by truncating the Euler series up to the $n$th-order term is presented. In particular, by using an approach recently proposed by Weniger, asymptotic expansions of the remainder, both in inverse…

The object of this paper is to give a systematic treatment of excedance-type polynomials. We first give a sufficient condition for a sequence of polynomials to have alternatingly increasing property, and then we present a systematic study…

We characterise and enumerate permutations that are sortable by n-4 passes through a stack. We conjecture the number of permutations sortable by n-5 passes, and also the form of a formula for the general case n-k, which involves a…

We study the expansions of permutation statistics in the basis of functions counting occurrences of a fixed pattern in a permutation. We show the finiteness of these pattern expansions for a class of permutation statistics including the…

Motivated by a problem in quantum field theory, we study the up and down structure of circular and linear permutations. In particular, we count the length of the (alternating) runs of permutations by representing them as monomials and find…

We prove that particle models whose action is given by the integrated $n$-th curvature function over the world line possess $n+1$ gauge invariances. A geometrical characterization of these symmetries is obtained via Frenet equations by…

We consider several generalizations of the classical $\gamma$-positivity of Eulerian polynomials (and their derangement analogues) using generating functions and combinatorial theory of continued fractions. For the symmetric group, we prove…

The richly developed theory of complex manifolds plays important roles in our understanding of holomorphic functions in several complex variables. It is natural to consider manifolds that will play similar roles in the theory of holomorphic…

We introduce a guessing game, permutation Wordle, in which a guesser attempts to recover a hidden permutation in $S_n$. In each round, the guesser guesses a permutation (using information from previous rounds) and is told which entries of…

We exhibit a procedure to asymptotically enumerate monotone grid classes of permutations. This is then applied to compute the asymptotic number of permutations in any connected one-corner class. Our strategy consists of enumerating the…

Let $p(m)$ (respectively, $q(m)$) be the maximum number $k$ such that any tree with $m$ edges can be transformed by contracting edges (respectively, by removing vertices) into a caterpillar with $k$ edges. We derive closed-form expressions…

We present exponential generating function analogues to two classical identities involving the ordinary generating function of the complete homogeneous symmetric functions. After a suitable specialization the new identities reduce to…

In 1916, MacMahon showed that permutations in $S_n$ with a fixed descent set $I$ are enumerated by a polynomial $d_I(n)$. Diaz-Lopez, Harris, Insko, Omar, and Sagan recently revived interest in this descent polynomial, and suggested the…

In this paper we propose a family of multivariate asymmetric distributions over an arbitrary subset of set of real numbers which is defined in terms of the well-known elliptically symmetric distributions. We explore essential properties,…

Linear second-order ordinary differential equations of the form $d^{2}w/dz^{2}=\{u^{2}f(a,z)$ $+g(z)\}w$ are studied for large values of the real parameter $u$, where $z$ ranges over a bounded or unbounded complex domain $Z$, and $a_{0} \le…