Related papers: Interval pattern avoidance for arbitrary root syst…
We construct new examples of expander Cayley graphs of finite groups, arising as congruence quotients of non-elementary subgroups of $SL_2 (\mathbb{F}_p [t])$ modulo certain square-free ideals. We describe some applications of our results…
Billey-Postnikov (BP) decompositions govern when Schubert varieties $X(w)$ decompose as bundles of smaller Schubert varieties. We further develop the theory of BP decompositions and show that, in finite type, they can be recognized by…
We study random uniform permutations in an important class of pattern-avoiding permutations: the separable permutations. We describe the asymptotics of the number of occurrences of any fixed given pattern in such a random permutation in…
The generalized wordlength pattern (GWLP) introduced by Xu and Wu (2001) for an arbitrary fractional factorial design allows one to extend the use of the minimum aberration criterion to such designs. Ai and Zhang (2004) defined the…
We give a pattern-avoidance characterization of $w \in S_n$ such that the Schubert polynomial $\mathfrak{S}_w$ is a standard elementary monomial. This characterization tells us which quantum Schubert polynomials are easiest to compute. We…
We show that cyclic permutations avoiding $321$ are precisely those permutations whose image under the fundamental bijection avoid a set of vincular patterns. We do this by using pattern functions and arrow patterns, in combination with the…
We present a generalization of the classical Schur modules of $GL(N)$ exhibiting the same interplay among algebra, geometry, and combinatorics. A generalized Young diagram $D$ is an arbitrary finite subset of $\NN \times \NN$. For each $D$,…
The research on pattern-avoidance has yielded so far limited knowledge on Wilf-ordering of permutations. The Stanley-Wilf limits sqrt[n](|S_n(tau)|) and further works suggest asymptotic ordering of layered versus monotone patterns. Yet,…
This paper analyzes Structural Vector Autoregressions (SVARs) where identification of structural parameters holds locally but not globally. In this case there exists a set of isolated structural parameter points that are observationally…
We obtain two combinatorial results: an equality of Weyl groups and an inequality of roots, in the setting of generalised Bott-Samelson resolutions of minuscule Schubert varieties. These results are used in the companion paper [BK19] to…
The Weil correspondence states that the datum of a Seiberg-Witten differential is equivalent to an algebraic group extension of the integrable system associated to the Seiberg-Witten geometry. Remarkably this group extension represents…
We discuss rather systematically the principle, implicit in earlier works, that for a "random" element in an arithmetic subgroup of a (split, say) reductive algebraic group over a number field, the splitting field of the characteristic…
Permutations that avoid given patterns are among the most classical objects in combinatorics and have strong connections to many fields of mathematics, computer science and biology. In this paper we study the scaling limits of a random…
The avoidability of binary patterns by binary cube-free words is investigated and the exact bound between unavoidable and avoidable patterns is found. All avoidable patterns are shown to be D0L-avoidable. For avoidable patterns, the growth…
We adapt the generalization of root systems of the second author and H. Yamane to the terminology of category theory. We introduce Cartan schemes, associated root systems and Weyl groupoids. After some preliminary general results, we…
We provide a method for gluing (small) resolutions of singularities of Schubert varieties \(X_w\). An explicit isomorphism of \(X_w\) with an (iterated) bundle is constructed when \(w\) has an (iterated) BP decomposition. Combined with the…
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…
Trigonometric invariants are defined for each Weyl group orbit on the root lattice. They are real and periodic on the coroot lattice. Their polynomial algebra is spanned by a basis which is calculated by means of an algorithm. The…
The usual Weyl calculus is intimately associated with the choice of the standard symplectic structure on $\mathbb{R}^{n}\oplus\mathbb{R}^{n}$. In this paper we will show that the replacement of this structure by an arbitrary symplectic…
We show that an element $w$ of a finite Weyl group $W$ is rationally smooth if and only if the hyperplane arrangement $I$ associated to the inversion set of $w$ is inductively free, and the product $(d_1+1) \cdots (d_l+1)$ of the…