Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2111.14800

The lattice of nil-Hecke algebras over real and complex reflection groups

Sutanay Bhattacharya·Apoorva Khare
View original source ↗Read source document ↗Export metadata ↓

Abstract

Associated to every complex reflection group, we construct a lattice of quotients of its braid monoid-algebra, which we term nil-Hecke algebras, and which are obtained by killing all braid words that are "sufficiently long", as well as some integer power of each generator. These include usual nil-Coxeter algebras, nil-Temperley-Lieb algebras, and their variants, and lead to symmetric semigroup module categories which necessarily cannot be monoidal. Motivated by classical work of Coxeter (1957) and the Broue-Malle-Rouquier freeness conjecture [Crelle 1998], and continuing beyond work of the second author [Trans. Amer. Math. Soc. 2018], we obtain a complete classification of the finite-dimensional nil-Hecke algebras for all complex reflection groups $W$. These comprise the usual nil-Coxeter algebras for $W$ of finite type, their "fully commutative" analogues for $W$ of FC-finite type, three exceptional algebras (of types $F_4,H_3,H_4$), and three exceptional series (of types $B_n$ and $A_n$, two of them novel). In particular, we find the first - and only two - finite-dimensional nil-Hecke algebras over discrete complex reflection groups; this breaks from the nil-Coxeter case (where no braid words are further killed, and) where Marin [J. Pure Appl. Alg. 2014] and Khare [Trans. Amer. Math. Soc. 2018] showed that such algebras do not exist. In addition to these algebras, and also algebraic connections (to PBW deformations and non-monoidal tensor categories), we further uncover combinatorial bases of algebras, both known (fully commutative elements) and novel ($\bar{12}$-avoiding signed permutations). Our classification draws from and brings together results of Popov [Comm. Math. Inst. Utrecht 1982], Stembridge [J. Alg. Combin. 1996, 1998], Malle [Transform. Groups} 1996], Postnikov via Gowravaram-Khovanova (2015), Hart [J. Group Th. 2017], and Khare [Trans. Amer. Math. Soc. 2018].

Explore related subjects

math.RAmath.COmath.GRmath.RT

Keep this discovery

BibTeXRIS

Sutanay Bhattacharya, Apoorva Khare. 2021-11-29. The lattice of nil-Hecke algebras over real and complex reflection groups. https://arxiv.org/abs/2111.14800

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Invariants of Nilpotent Lie Algebras via Geometry and Algebra with a Focus on Computation

We consider the problem of computing rational invariants of nilpotent Lie algebras. We compare two methods that are commonly used for this task: the method of integral curves and the Dixmier map. Given a derivation of a rational function field with polynomial coefficients, we formulate a condition under which the kernel can be recovered from a family of rational integral curves, and we show that triangular derivations satisfy this hypothesis. This yields an explicit description of the kernel as a purely transcendental extension and produces algebraically independent generators. We also show that, in the triangular case, the resulting generators agree with those obtained from the Dixmier map via a local slice. A careful analysis of the generating set obtained from this method leads to an algorithm for computing generators of the rational invariant field of a nilpotent Lie algebra. An implementation of the methods is available in the SageMath system.

math.RA↗
arXiv2026

Quasilinear multiplication in the real Cayley--Dickson tower

Direct evaluation of the defining product in the real Cayley--Dickson algebra $A_n$, of dimension $N=2^n$, has quadratic arithmetic complexity. This paper gives a uniform algorithm for multiplication using $O(N\log N)$ real arithmetic operations and $O(N)$ auxiliary storage. The algorithm reduces multiplication to the alternating product on the imaginary subspace, then evaluates that product by a two-call recursion over one fixed quadratic coefficient extension. For $n\ge1$, the resulting bilinear algorithm uses at most $(9n-15)2^{n-1}+10$ input-dependent real multiplications, and for $n\ge3$, the specified arithmetic schedule uses $(34n-83)2^{n-1}+50$ real operations in total. Under this counting convention, the quasilinear schedule uses fewer operations than direct multiplication for $N\ge16$ and than the uniform Cariow--Cariowa method for $N\ge32$. The algorithm is implemented in the MIT-licensed C11 library fastCD, with a NumPy-backed Python interface, and its results are checked against an independent implementation of the defining recursion. In single-core benchmarks against direct multiplication and the uniform Cariow--Cariowa method, the quasilinear implementation had the lowest mean time of the three at every tested dimension $N\ge32$, for both single and batched products, and was roughly $16$ times faster than direct multiplication at $N=1024$.

math.RA↗
arXiv2026

Graded classification of Leavitt path algebras in terms of strong shift equivalence

Given two finite essential adjacency matrices $A$ and $B$, Hazrat's graded classification conjectures posit that an order preserving $\mathbb{Z}[x,x^{-1}]$-module isomorphism of $K_0$ groups implies graded Morita equivalence of the Leavitt path algebras of $A$ and $B$, while the pointed version predicts a graded isomorphism of the Leavitt path algebras when the $K_0$ group isomorphism additionally preserves the class of the regular module. For any field $k$, we show that the Leavitt path algebras over $k$ of $A$ and $B$ are graded Morita equivalent if and only if $A$ and $B$ are strong shift equivalent. By appealing to counterexamples of Kim and Roush from symbolic dynamics, this shows that Hazrat's graded classification conjectures are false.

math.RA↗