Related papers: Boolean elements in the Bruhat order
We develop a unified framework for locating natural properties of algebraic and analytic structures within the Borel hierarchy. Objects are presented as quotients of a universal generator and definability is read directly from the quotient…
A permutation is so-called two stack sortable if it (i) avoids the (scattered) pattern 2-3-4-1, and (ii) contains a 3-2-4-1 pattern only as part of a 3-5-2-4-1 pattern. Here we show that the permutations on [n] satisfying condition (ii)…
We classify all equivalences between the indecomposable abelian categories which appear as blocks in BGG category O for reductive Lie algebras. Our classification implies that a block in category O only depends on the Bruhat order of the…
Identifying co-varying causal elements in very high dimensional feature space with internal structures, e.g., a space with as many as millions of linearly ordered features, as one typically encounters in problems such as whole genome…
We introduce a Lie bialgebra structure on the central extension of the Lie algebra of differential operators on the line and the circle (with scalar or matrix coefficients). This defines a Poisson--Lie structure on the dual group of…
In this paper we propose a notion of pattern avoidance in binary trees that generalizes the avoidance of contiguous tree patterns studied by Rowland and non-contiguous tree patterns studied by Dairyko, Pudwell, Tyner, and Wynn.…
In this paper a loophole in the SU(2) gauge anomaly is presented. It is shown that using several topological tools a theory can be designed that implements the quantization of a single Weyl doublet anomaly free while keeping the non-abelian…
We describe an algorithm which pattern embeds, in the sense of Woo-Yong, any Bruhat interval of a symmetric group into an interval whose extremes lie in the same right Kazhdan-Lusztig cell. This apparently harmless fact has applications in…
Basic results in combinatorial mathematics provide the foundation for a theory and calculus for reasoning about sequential behavior. A key concept of the theory is a generalization of Boolean implicant which deals with statements of the…
The block reversal of a word $w$, denoted by $\mathtt{BR}(w)$, is a generalization of the concept of the reversal of a word, obtained by concatenating the blocks of the word in the reverse order. We characterize non-binary and binary words…
We consider the sl(2) current algebra at level k=-4 when the sl(2) BRST operator is nilpotent. We formulate a spectral sequence converging to the cohomology of this BRST operator. At the second term of the spectral sequence, we observe an…
We indicate a way of distinguishing between structures, for which, we call two structures distinguishable. Roughly, being distinguishable means that they differ in the number of realizations each gives for some formula. Being…
The r-th order nonlinearity of a Boolean function is the minimum number of elements that have to be changed in its truth table to arrive at a Boolean function of degree at most r. It is shown that the (suitably normalised) r-th order…
A word $w=w_1w_2\cdots w_n$ is alternating if either $w_1<w_2>w_3<w_4>\cdots$ (when the word is up-down) or $w_1>w_2<w_3>w_4<\cdots$ (when the word is down-up). The study of alternating words avoiding classical permutation patterns was…
One can develop the basic structure theory of linear algebraic groups (the root system, Bruhat decomposition, etc.) in a way that bypasses several major steps in the standard development, including the self-normalizing property of Borel…
A matching of the set $[2n]=\{ 1,2,\ldots ,2n\}$ is a partition of $[2n]$ into blocks with two elements, i.e. a graph on $[2n]$ such that every vertex has degree one. Given two matchings $\sigma$ and $\tau$ , we say that $\sigma$ is a…
We continue the investigation of Boolean-like algebras of dimension n (nBA) having n constants e1,...,en, and an (n+1)-ary operation q (a "generalised if-then-else") that induces a decomposition of the algebra into n factors through the…
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…
We review the construction of Drinfeld-Sokolov type hierarchies and classical W-algebras in a Hamiltonian symmetry reduction framework. We describe the list of graded regular elements in the Heisenberg subalgebras of the nontwisted loop…
Call a reduced word $w$ multiplicity-bounding if and only if a finite group on which the word map of $w$ has a fiber of positive proportion $\rho$ can only contain each nonabelian finite simple group $S$ as a composition factor with…