Related papers: Algebraic and Affine Pattern Avoidance

In this paper, we consider pattern avoidance in a subset of words on $\{1,1,2,2,\dots,n,n\}$ called reverse double lists. In particular a reverse double list is a word formed by concatenating a permutation with its reversal. We enumerate…

In this paper we introduce new affine algebraic varieties whose points correspond to associative algebras. We show that the algebras within a variety share many important homological properties. In particular, any two algebras in the same…

By affine arithmetic is meant the set of affine consequences of Peano arithmetic. This is a continuous theory which is studied in the framework of affine logic, a sublogic of continuous logic. Affine arithmetic is undecidable. Also, its…

We compare the (horizontal) trace of the affine Hecke category with the elliptic Hall algebra, thus obtaining an "affine" version of the construction of [14]. Explicitly, we show that the aforementioned trace is generated by the objects…

In 1983, Feingold and Frenkel discovered a relation between Siegel modular forms of genus two and a rank-three hyperbolic Kac--Moody algebra extending the affine Lie algebra of type $A_1$. It inspires a problem to explore more general…

Let $A$ be a simple algebra over a field $F$. Under a mild cardinality assumption on $F$, we determine the greatest possible dimension for an $F$-affine subspace of $A$ that is included in the group of units $A^\times$, and we describe the…

We review the construction of generalized affine Hecke algebras attached to Bernstein series of both smooth irreducible and enhanced $L$-parameters of $p$-adic reductive groups and apply it to the study of the Howe correspondence.

The fundamental bijection is a bijection $\theta:\mathcal{S}_n\to\mathcal{S}_n$ in which one uses the standard cycle form of one permutation to obtain another permutation in one-line form. In this paper, we enumerate the set of permutations…

A permutation $\pi$ is said to avoid a chain $(\sigma:\tau)$ of patterns if $\pi$ avoids $\sigma$ and $\pi^2$ avoids $\tau.$ In this paper, we define a notion of pattern avoidance for compositions of positive integers and use that idea to…

For each positive integer $k$, we consider five well-studied posets defined on the set of Dyck paths of semilength $k$. We prove that uniquely sorted permutations avoiding various patterns are equinumerous with intervals in these posets.…

The general aim of this article is to study the negation fragment of classical logic within the framework of contemporary (Abstract) Algebraic Logic. More precisely, we shall find the three classes of algebras that are canonically…

Mesh patterns are a generalization of classical permutation patterns that encompass classical, bivincular, Bruhat-restricted patterns, and some barred patterns. In this paper, we describe all mesh patterns whose avoidance is coincident with…

We study a rational version of the double affine Hecke algebra associated to the nonreduced affine root system of type $(C^\vee_n,C_n)$. A certain representation in terms of difference-reflection operators naturally leads to the definition…

We say that a word $w$ on a totally ordered alphabet avoids the word $v$ if there are no subsequences in $w$ order-equivalent to $v$. In this paper we suggest a new approach to the enumeration of words on at most $k$ letters avoiding a…

This paper provides a unified approach to results on representations of affine Hecke algebras, cyclotomic Hecke algebras, affine BMW algebras, cyclotomic BMW algebras, Markov traces, Jacobi-Trudi type identities, dual pairs (Zelevinsky),…

This thesis deals with three different aspects of the combinatorics of permutations. In the first two papers, two flavours of pattern avoiding permutations are examined; and in the third paper Young tableaux, which are closely related to…

In this paper we consider the enumeration of ordered set partitions avoiding a permutation pattern of length 2 or 3. We provide an exact enumeration for avoiding the permutation 12. We also give exact enumeration for ordered partitions with…

We define and study two new classes of algebras, called higher-level affine wreath product algebras and higher-level affine Frobenius Hecke algebras. They depend on a Frobenius superalgebra and are defined, respectively, as path algebras of…

We show that for any permutation $\pi$ there exists an integer $k_{\pi}$ such that every permutation avoiding $\pi$ as a pattern is a product of at most $k_{\pi}$ separable permutations. In other words, every strict class $\mathcal C$ of…

Circular permutations on {1,2,...,n} that avoid a given pattern correspond to ordinary (linear) permutations that end with n and avoid all cyclic rotations of the pattern. Three letter patterns are all but unavoidable in circular…