Related papers: Algebraic and Affine Pattern Avoidance
Following a question of J. Cooper, we study the expected number of occurrences of a given permutation pattern $q$ in permutations that avoid another given pattern $r$. In some cases, we find the pattern that occurs least often, (resp. most…
We consider permutations sortable by $k$ passes through a deterministic pop stack. We show that for any $k\in\mathbb N$ the set is characterised by finitely many patterns, answering a question of Claesson and Gu{\dh}mundsson. Our…
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…
The study of patterns in permutations in a very active area of current research. Klazar defined and studied an analogous notion of pattern for set partitions. We continue this work, finding exact formulas for the number of set partitions…
The number of 123-avoiding permutation on $\{1,2,\ldots,n\}$ with a fixed leading terms is counted by the ballot numbers. The same holds for $132$-avoiding permutations. These results were proved by Miner and Pak using the…
We give a classification of noncommutative algebraic monoid structures on normal affine varieties such that the group of invertible elements of the monoid is connected, solvable, and has a one-dimensional unipotent radical. We describe the…
We examine two isomorphisms between affine Hecke algebras of type $A$ associated with parameters $q^{-1}$, $t^{-1}$ and $q$, $t$. One of them maps the non-symmetric Macdonald polynomials $E_{\eta}(x;q^{-1},t^{-1})$ onto $E_{\eta}(x;q,t)$,…
We introduce an explicit representation of the double affine Hecke algebra (of type $A_1$) at $q=1$ that gives rise to a periodic counterpart of a well-known Fourier transform associated with the affine Hecke algebra.
We prove that the multiplicities of certain maximal weights of $\mathfrak{g}(A^{(1)}_{n})$-modules are counted by pattern avoidance on words. This proves and generalizes a conjecture of Misra-Rebecca. We also prove similar phenomena in…
After fixing a canonical ordering (or labeling) of the elements of a finite poset, one can associate each linear extension of the poset with a permutation. Some recent papers consider specific families of posets and ask how many linear…
In this paper we examine the possibility of describing omitting types 1 and 2 by two at most ternary terms and any number of linear identities. All possible cases of systems of linear identities on two at most ternary terms are being…
We consider the set of affine permutations that avoid a fixed permutation pattern. Crites has given a simple characterization for when this set is infinite. We find the generating series for this set using the Coxeter length statistic and…
In this paper, we study affine commutative algebraic monoid structures on affine spaces over an arbitrary field of characteristic zero. We obtain full classification of such structures on $\mathbb{A}_K^2$ and $\mathbb{A}_K^3$ and describe…
In this paper, we study pattern avoidance in weak ascent sequences, giving some results for patterns of length 3. This is an analogous study to one given by Duncan and Steingr\'imsson (2011) for ascent sequences. More precisely, we provide…
We develop a general obstruction theory to the formality of algebraic structures over any commutative ground ring. It relies on the construction of Kaledin obstruction classes that faithfully detect the formality of differential graded…
This paper considers the enumeration of ternary trees (i.e. rooted ordered trees in which each vertex has 0 or 3 children) avoiding a contiguous ternary tree pattern. We begin by finding recurrence relations for several simple tree…
A matching of the set $[2n]=\{ 1,2,\ldots ,2n\}$ is a partition of $[2n]$ into blocks with two elements, i.e. a graph on $[2n]$ such that every vertex has degree one. Given two matchings $\sigma$ and $\tau$ , we say that $\sigma$ is a…
In this paper, we study pattern avoidances of generalized permutations and show that the number of all generalized permutations avoiding $\pi$ is independent of the choice of $\pi\in S_3$, which extends the classic results on permutations…
Multidimensional permutations, or $d$-permutations, are represented by their diagrams on $[n]^d$ such that there exists exactly one point per hyperplane $x_i$ that satisfies $x_i= j$ for $i \in [d]$ and $j \in [n]$. Bonichon and Morel…
We consider anti-unification for simply typed lambda terms in associative, commutative, and associative-commutative theories and develop a sound and complete algorithm which takes two lambda terms and computes their generalizations in the…