Related papers: The area above the Dyck path of a permutation
Maps on a parameter space for expressing distribution functions are exactly derived from the Perron-Frobenius equations for a generalized Boole transform family. Here the generalized Boole transform family is a one-parameter family of maps…
We consider the relation between various permutation statistics and properties of permutation tableaux. We answer some of the questions of Steingrimsson and Williams (math.CO/0507149), in particular, on the distribution of the bistatistic…
An old conjecture of Kahn and Saks says, roughly, that any poset $P$ of large enough width contains elements $x,y$ which are "balanced" in the sense that the probability that $x$ precedes $y$ in a uniformly random linear extension of $P$ is…
Kim and Drake used generating functions to prove that the number of 2-distant noncrossing matchings, which are in bijection with little Schroeder paths, is the same as the weight of Dyck paths in which downsteps from even height have weight…
We give the detale description from various points of view of Pascal automorphism,--- a natural transformation of the space of paths in the Pascal graph (= infinite Pascal triangle), and describetha plan of the proof of continuiuty of its…
A \emph{Dyck path} is a lattice path in the first quadrant of the $xy$-plane that starts at the origin, ends on the $x$-axis, and consists of the same number of North-East steps $U$ and South-East steps $D$. A \emph{valley} is a subpath of…
For one-dimensional growth processes we consider the distribution of the height above a given point of the substrate and study its scale invariance in the limit of large times. We argue that for self-similar growth from a single seed the…
In this paper we address the problem of understanding the success of algorithms that organize patches according to graph-based metrics. Algorithms that analyze patches extracted from images or time series have led to state-of-the art…
We consider diffusion on discrete measure spaces as encoded by Markovian semigroups arising from weighted graphs. We study whether the graph is uniquely determined if the diffusion is given up to order isomorphism. If the graph is recurrent…
We study spatial permutations with cycle weights that are bounded or slowly diverging. We show that a phase transition occurs at an explicit critical density. The long cycles are macroscopic and their cycle lengths satisfy a…
We develop a general procedure for reduction along strong Dirac maps, which are a broad generalization of Poisson momentum maps. We recover a large number of familiar constructions in Poisson and quasi-Poisson geometry, and we introduce new…
We give an account of our work on transitive factorizations of permutations. The work has had impact upon other areas of mathematics such as the enumeration of graph embeddings, random matrices, branched covers, and the moduli spaces of…
The Preisach graph is a directed graph associated with a permutation $\rho\in{\cal S}_N$. We give an explicit bijection between its vertices and increasing subsequences of $\rho$ with the property that the length of a subsequence equals to…
A $k$-universal permutation, or $k$-superpermutation, is a permutation that contains all permutations of length $k$ as patterns. The problem of finding the minimum length of a $k$-superpermutation has recently received significant attention…
Given a permutation P in Sn, let G(P) be the graph on n vertices {1,...,n}, where two vertices i<j are adjacent if i appears right of j in P and there are no integers k with i<k<j and k appearing between i and j in P. Let G'(P) be the graph…
We compute the limiting distribution, as n approaches infinity, of the number of cycles of length between gamma n and delta n in a permutation of [n] chosen uniformly at random, for constants gamma, delta such that 1/(k+1) <= gamma < delta…
Transmutation is a technique for extending classical probability distributions in order to give them more flexibility. In this paper, we are interested in cubic transmutations of the Pareto distribution. We establish a general formula that…
Let $S_{\rm div}(n)$ denote the set of permutations $\pi$ of $n$ such that for each $1\leq j \leq n$ either $j \mid \pi(j)$ or $\pi(j) \mid j$. These permutations can also be viewed as vertex-disjoint directed cycle covers of the divisor…
Computational topology has recently known an important development toward data analysis, giving birth to the field of topological data analysis. Topological persistence, or persistent homology, appears as a fundamental tool in this field.…
The aim of this paper is to develop the combinatorics of constructions associated to what we call \emph{triangular partitions}. As introduced in arXiv:2102.07931, these are the partitions whose cells are those lying below the line joining…