Related papers: Reduced Decompositions and Permutation Patterns

A framework to systematically decouple high order elliptic equations into combination of Poisson-type and Stokes-type equations is developed. The key is to systematically construct the underling commutative diagrams involving the complexes…

Loss of compactness that occurs in may significant PDE settings can be expressed in a well-structured form of profile decomposition for sequences. Profile decompositions are formulated in relation to a triplet $(X,Y,D)$, where $X$ and $Y$…

We study central configurations when the set of positions is symmetric. We use a theorem from representation theory of finite groups to explore the symmetry properties of equations for central configurations. This approach simplifies…

We consider a random permutation drawn from the set of 321-avoiding permutations of length $n$ and show that the number of occurrences of another pattern $\sigma$ has a limit distribution, after scaling by $n^{m+\ell}$ where $m$ is the…

Extending the notion of pattern avoidance in permutations, we study matchings and set partitions whose arc diagram representation avoids a given configuration of three arcs. These configurations, which generalize 3-crossings and 3-nestings,…

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…

Decoupling multivariate polynomials is useful for obtaining an insight into the workings of a nonlinear mapping, performing parameter reduction, or approximating nonlinear functions. Several different tensor-based approaches have been…

In 1998, Leclerc and Zelevinsky introduced the notion of weakly separated collections of subsets of the ordered $n$-element set $[n]$ (using this notion to give a combinatorial characterization for quasi-commuting minors of a quantum…

Of four types of Kaplansky algebras, type-2 and type-4 algebras have previously unobserved $\mathbb{Z}/2$-gradings: nonlinear in roots. A method assigning a simple Lie superalgebra to every $\mathbb{Z}/2$-graded simple Lie algebra in…

Motivated by Kitaev and Zhang's recent work on non-overlapping ascents in stack-sortable permutations and Dumont's permutation interpretation of the Jacobi elliptic functions, we investigate some parity statistics on restricted…

Decomposition spaces are a class of function spaces constructed out of well-behaved coverings and partitions of unity of a set. The structure of the covering of the set determines the properties of the decomposition space. Besov spaces,…

We introduce and characterise grid classes, which are natural generalisations of other well-studied permutation classes. This characterisation allows us to give a new, short proof of the Fibonacci dichotomy: the number of permutations of…

The study of pattern avoidance in permutations, and specifically in flattened partitions is an active area of current research. In this paper, we count the number of distinct flattened partitions over [n] avoiding a single pattern, as well…

Using techniques from Poisson approximation, we prove explicit error bounds on the number of permutations that avoid any pattern. Most generally, we bound the total variation distance between the joint distribution of pattern occurrences…

A general theory of permutation orbifolds is developed for arbitrary twist groups. Explicit expressions for the number of primaries, the partition function, the genus one characters, the matrix elements of modular transformations and for…

A permutation is so-called two stack sortable if it (i) avoids the (scattered) pattern 2-3-4-1, and (ii) contains a 3-2-4-1 pattern only as part of a 3-5-2-4-1 pattern. Here we show that the permutations on [n] satisfying condition (ii)…

Let $\pi_n$ be a uniformly chosen random permutation on $[n]$. The authors of [2] showed that the expected number of distinct consecutive patterns of all lengths $k\in\{1,2,\ldots,n\}$ in $\pi_n$ was $\frac{n^2}{2}(1-o(1))$ as $n\to\infty$,…

Bezrukavnikov and Kaledin introduced quantizations of symplectic varieties X in positive characteristic which endow the Poisson bracket on X with the structure of a restricted Lie algebra. We consider deformation quantization of line…

We investigate pattern avoidance in alternating permutations and generalizations thereof. First, we study pattern avoidance in an alternating analogue of Young diagrams. In particular, we extend Babson-West's notion of shape-Wilf…

Presymplectic and Poisson reduction of cluster maps are described in terms of the "canonical" foliations of presymplectic and Poisson manifolds. This approach to reduction leads to a geometric description, in terms of foliations, of the…