Related papers: Boolean elements in the Bruhat order
In a recent paper, the authors have shown that the secondary reduction of W-algebras provides a natural framework for the linearization of W-algebras. In particular, it allows in a very simple way the calculation of the linear algebra…
We construct the classical W-algebras for some non-abelian Toda systems associated with the Lie groups GL(2n,R) and Sp(n,R). We start with the set of characteristic integrals and find the Poisson brackets for the corresponding Hamiltonian…
The W-set of an element of a weak order poset is useful in the cohomological study of the closures of spherical subgroups in generalized flag varieties. We explicitly describe in a purely combinatorial manner the W-sets of the weak order…
Ascent sequences form a central class of combinatorial objects, as they are in bijection with several important families such as (2+2)-free posets, Stoimenow matchings, and other Fishburn objects, and are enumerated by the Fishburn numbers.…
This note presents a procedure to determine the reduction of the irreducible and the induced characters of the symmetric group in terms of the irreducible and induced characters of the hyperoctahedral group Key Words: Symmetric Group,…
A permutation is called smooth if the corresponding Schubert variety is smooth. Gilboa and Lapid prove that in the symmetric group, multiplying the reflections below a smooth element $w$ in Bruhat order in a compatible order yields back the…
We show the first known example for a pattern $q$ for which $\lim_{n\to \infty} \sqrt[n]{S_n(q)}$ is not an integer. We find the exact value of the limit and show that it is irrational. Then we generalize our results to an infinite sequence…
We find a strong separation between two natural families of simple rank one theories in Keisler's order: the theories $T_\mathfrak{m}$ reflecting graph sequences, which witness that Keisler's order has the maximum number of classes, and the…
We give closed combinatorial product formulas for Kazhdan-Lusztig poynomials and their parabolic analogue of type q in the case of boolean elements, introduced in [M. Marietti, Boolean elements in Kazhdan-Lusztig theory, J. Algebra 295…
We study the decomposition of a generic element $g \in G$ of a connected reductive complex algebraic group $G$ in the form $g = N(g) B(g) \bar{u} N(g)^{-1}$ where $N: G \dashrightarrow \mathcal{N}_-$ and $B : G \dashrightarrow…
Let A be an alphabet and W be a set of words in the free monoid A*. Let S(W) denote the Rees quotient over the ideal of A* consisting of all words that are not subwords of words in W. We call a set of words W finitely based if the monoid…
We study generating functions for the number of involutions in $S_n$ avoiding (or containing once) 132, and avoiding (or containing once) an arbitrary permutation $\tau$ on $k$ letters. In several interesting cases the generating function…
Let $G$ be a connected reductive group over an algebraically closed field. Let $B$ be a Borel subgroup of $G$ and $W$ be the associated Weyl group. We show that for any $w \in W$ that is not contained in any standard parabolic subgroup of…
The boolean elements of a Coxeter group have been characterized and shown to possess many interesting properties and applications. Here we introduce "prism permutations," a generalization of those elements, characterizing the prism…
We construct an infinite word $w$ over the $5$-letter alphabet such that for every factor $f$ of $w$ of length at least two, there exists a cyclic permutation of $f$ that is not a factor of $w$. In other words, $w$ does not contain a…
Given a finite group $G$, we say that $G$ has weak normal covering number $\gamma_w(G)$ if $\gamma_w(G)$ is the smallest integer with $G$ admitting proper subgroups $H_1,\ldots,H_{\gamma_w(G)}$ such that each element of $G$ has a conjugate…
Starting with the zero-square "zeon algebra", the regular representation gives rise to a Boolean lattice representation of sl(2). We detail the su(2) content of the Boolean lattice, providing the irreducible representations carried by the…
In combinatorics on words, a word $w$ over an alphabet $\Sigma$ is said to avoid a pattern $p$ over an alphabet $\Delta$ if there is no factor $f$ of $w$ such that $f=h(p)$ where $h:\Delta^*\to\Sigma^*$ is a non-erasing morphism. A pattern…
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…
Pattern matching is a popular feature in functional, imperative and object-oriented programming languages. Language designers should therefore invest effort in a good design for pattern matching. Most languages choose a first-match…