Related papers: On comparability of bigrassmannian permutations

Let $B$ be the group of invertible upper-triangular complex $n\times n$ matrices, $\mathfrak{u}$ the space of upper-triangular complex matrices with zeroes on the diagonal and $\mathfrak{u}^*$ its dual space. The group $B$ acts on…

We introduce vincular pattern posets, then we consider in particular the quasi-consecutive pattern poset, which is defined by declaring $\sigma \leq \tau$ whenever the permutation $\tau$ contains an occurrence of the permutation $\sigma$ in…

Bayesian network (BN) structure discovery algorithms typically either make assumptions about the sparsity of the true underlying network, or are limited by computational constraints to networks with a small number of variables. While these…

Given a permutation $\sigma$, its corresponding binary search tree is obtained by recursively inserting the values $\sigma(1),\ldots,\sigma(n)$ into a binary tree so that the label of each node is larger than the labels of its left subtree…

Let $\{A_{i,n}\}$ be a triangular array of elements in a Banach algebra, whose norms do not grow too fast, and whose row averages converge to $A$. Let $\sigma \in S(n)$ be a permutation drawn uniformly at random. If the array only contains…

Let G be a quasi simple algebraic group over an algebraically closed field k whose characteristic is not very bad for G, and let B be a Borel subgroup of G with Lie algebra b. Given a B-stable abelian subalgebra a of the nilradical of b, we…

Define $S_n(R;T)$ to be the number of permutations on $n$ letters which avoid all patterns in the set $R$ and contain each pattern in the multiset $T$ exactly once. In this paper we enumerate $S_n(\{\alpha\};\{\beta\})$ and…

In this article, we describe an algorithm to determine whether a permutation class C given by a finite basis B of excluded patterns contains a finite number of simple permutations. This is a continuation of the work initiated in [Brignall,…

We extend Probability Bracket Notation (PBN), inspired by the Dirac notation in quantum mechanics, to multivariable probability systems and static Bayesian networks (BNs). By defining probability distributions and conditional expectations…

The Gaussian $\beta$-ensemble is a real $n$-point configuration $\{x_j\}_1^n$ picked randomly with respect to the Boltzmann factor $e^{-\frac\beta 2H_n}$, $H_n=\sum_{i\ne j}\log\frac 1{|x_i-x_j|}+n\sum_{i=1}^n\tfrac 12x_i^2.$ The point…

The standard notion of poset probability of a finite poset P involves calculating, for incomparable $\alpha$, $\beta$ in P, the number of linear extensions of P for which $\alpha$ precedes $\beta$. The fraction of those linear extensions…

Define a permutation to be any sequence of distinct positive integers. Given two permutations p and s on disjoint underlying sets, we denote by p sh s the set of shuffles of p and s (the set of all permutations obtained by interleaving the…

The main result of this work is the characterization of the covering relations of the Bruhat order of the maximal parabolic quotients of type B. Our approach is mainly combinatorial and is based in the pattern of the corresponding…

The Bruss-Robertson inequality gives a bound on the maximal number of elements of a random sample whose sum is less than a specified value, and the extension of that inequality which is given here neither requires the independence of the…

We present a simple bijection between Baxter permutations of size $n$ and plane bipolar orientations with n edges. This bijection translates several classical parameters of permutations (number of ascents, right-to-left maxima,…

Let $G$ be a transitive permutation group on $\Omega$. The $G$-invariant partitions form a sublattice of the lattice of all partitions of $\Omega$, having the further property that all its elements are uniform (that is, have all parts of…

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…

The convex transform order is one way to make precise comparison between the skewness of probability distributions on the real line. We establish a simple and complete characterisation of when one Beta distribution is smaller than another…

The cardinal invariants $ \mathfrak h, \mathfrak b, \mathfrak s$ of $\mathcal P (\omega)$ are known to satisfy that $\omega_1 \leq \mathfrak h \leq\min\{\mathfrak b, \mathfrak s\}$. We prove that all inequalities can be strict. We also…

The order $O_n(\sigma)$ of a permutation $\sigma$ of $n$ objects is the smallest integer $k \geq 1$ such that the $k$-th iterate of $\sigma$ gives the identity. A remarkable result about the order of a uniformly chosen permutation is due to…