Related papers: On comparability of bigrassmannian permutations
Recall that a Stirling permutation is a permutation on the multiset $\{1,1,2,2,\ldots,n,n\}$ such that any numbers appearing between repeated values of $i$ must be greater than $i$. We call a Stirling permutation ``flattened'' if the…
The objects of our interest are the so-called $A$-permutations, which are permutations whose cycle length lie in a fixed set $A$. They have been extensively studied with respect to the uniform or the Ewens measure. In this paper, we extend…
Let $\mathcal D_n$ denote the average number of iterations of West's stack-sorting map $s$ that are needed to sort a permutation in $S_n$ into the identity permutation $123\cdots n$. We prove that…
A/B testing refers to the task of determining the best option among two alternatives that yield random outcomes. We provide distribution-dependent lower bounds for the performance of A/B testing that improve over the results currently…
We study several aspects of the M\"{o}bius function, $\mu[\sigma,\pi]$, on the poset of permutations under the pattern containment order. First, we consider cases where the lower bound of the poset is indecomposable. We show that…
The Bregman divergence have been the subject of several studies. We do not go to do an exhaustive study of its subclasses, but propose a proof that shows that the \b{eta}-divergence are subclasses of the Bregman divergences. It is in this…
Associated with any composition beta=(a,b,...) is a corresponding fence poset F(beta) whose covering relations are x_1 < x_2 < ... < x_{a+1} > x_{a+2} > ... > x_{a+b+1} < x_{a+b+2} < ... The distributive lattice L(beta) of all lower order…
Order dimension theory measures the complexity of partially ordered sets by quantifying how far they are from being linearly ordered. In this paper we study classical bounding results for order dimension within the framework of reverse…
Let $n \ge 3$ be an integer. Let $P_n = \{1, 2, 3, ..., n-1, n \}$ and let $S_n$ be the symmetric group of permutations on $P_n$. Motivated by the theory of discrete dynamical systems on the interval, we associate each permutation $\si_n$…
We study the number of linear extensions of a partial order with a given proportion of comparable pairs of elements, and estimate the maximum and minimum possible numbers. We also consider a random interval partial order on $n$ elements,…
Given a finite Borel measure $\mu$ on R n and basic semi-algebraic sets $\Omega$\_i $\subset$ R n , i = 1,. .. , p, we provide a systematic numerical scheme to approximate as closely as desired $\mu$(\cup\_i $\Omega$\_i), when all moments…
In recent years, a rich variety of shrinkage priors have been proposed that have great promise in addressing massive regression problems. In general, these new priors can be expressed as scale mixtures of normals, but have more complex…
We make explict a description in terms of convex geometry of the higher Bruhat orders B(n,d) sketched by Kapranov and Voevodsky. We give an analogous description of the higher Stasheff-Tamari poset S_1(n,d). We show that the map f sketched…
A poset is representable if it can be embedded in a field of sets in such a way that existing finite meets and joins become intersections and unions respectively (we say finite meets and joins are preserved). More generally, for cardinals…
Binary search trees (BST) are a popular type of data structure when dealing with ordered data. Indeed, they enable one to access and modify data efficiently, with their height corresponding to the worst retrieval time. From a probabilistic…
We analyze uncertainties in the theoretical prediction for the inclusive branching ratio $BR[B \rightarrow X_s \gamma]$. We find that the dominant uncertainty in the leading order expression comes from its $\mu$-dependence. We discuss a…
We consider Gibbs distributions, which are families of probability distributions over a discrete space $\Omega$ with probability mass function of the form $\mu^\Omega_\beta(\omega) \propto e^{\beta H(\omega)}$ for $\beta$ in an interval…
To any saturated chain in the affine Weyl group whose translation parts are sufficiently regular, we associate a near path and a far path in the quantum Bruhat graph. Using this, working in the Bruhat order on the minimal-length…
Lehmer's code defines a bijection between the symmetric group and the set of staircase compositions. In this paper, we characterize a poset structure on these compositions that is equivalent to the strong Bruhat order on the symmetric…
We investigate matching for the family $T_\alpha(x) = \beta x + \alpha \pmod 1$, $\alpha \in [0,1]$, for fixed $\beta > 1$. Matching refers to the property that there is an $n \in \mathbb N$ such that $T_\alpha^n(0) = T_\alpha^n(1)$. We…