Related papers: Simple marked mesh patterns

In this paper, we compute the distribution of the first letter statistic on nine avoidance classes of permutations corresponding to two pairs of patterns of length four. In particular, we show that the distribution is the same for each…

This dissertation presents a multifaceted look into the structural decomposition of permutation classes. The theory of permutation patterns is a rich and varied field, and is a prime example of how an accessible and intuitive definition…

Beginning with work of Zeilberger on classical pattern counts, there are a variety of structural results for moments of permutation statistics applied to random permutations. Using tools from representation theory, Gaetz and Ryba…

The notion of a mesh pattern was introduced recently, but it has already proved to be a useful tool for description purposes related to sets of permutations. In this paper we study eight mesh patterns of small lengths. In particular, we…

The classes of tree permutations and forest permutations were defined by Acan and Hitczenko (2016). We study random permutations of a given length from these classes, and in particular the number of occurrences of a fixed pattern in one of…

This paper gives a method for computing distributions associated with patterns in the state sequence of a hidden Markov model, conditional on observing all or part of the observation sequence. Probabilities are computed for very general…

We introduce the poset of mesh patterns, which generalises the permutation pattern poset. We fully classify the mesh patterns for which the interval [1^\emptyset,m] is non-pure, where 1^\emptyset is the unshaded singleton mesh pattern. We…

We review and extend previous results on coincidence of mesh patterns. We introduce the notion of a force on a permutation pattern and apply it to the coincidence classification of mesh patterns, completing the classification up to size…

In this paper, the recently introduced M&m sequences and associated mean-median map are studied. These sequences are built by adding new points to a set of real numbers by balancing the mean of the new set with the median of the original.…

A brief introduction is given to the topic of Smith normal forms of incidence matrices. A general discussion of techniques is illustrated by some classical examples. Some recent advances are described and the limits of our current…

Karlin and Altschul in their statistical analysis for multiple high-scoring segments in molecular sequences introduced a distribution function which gives the probability there are at least r distinct and consistently ordered segment pairs…

In this paper we introduce and study a class of tableaux which we call permutation tableaux; these tableaux are naturally in bijection with permutations, and they are a distinguished subset of the Le-diagrams of Alex Postnikov. The…

We prove the equidistribution of several multistatistics over some classes of permutations avoiding a $3$-length pattern. We deduce the equidistribution, on the one hand of inv and foze" statistics, and on the other hand that of maj and…

We introduce and study a new notion of patterns in Stirling and $k$-Stirling permutations, which we call block patterns. We prove a general result which allows us to compute generating functions for the occurrences of various block patterns…

A permutation $\sigma$ describing the relative orders of the first $n$ iterates of a point $x$ under a self-map $f$ of the interval $I=[0,1]$ is called an \emph{order pattern}. For fixed $f$ and $n$, measuring the points $x\in I$ (according…

We introduce the notion of crossings and nestings of a permutation. We compute the generating function of permutations with a fixed number of weak exceedances, crossings and nestings. We link alignments and permutation patterns to these…

Arc permutations, which were originally introduced in the study of triangulations and characters, have recently been shown to have interesting combinatorial properties. The first part of this paper continues their study by providing signed…

Recently, Babson and Steingrimsson (see \cite{BS}) introduced generalized permutations patterns that allow the requirement that two adjacent letters in a pattern must be adjacent in the permutation. In this paper we study the generating…

A simple permutation is one which maps no proper non-singleton interval onto an interval. We consider the enumeration of simple permutations from several aspects. Our results include a straightforward relationship between the ordinary…

The pattern $(k_1, k_2, \dots, k_\ell)$ is defined to have at least $k_1$ consecutive $1$'s followed by at least $k_2$ consecutive $2$'s, $\dots$, followed by at least $k_\ell$ consecutive $\ell$'s. By iteratively applying the method that…