Related papers: Reduced Decompositions and Permutation Patterns
Recently, B\'ona and Smith defined strong pattern avoidance, saying that a permutation $\pi$ strongly avoids a pattern $\tau$ if $\pi$ and $\pi^2$ both avoid $\tau$. They conjectured that for every positive integer $k$, there is a…
We study the combinatorial description of the LDU decomposition of totally positive matrices. We give a description of the lower triangular L, the diagonal D, and the upper triangular U matrices of the LDU decomposition of totally positive…
The main purpose of this paper is to study cohomology and develop a deformation theory of restricted Lie algebras in positive characteristic $p>0$. In the case $p\geq3$, it is shown that the deformations of restricted Lie algebras are…
In this article, we define and study a geometry and an order on the set of partitions of an even number of objects. One of the definitions involves the partition algebra, a structure of algebra on the set of such partitions depending on an…
The structure of order ideals in the Bruhat order for the symmetric group is elucidated via permutation patterns. A method for determining non-isomorphic principal order ideals is described and applied for small lengths. The permutations…
In this paper, we study harmonic analysis on finite homogeneous spaces whose associated permutation representation decomposes with multiplicity. After a careful look at Frobenius reciprocity and transitivity of induction, and the…
The paper studies the structure of restricted Leibniz algebras. More specifically speaking, we first give the equivalent definition of restricted Leibniz algebras, which is by far more tractable than that of a restricted Leibniz algebras in…
A permutation code is a nonlinear code whose codewords are permutation of a set of symbols. We consider the use of permutation code in the deletion channel, and consider the symbol-invariant error model, meaning that the values of the…
We introduce decomposition complexes of posets, which generalize order complexes. The main advantage of our construction is that decomposition complexes are closed under taking products. Other special instances of this theory include nested…
The concept of pattern avoidance respectively containment in permutations can be extended to permutations on multisets in a straightforward way. In this note we present a direct proof of the already known fact that the well-known…
Higher-dimensional analogs of the predictable degree property and column reducedness are defined, and it is proved that the two properties are equivalent. It is shown that every multidimensional convolutional code has, what is called, a…
In this paper we give a bijection between the class of permutations that can be drawn on an X-shape and a certain set of permutations that appears in [Knuth] in connection to sorting algorithms. A natural generalization of this set leads us…
Compressed sensing is the art of reconstructing structured $n$-dimensional vectors from substantially fewer measurements than naively anticipated. A plethora of analytic reconstruction guarantees support this credo. The strongest among them…
We classify possible supersymmetry-preserving relevant, marginal, and irrelevant deformations of unitary superconformal theories in $d \geq 3$ dimensions. Our method only relies on symmetries and unitarity. Hence, the results are model…
A permutation of the multiset $\{1^m,2^m,\dots,n^m\}$ is a {\em canon permutation} if the subsequence formed by the $j$th copy of each element of $[n]:=\{1,2,\dots,n\}$ is identical for all $j\in[m]$. Canon permutations were introduced by…
Previous work has shown that the disarray (or displacement) of an (affine) (signed) permutation is bounded in terms of its Coxeter length. Here, we characterize the permutations for which the bound is sharp in two ways: in terms of a…
We introduce a new sorting device for permutations which makes use of a pop stack augmented with a bypass operation. This results in a sorting machine, which is more powerful than the usual Popstacksort algorithm and seems to have never…
In this work we introduce the concept of a sub-space decomposition, subject to a partition of the coordinates. Considering metrics determined by partial orders in the set of coordinates, the so called poset metrics, we show the existence of…
We study the problem of counting alternating permutations avoiding collections of permutation patterns including 132. We construct a bijection between the set S_n(132) of 132-avoiding permutations and the set A_{2n + 1}(132) of alternating,…
Every k entries in a permutation can have one of k! different relative orders, called patterns. How many times does each pattern occur in a large random permutation of size n? The distribution of this k!-dimensional vector of pattern…