相关论文: Pattern Avoidance and the Bruhat Order

In this paper we consider the rank generating function of a separable permutation $\pi$ in the weak Bruhat order on the two intervals $[\text{id}, \pi]$ and $[\pi, w_0]$, where $w_0 = n,(n-1),..., 1$. We show a surprising result that the…

We create a framework for studying symmetric chain decompositions of families of finite posets based on the geometry of polytopes. Our framework unifies almost all known results regarding symmetric chain decompositions of the Young posets…

We investigate the poset (P(X),\subset), where P(X) is the set of isomorphic suborders of a countable ultrahomogeneous partial order X. For X different from (resp. equal to) a countable antichain the order types of maximal chains in…

We extend the weak Bruhat order of a finite Coxeter group to the set of its coclasses, modulo parabolic standard subgroups. We use this order to describe associative algebra structures on the vector spaces spanned by the faces of…

We investigate the structure of ideals generated by binomials (polynomials with at most two terms) and the schemes and varieties associated to them. The class of binomial ideals contains many classical examples from algebraic geometry, and…

Ideals are one of the main topics of interest to the study of the order structure of an algebra. Due to their nice properties, ideals have an important role both in lattice theory and semigroup theory. Two natural concepts of ideal can be…

Principal symmetric ideals were recently introduced by Harada, Seceleanu, and Sega, with a focus on their homological properties. They are ideals generated by the orbit of a single polynomial under permutations of variables in a polynomial…

A floorplan is a tiling of a rectangle by rectangles. There are natural ways to order the elements---rectangles and segments---of a floorplan. Ackerman, Barequet and Pinter studied a pair of orders induced by neighborhood relations between…

We compute the primary decomposition of certain ideals generated by subsets of minors in a generic matrix or in a generic symmetric matrix, or subsets of Pfaffians in a generic skew-symmetric matrix. Specifically, the ideals we consider are…

Toric posets are cyclic analogues of finite posets. They can be viewed combinatorially as equivalence classes of acyclic orientations generated by converting sources into sinks, or geometrically as chambers of toric graphic hyperplane…

To a natural number $n$, a finite partially ordered set $P$ and a poset ideal ${\mathcal J}$ in the poset $Hom(P,[n])$ of isotonian maps from $P$ to the chain on $n$ elements, we associate two monomial ideals, the letterplace ideal…

Given finite posets $P$ and $Q$, we consider a specific ideal $L(P,Q)$, whose minimal monomial generators correspond to order-preserving maps $\phi:P\rightarrow Q$. We study algebraic invariants of those ideals. In particular, sharp lower…

Specht ideals are symmetric ideals in the polynomial ring generated by Specht polynomials associated with group representations. These ideals were previously studied for reflection groups of types $A$ and $B$, where their inclusion…

This article presents a methodology that automatically derives a combinatorial specification for a permutation class C, given its basis B of excluded patterns and the set of simple permutations in C, when these sets are both finite. This is…

The subject of pattern avoiding permutations has its roots in computer science, namely in the problem of sorting a permutation through a stack. A formula for the number of permutations of length n that can be sorted by passing it twice…

In the last decade a huge amount of articles has been published studying pattern avoidance on permutations. From the point of view of enumeration, typically one tries to count permutations avoiding certain patterns according to their…

We introduce two order relations on finite Coxeter groups which refine the absolute and the Bruhat order, and establish some of their main properties. In particular we study the restriction of these orders to noncrossing partitions and show…

A permutation $\pi$ contains a pattern $\sigma$ if and only if there is a subsequence in $\pi$ with its letters are in the same relative order as those in $\sigma$. Partially ordered patterns (POPs) provide a convenient way to denote…

Ascent sequences are sequences of nonnegative integers with restrictions on the size of each letter, depending on the number of ascents preceding it in the sequence. Ascent sequences have recently been related to (2+2)-free posets and…

Dokos et. al. studied the distribution of two statistics over permutations $\mathfrak{S}_n$ of $\{1,2,\dots, n\}$ that avoid one or more length three patterns. A permutation $\sigma\in\mathfrak{S}_n$ contains a pattern…