Related papers: Boolean elements in the Bruhat order

Classical invariant theory of a complex reflection group $W$ highlights three beautiful structures: -- the $W$-invariant polynomials constitute a polynomial algebra, over which -- the $W$-invariant differential forms with polynomial…

A Souslin algebra is a complete Boolean algebra whose main features are ruled by a tight combination of an antichain condition with an infinite distributive law. The present article divides into two parts. In the first part a representation…

We analyze the structure of the Witt group W of braided fusion categories introduced in the previous paper arXiv:1009.2117v2. We define a "super" version of the categorical Witt group, namely, the group sW of slightly degenerate braided…

First, we prove the Kac-Wakimoto conjecture on modular invariance of characters of exceptional affine W-algebras. In fact more generally we prove modular invariance of characters of all lisse W-algebras obtained through Hamiltonian…

We study a non-commutative generalization of Stone duality that connects a class of inverse semigroups, called Boolean inverse $\wedge$-semigroups, with a class of topological groupoids, called Hausdorff Boolean groupoids. Much of the paper…

Binomial ideals are special polynomial ideals with many algorithmically and theoretically nice properties. We discuss the problem of deciding if a given polynomial ideal is binomial. While the methods are general, our main motivation and…

Let $ (\rho, V) $ be an irreducible representation of the symmetric group $ S_n$ (or the alternating group $ A_n$), and let $ g $ be a permutation on $n$ letters with each of its cycle lengths divides the length of its largest cycle. We…

For each regular cardinal k > w we show the consistent existence of a thin very tall superatomic Boolean algebra of width k.

This paper introduces a novel quantum algorithm that is able to classify a hierarchy of classes of imbalanced Boolean functions. The fundamental characteristic of imbalanced Boolean functions is that the proportion of elements in their…

We prove several new results on the structure of the subgroup generated by a small doubling subset of an ordered group, abelian or not. We obtain precise results generalizing Freiman's 3k-3 and 3k-2 theorems in the integers and several…

Boolean circuits form the foundational computational substrate of symmetric cryptography, yet the exploration of their architectural design space has remained largely confined to a handful of canonical paradigms - SPN, Feistel networks, and…

Given a pattern $p = s_1x_1s_2x_2\cdots s_{r-1}x_{r-1}s_r$ such that $x_1,x_2,\ldots,x_{r-1}\in\{x,\overset{{}_{\leftarrow}}{x}\}$, where $x$ is a variable and $\overset{{}_{\leftarrow}}{x}$ its reversal, and $s_1,s_2,\ldots,s_r$ are…

For $(W,S)$ an arbitrary Coxeter system and any $y \in W$, we investigate the condition that the Bruhat graph for the interval $[1,y]$ can be cubulated, meaning roughly that this graph can be spanned by a product of subintervals of…

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…

Let g be a simple Lie algebra, with fixed Borel subalgebra b and with Weyl group W. Expanding on previous work of Fan and Stembridge in the simply laced case, this note aims to study the fully commutative elements of W, and their…

In a set equipped with a binary operation, (S,*), a subset U is defined to be avoidable if there exists a partition {A,B} of S such that no element of U is the product of two distinct elements of A or of two distinct elements of B. For more…

For an element $w$ of the simply-laced Weyl group, Buan-Iyama-Reiten-Scott defined a subcategory $\mathcal{F}(w)$ of a module category over a preprojective algebra of Dynkin type. This paper aims at studying categorical properties of…

We classify all the symmetric integer bilinear forms of signature (2,1) whose isometry groups are generated up to finite index by reflections. There are 8595 of them up to scale, whose 374 distinct Weyl groups fall into 39 commensurability…

We study Fourier-sparse Boolean functions over general finite Abelian groups. A Boolean function $f : G \to \{-1,+1\}$ is $s$-sparse if it has at most $s$ non-zero Fourier coefficients. We introduce a general notion of granularity of…

In problems such as variable selection and graph estimation, models are characterized by Boolean logical structure such as presence or absence of a variable or an edge. Consequently, false positive error or false negative error can be…