相关论文: Interval pattern avoidance for arbitrary root syst…

We construct an intriguing bijection between $021$-avoiding inversion sequences and $(2413,4213)$-avoiding permutations, which proves a sextuple equidistribution involving double Eulerian statistics. Two interesting applications of this…

We study pattern avoidance by combinatorial objects other than permutations, namely by ordered partitions of an integer and by permutations of a multiset. In the former case we determine the generating function explicitly, for integer…

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…

Schubert varieties in finite dimensional flag manifolds G/P are a well-studied family of projective varieties indexed by elements of the corresponding Weyl group W. In particular, there are many tests for smoothness and rational smoothness…

Pattern-avoiding permutations are a central object of study in both combinatorics and theoretical computer science. In this paper we design a data structure that can store any size-$n$ permutation $\tau$ that avoids an arbitrary (and…

Inspired by the work of Ulrich and Huneke-Ulrich, we describe a pattern to show that the ideals of certain opposite embedded Schubert varieties defined by this pattern arise by taking residual intersections of two geometrically linked…

In this note we present a characterisation of all unary and binary patterns that do not only contain variables, but also reversals of their instances. These types of variables were studied recently in either more general or particular…

We define a class L_{n, k} of permutations that generalizes alternating (up-down) permutations and give bijective proofs of certain pattern-avoidance results for this class. As a special case of our results, we give two bijections between…

Separable elements in Weyl groups are generalizations of the well-known class of separable permutations in symmetric groups. Gaetz and Gao showed that for any pair $(X,Y)$ of subsets of the symmetric group $\mathfrak{S}_n$, the…

The pattern avoidance problem seeks to construct a set with large fractal dimension that avoids a prescribed pattern, such as three term arithmetic progressions, or more general patterns, such as finding a set whose Cartesian product avoids…

We develop the theory of Weyl group multiple Dirichlet series for root systems of type C. For an arbitrary root system of rank r and a positive integer n, these are Dirichlet series in r complex variables with analytic continuation and…

A set partition avoids a pattern if no subdivision of that partition standardizes to the pattern. There exists a bijection between set partitions and restricted growth functions (RGFs) on which Wachs and White defined four statistics of…

We develop interval pattern avoidance and Mars-Springer ideals to study singularities of symmetric orbit closures in a flag variety. This paper focuses on the case of the Levi subgroup GL_p x GL_q acting on the classical flag variety. We…

We obtain new connections between permutation patterns and singularities of Schubert varieties, by giving a new characterization of Gorenstein varieties in terms of so called bivincular patterns. These are generalizations of classical…

We prove a sharp lower bound on the number of terms in an element of the reduced Gr\"obner basis of a Schubert determinantal ideal $I_w$ under the term order of [Knutson-Miller '05]. We give three applications. First, we give a…

A frequent topic in the study of pattern avoidance is identifying when two sets of patterns $\Pi, \Pi'$ are Wilf equivalent, that is, when $|\text{Av}_n(\Pi)| = |\text{Av}_n(\Pi')|$ for all $n$. In recent work of Dokos et al. the notion of…

We prove that an inclusion-exclusion inspired expression of Schubert polynomials of permutations that avoid the patterns 1432 and 1423 is nonnegative. Our theorem implies a partial affirmative answer to a recent conjecture of Yibo Gao about…

In this document we achieve exact and asymptotic enumeration of words, compositions over a finite group, and/or integer compositions characterized by local restrictions and, separately, subsequence pattern avoidance. We also count…

A theorem of Ryan and Wolper states that a type A Schubert variety is smooth if and only if it is an iterated fibre bundle of Grassmannians. We extend this theorem to arbitrary finite type, showing that a Schubert variety in a generalized…

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…