Related papers: Permutation statistics and weak {B}ruhat order in …
We introduce ballot matrices, a signed combinatorial structure whose definition naturally follows from the generating function for labeled interval orders. A sign reversing involution on ballot matrices is defined. We show that matrices…
We give a combinatorial description for the weak order on the hyperoctahedral group. This characterization is then used to analyze the order-theoretic properties of the shifted products of hyperoctahedral groups. It is shown that each…
We introduce a new statistic on the hyperoctahedral groups (Coxeter groups of type B), and give a conjectural formula for its signed distributions over arbitrary descent classes. The statistic is analogous to the classical Coxeter length…
The class of bipartite permutation graphs enjoys many nice and important properties. In particular, this class is critically important in the study of clique- and rank-width of graphs, because it is one of the minimal hereditary classes of…
Motivated by charge balancing constraints for rank modulation schemes, we introduce the notion of balanced permutations and derive the capacity of balanced permutation codes. We also describe simple interleaving methods for permutation code…
An approach is suggested for treating multiscale fluctuations in macromolecular systems. The emphasis is on the statistical properties of such fluctuations. The approach is illustrated by a macromolecular system with mesoscopic fluctuations…
The study of permutation and partition statistics is a classical topic in enumerative combinatorics. The major index statistic on permutations was introduced a century ago by Percy MacMahon in his seminal works. In this extended abstract,…
Global permutation patterns have recently been shown to characterize important properties of a Coxeter group. Here we study global patterns in the context of signed permutations, with both characterizing and enumerative results.…
We characterize permutations whose Bruhat graphs can be drawn in the plane and those whose Bruhat graphs can be drawn in the torus. In particular, we show these properties are characterized by avoiding finitely many permutations.
We discuss both simple and more subtle connections between the numbers of permutations and full cycles with some restrictions,in particular, between the numbers of permutations and full cycles with prescribed up-down structure.
In certain finite posets, the expected down-degree of their elements is the same whether computed with respect to either the uniform distribution or the distribution weighting an element by the number of maximal chains passing through it.…
We introduce two partially ordered sets, $P^A_n$ and $P^B_n$, of the same cardinalities as the type-A and type-B noncrossing partition lattices. The ground sets of $P^A_n$ and $P^B_n$ are subsets of the symmetric and the hyperoctahedral…
Random permutations with distribution conditionally uniform given the set of record values can be generated in a unified way, coherently for all values of $n$. Our central example is a two-parameter family of random permutations that are…
We study relationships between permutation statistics and pattern-functions, counting the number of times particular patterns occur in a permutation. This allows us to write several familiar statistics as linear combinations of pattern…
For each permutation $w$, we can construct a collection of hyperplanes $\mathcal{A}_w$ according to the inversions of $w$, which is called the inversion hyperplane arrangement associated to $w$. It was conjectured by Postnikov and confirmed…
Stirling numbers, which count partitions of a set and permutations in the symmetric group, have found extensive application in combinatorics, geometry, and algebra. We study analogues and q-analogues of these numbers corresponding to the…
A permutation may be represented by a collection of paths in the plane. We consider a natural class of such representations, which we call tangles, in which the paths consist of straight segments at 45 degree angles, and the permutation is…
A number system coding for the permutations generated by cyclic shift is described. The system allows to find the rank of a permutation given how it has been generated, and to determine a permutation given its rank. It defines a code…
The higher Bruhat orders are partial orders that generalize the weak order on the symmetric group $S_n$, and the second higher Bruhat order is a poset on commutation classes of reduced words for the longest element in $S_n$, where covering…
We give another bijective proof of a result of Corteel and Nadeau. We find a generating function related to unrestricted columns of permutation tableaux. As a consequence, we obtain a sign-imbalance formula for permutation tableaux. We…