Related papers: On Young tableau involutions and patterns in permu…
Classical pattern avoidance and occurrence are well studied in the symmetric group $\mathcal{S}_{n}$. In this paper, we provide explicit recurrence relations to the generating functions counting the number of classical pattern occurrence in…
We consider the following novel variation on a classical avoidance problem from combinatorics on words: instead of avoiding repetitions in all factors of a word, we avoid repetitions in all factors where each individual factor is considered…
We review how the monotone pattern compares to other patterns in terms of enumerative results on pattern avoiding permutations. We consider three natural definitions of pattern avoidance, give an overview of classic and recent formulas, and…
We study the involutions belonging to the class of 321 avoiding permutations. We calculate the algebraic generating functions of the set containing the involutions avoiding 321 and of some of its subsets. Precisely we determine the…
This article is an expository account of the theory of twisted commutative algebras, which simply put, can be thought of as a theory for handling commutative algebras with large groups of linear symmetries. Examples include the coordinate…
Permutations that avoid given patterns have been studied in great depth for their connections to other fields of mathematics, computer science, and biology. From a combinatorial perspective, permutation patterns have served as a unifying…
This paper continues the analysis of the pattern-avoiding sorting machines recently introduced by Cerbai, Claesson and Ferrari [CCF]. These devices consist of two stacks, through which a permutation is passed in order to sort it, where the…
In a previous paper, we showed that $3\bar{5}241$-avoiding permutations are counted by the unique sequence that starts with a 1 and shifts left under the self-composition transform. The proof uses a complicated bijection. Here we give a…
We initiate a systematic study of pattern avoidance in rectangulations. We give a formal definition of such patterns and investigate rectangulations that avoid $\top$-like patterns - the pattern $\top$ and its rotations. For every $L…
We complete the enumeration of cyclic permutations avoiding two patterns of length three each by providing explicit formulas for all but one of the pairs for which no such formulas were known. The pair $(123,231)$ proves to be the most…
We consider two partial orders on standard Young tableaux. The first one is induced from the weak right Bruhat order on symmetric group by Robinson-Schensted algorithm. The second one is induced from the order on Young diagrams by…
We determine a set of permutation patterns $q$ so that the number of permutations with $r$ occurrences of $q$ is asymptotically $n^r$ times the number of permutations avoiding $q$, partially settling a conjecture of Conway and Guttman. We…
In this paper, we find explicit formulas or generating functions for the cardinalities of the sets $S_n(T,\tau)$ of all permutations in $S_n$ that avoid a pattern $\tau\in S_k$ and a set $T$, $|T|\geq 2$, of patterns from $S_3$. The main…
Shallow permutations were defined in 1977 to be those that satisfy the lower bound of the Diaconis-Graham inequality. Recently, there has been renewed interest in these permutations. In particular, Berman and Tenner showed they satisfy…
This short course offers a new perspective on randomized algorithms for matrix computations. It explores the distinct ways in which probability can be used to design algorithms for numerical linear algebra. Each design template is…
In this paper, we study the Wilf-type equivalence relations among multiset permutations. We identify all multiset equivalences among pairs of patterns consisting of a pattern of length three and another pattern of length at most four. To…
Learning distributions over permutations is a fundamental problem in machine learning, with applications in ranking, combinatorial optimization, structured prediction, and data association. Existing methods rely on mixtures of parametric…
The number of inversion sequences avoiding two patterns $101$ and $102$ is known to be the same as the number of permutations avoiding three patterns $2341$, $2431$, and $3241$. This sequence also counts the number of Schr\"{o}der paths…
This research is concerned with evolution equations and their forward-backward discretizations. Our first contribution is an estimation for the distance between iterates of sequences generated by forward-backward schemes, useful in the…
In this paper, we study tree--like tableaux, combinatorial objects which exhibit a natural tree structure and are connected to the partially asymmetric simple exclusion process (PASEP). There was a conjecture made on the total number of…