Related papers: Hook-length formula and applications to alternatin…
The discrete distribution of the length of longest increasing subsequences in random permutations of $n$ integers is deeply related to random matrix theory. In a seminal work, Baik, Deift and Johansson provided an asymptotics in terms of…
In a preceding paper [E.J.ofProb.34,860-892,(2006)], we proved a sewing lemma which was a key result for the study of Holder continuous functions. In this paper we give a non-commutative version of this lemma with some applications.
In present paper the Duane-Hunt relation for direct measurement of the Planck constant is improved by including of relativistic corrections. New relation to determine the Planck constant, suggested in this paper contains Duane-Hunt relation…
Counting the number of permutations of a given total displacement is equivalent to counting weighted Motzkin paths of a given area (Guay-Paquet and Petersen, 2014). The former combinatorial problem is still open. In this work, we show that…
We revisit the problem of certifying the correctness of approximate solution paths computed by numerical homotopy continuation methods. We propose a conceptually simple approach based on a parametric variant of the Krawczyk method from…
Extended formulations are an important tool to obtain small (even compact) formulations of polytopes by representing them as projections of higher dimensional ones. It is an important question whether a polytope admits a small extended…
We show connection between Dyck paths with peaks of bounded height and random walks. The correspondence between a certain class of random walks and such Dyck paths allows us to develop a probabilistic perspective on Chebyshev polynomials.
A general formula in closed form to obtain exact similarity solutions of the Fokker-Planck equation with both time-dependent drift and diffusion coefficients was recently presented by Lin and Ho [ Ann. Phys. \textbf{327}, 386 (2012); J.…
In this paper we study a mapping from permutations to Dyck paths. A Dyck path gives rise to a (Young) diagram and we give relationships between statistics on permutations and statistics on their corresponding diagrams. The distribution of…
A permutation of the integers avoiding monotone arithmetic progressions of length $6$ was constructed in (Geneson, 2018). We improve on this by constructing a permutation of the integers avoiding monotone arithmetic progressions of length…
We investigate the typical cycle lengths, the total number of cycles, and the number of finite cycles in random permutations whose probability involves cycle weights. Typical cycle lengths and total number of cycles depend strongly on the…
Comtet introduced the notion of indecomposable permutations in 1972. A permutation is indecomposable if and only if it has no proper prefix which is itself a permutation. Indecomposable permutations were studied in the literature in various…
We find a formula for the number of permutations of $[n]$ that have exactly $s$ runs up and down. The formula is at once terminating, asymptotic, and exact.
New sequences of discrete orthogonal polynomials associated with the modified Bessel function $K_\mu(z)$ or Macdonald function are considered. The corresponding weight function is $\lambda^k \rho_{k+\nu+1}(t)/ k!$, where $\ k \in…
Valid hook configurations are combinatorial objects used to understand West's stack sorting map as well as cumulants in noncommutative probability theory. We show a bijection between reduced valid hook configurations on 312-avoiding…
We extend the notion of consecutive pattern avoidance to considering sums over all permutations where each term is a product of weights depending on each consecutive pattern of a fixed length. We study the problem of finding the asymptotics…
The persistent homology transform (PHT) of a subset $M \subset \mathbb{R}^d$ is a map $\text{PHT}(M):\mathbb{S}^{d-1} \to \mathbf{Dgm}$ from the unit sphere to the space of persistence diagrams. This map assigns to each direction $v\in…
The fusion procedure provides a way to construct new solutions to the Yang-Baxter equation. In the case of the symmetric group the fusion procedure has been used to construct diagonal matrix elements using a decomposition of the Young…
In this note we prove an explicit binomial formula for Jack polynomials and discuss some applications of it.
In 2008, Han rediscovered an expansion of powers of Dedekind $\eta$ function due to Nekrasov and Okounkov by using Macdonald's identity in type $\widetilde{A}$. In this paper, we obtain new combinatorial expansions of powers of $\eta$, in…