Dual braid monoids and Koszulity

Similar documents
Braid combinatorics, permutations, and noncrossing partitions Patrick Dehornoy. Laboratoire de Mathématiques Nicolas Oresme, Université de Caen

CATALAN NUMBERS AND EXCEPTIONAL SEQUENCES

Factorisations of the Garside element in the dual braid monoids

CHRISTOS A. ATHANASIADIS, THOMAS BRADY, AND COLUM WATT

De Finetti theorems for a Boolean analogue of easy quantum groups

Rational Catalan Combinatorics: Intro

A short introduction to arrangements of hyperplanes

Use subword reversing to constructing examples of ordered groups.

Counting chains in noncrossing partition lattices

A cyclic sieving phenomenon in Catalan Combinatorics

Catalan numbers, parking functions, and invariant theory

The Waring rank of the Vandermonde determinant

The structure of euclidean Artin groups

Quasisymmetric functions and Young diagrams

Quadraticity and Koszulity for Graded Twisted Tensor Products

Applications of semidefinite programming in Algebraic Combinatorics

arxiv: v3 [math.co] 23 May 2018

Noncrossing Parking Functions

PERVERSE SHEAVES ON A TRIANGULATED SPACE

The Orlik-Solomon Algebra and the Supersolvable Class of Arrangements

Sorting monoids on Coxeter groups

The absolute order on the hyperoctahedral group

arxiv: v1 [math.co] 17 Jan 2019

ARTIN GROUPS OF EUCLIDEAN TYPE

NONCROSSING PARTITIONS FOR THE GROUP D n

Higher Bruhat order on Weyl groups of Type B

Butson-Hadamard matrices in association schemes of class 6 on Galois rings of characteristic 4

Coxeter-Knuth Graphs and a signed Little Bijection

A Survey of Parking Functions

A Partial Order on the Symmetric Group and New K(?, 1)'s for the Braid Groups

Butson-Hadamard matrices in association schemes of class 6 on Galois rings of characteristic 4

Euler characteristic of the truncated order complex of generalized noncrossing partitions

Moduli spaces of sheaves and the boson-fermion correspondence

Finding parking when not commuting. Jon McCammond U.C. Santa Barbara

REPRESENTATION THEORY OF S n

SCHUR-WEYL DUALITY FOR U(n)

Schubert Varieties. P. Littelmann. May 21, 2012

Boij-Söderberg Theory

LEXLIKE SEQUENCES. Jeffrey Mermin. Abstract: We study sets of monomials that have the same Hilbert function growth as initial lexicographic segments.

Coxeter-Knuth Classes and a Signed Little Bijection

ON THE BRUHAT ORDER OF THE SYMMETRIC GROUP AND ITS SHELLABILITY

arxiv: v1 [math.co] 8 Dec 2013

Contents. Preface for the Instructor. Preface for the Student. xvii. Acknowledgments. 1 Vector Spaces 1 1.A R n and C n 2

A DIVISIBILITY RESULT ON COMBINATORICS OF GENERALIZED BRAIDS

Hidden Symmetries of the Root Systems

Clusters, Coxeter-sortable elements and noncrossing partitions

Torus Knots and q, t-catalan Numbers

Workshop on B-stable ideals and nilpotent orbits

PARKING FUNCTIONS. Richard P. Stanley Department of Mathematics M.I.T Cambridge, MA

arxiv:math/ v1 [math.co] 10 Nov 1998

Lecture 11: Clifford algebras

On the topology of matrix configuration spaces

A multiplicative deformation of the Möbius function for the poset of partitions of a multiset

PIERI S FORMULA FOR GENERALIZED SCHUR POLYNOMIALS

A diagrammatic representation of the Temperley Lieb algebra. Dana C. Ernst

Multi-parameter persistent homology: applications and algorithms

THREE LECTURES ON QUASIDETERMINANTS

Quantum Symmetries in Free Probability Theory. Roland Speicher Queen s University Kingston, Canada

Dual Temperley Lieb basis, Quantum Weingarten and a conjecture of Jones

Linear Algebra (Review) Volker Tresp 2018

Polynomials with palindromic and unimodal coefficients

Categories of noncrossing partitions

LOWER BOUNDARY HYPERPLANES OF THE CANONICAL LEFT CELLS IN THE AFFINE WEYL GROUP W a (Ãn 1) Jian-yi Shi

On the extremal Betti numbers of binomial edge ideals of block graphs

Finding parking when not commuting. Jon McCammond U.C. Santa Barbara

Topics in linear algebra

q xk y n k. , provided k < n. (This does not hold for k n.) Give a combinatorial proof of this recurrence by means of a bijective transformation.

SYMPLECTIC GEOMETRY: LECTURE 1

Confluence Algebras and Acyclicity of the Koszul Complex

Gorenstein rings through face rings of manifolds.

Algebra and topology of right-angled Artin groups

Boolean Inner-Product Spaces and Boolean Matrices

Symmetric Chain Decompositions and the Strong Sperner Property for Noncrossing Partition Lattices

The Full Pythagorean Theorem

Thus we get. ρj. Nρj i = δ D(i),j.

FROM PARKING FUNCTIONS TO GELFAND PAIRS

The Sorting Order on a Coxeter Group

Lecture 3: Tropicalizations of Cluster Algebras Examples David Speyer

The Yuri Manin Ring and Its B n -Analogue

MATH Linear Algebra

Generalized Alexander duality and applications. Osaka Journal of Mathematics. 38(2) P.469-P.485

LARGE SCHRÖDER PATHS BY TYPES AND SYMMETRIC FUNCTIONS

Coxeter Groups and Artin Groups

A Characterization of (3+1)-Free Posets

arxiv: v2 [math.co] 9 May 2012

arxiv: v4 [math.rt] 9 Jun 2017

Depth of some square free monomial ideals

SAMPLE TEX FILE ZAJJ DAUGHERTY

Lecture 1. (i,j) N 2 kx i y j, and this makes k[x, y]

Quotients of Poincaré Polynomials Evaluated at 1

Hecke Operators, Zeta Functions and the Satake map

On some conjectures on VOAs

Probability signatures of multistate systems made up of two-state components

Topological K-theory

SHELLABILITY AND HIGHER COHEN-MACAULAY CONNECTIVITY OF GENERALIZED CLUSTER COMPLEXES

The mapping class group of a genus two surface is linear

Catalan functions and k-schur positivity

A CATEGORIFICATION OF INTEGRAL SPECHT MODULES. 1. Introduction

Vanishing Ranges for the Cohomology of Finite Groups of Lie Type

arxiv: v1 [math.gt] 11 Oct 2013

Transcription:

Dual braid monoids and Koszulity Phillippe Nadeau (CNRS, Univ. Lyon 1) SLC 69, Strobl, September 10th 2012

Goal Investigate the combinatorics of a certain graded algebra associated to a Coxeter system, namely The Koszul dual of the algebra of the dual braid monoid

Goal Investigate the combinatorics of a certain graded algebra associated to a Coxeter system, namely The Koszul dual of the algebra of the dual braid monoid Most of the talk will be focused on type A for simplicity.... and also because I cannot yet prove the main results in all generality.

Usual noncrossing partitions. Let (W, S) the Coxeter system of type A n 1. So W = S n generated by S = {(i, i + 1)} for i = 1,..., n 1. Standard theory Length l S (w) = minimal k such that w = s i1 s ik. Bruhat order: w S w if l S (w) + l S (w 1 w ) = l S (w )

Usual noncrossing partitions. Let (W, S) the Coxeter system of type A n 1. So W = S n generated by S = {(i, i + 1)} for i = 1,..., n 1. Standard theory Length l S (w) = minimal k such that w = s i1 s ik. Bruhat order: w S w if l S (w) + l S (w 1 w ) = l S (w ) Dual presentation W with all transpositions T = {(i, j)} as generators. Absolute length l T (w) = minimal k with w = t i1 t ik. = n { cycles of w} Absolute order: w T w if l T (w) + l T (w 1 w ) = l T (w ).

Usual noncrossing partitions. Let (W, S) the Coxeter system of type A n 1. So W = S n generated by S = {(i, i + 1)} for i = 1,..., n 1. Standard theory Length l S (w) = minimal k such that w = s i1 s ik. Bruhat order: w S w if l S (w) + l S (w 1 w ) = l S (w ) Dual presentation W with all transpositions T = {(i, j)} as generators. Absolute length l T (w) = minimal k with w = t i1 t ik. = n { cycles of w} Absolute order: w T w if l T (w) + l T (w 1 w ) = l T (w ). NC(n) = NC(A n 1 ) = [id, (12 n)] T

NC(4) and its Möbius function (1234) (123)(4) (14)(23) (124)(3) (134)(2) (12)(34) (1)(234) (12)(3)(4) (13)(2)(4) (1)(23)(4) (14)(2)(3) (1)(24)(3) (1)(2)(34) (1)(2)(3)(4)

NC(4) and its Möbius function µ(w) = µ T (id, w) 5 2 1 2 2 1 2 1 1 1 1 1 1 1

NC(4) and its Möbius function µ(w) = µ T (id, w) 5 ( 1) n 1 C n 1 2 1 2 2 1 2 1 1 1 1 1 1 1

Braids Braids on n strings = Strings go down, 2 of them can cross in two ways. Braids (up to isotopy) form a group wrt concatenation.

Braids Braids on n strings = Strings go down, 2 of them can cross in two ways. Braids (up to isotopy) form a group wrt concatenation. Permutation of the endpoints S n as quotient group.

Braids Consider the monoid BKL n generated by the braids a ij in this braid group. (Usual generators of the braid group/monoid are a ii+1.) Braids on n strings = Strings go down, 2 of them can cross in two ways. Braids (up to isotopy) form a group wrt concatenation. Permutation of the endpoints S n as quotient group. i a ij j

Braids a ij a jk a jk a ik Consider the monoid BKL n generated by the braids a ij in this braid group. (Usual generators of the braid group/monoid are a ii+1.) Braids on n strings = Strings go down, 2 of them can cross in two ways. Braids (up to isotopy) form a group wrt concatenation. Permutation of the endpoints S n as quotient group. i a ij j They verify certain relations, eg a ij a jk = a jk a ik. One can characterize all such relations.

The Birman Ko Lee monoid Proposition [BKL 98] The monoid BKL n has generators a ij for 1 i < j n and relations: a ij a jk = a jk a ik = a ik a ij for i < j < k; a ij a kl = a kl a ij for i < j < k < l or i < k < l < j. The relations respect length of words length l(m) of an element in the quotient is well defined.

The Birman Ko Lee monoid Proposition [BKL 98] The monoid BKL n has generators a ij for 1 i < j n and relations: a ij a jk = a jk a ik = a ik a ij for i < j < k; a ij a kl = a kl a ij for i < j < k < l or i < k < l < j. The relations respect length of words length l(m) of an element in the quotient is well defined. Let P n (t) = Proposition For instance n 1 k=0 (n 1 + k)! (n 1 k)!k!(k + 1)! tk. m BKL n t l(m) = m BKL 4 t l(m) = 1 P n ( t). 1 1 6t + 10t 2 5t 3.

Proof of the evaluation of P n (t) In fact there is a well known relation between the length generating function and the Moebius function of the monoid ordered by divisibility (see [Cartier Foata]). P n (t) = µ(m) t l(m). m BKL n

Proof of the evaluation of P n (t) In fact there is a well known relation between the length generating function and the Moebius function of the monoid ordered by divisibility (see [Cartier Foata]). P n (t) = µ(m) t l(m). m BKL n But BKL n is a Garside monoid with Garside element C = a 12 a 23 a n 1n µ(m) = 0 if m does not divide C. Furthermore [1, C] left divisibility NC(n), and so P n (t) = w NC(S n ) µ(w) tl(w)

Proof of the evaluation of P n (t) In fact there is a well known relation between the length generating function and the Moebius function of the monoid ordered by divisibility (see [Cartier Foata]). P n (t) = µ(m) t l(m). m BKL n But BKL n is a Garside monoid with Garside element C = a 12 a 23 a n 1n µ(m) = 0 if m does not divide C. Furthermore [1, C] left divisibility NC(n), and so P n (t) = w NC(S n ) µ(w) tl(w) In [Albenque, N. 09] we computed this combinatorially.

Proof of the evaluation of P n (t) In fact there is a well known relation between the length generating function and the Moebius function of the monoid ordered by divisibility (see [Cartier Foata]). P n (t) = µ(m) t l(m). m BKL n But BKL n is a Garside monoid with Garside element C = a 12 a 23 a n 1n µ(m) = 0 if m does not divide C. Furthermore [1, C] left divisibility NC(n), and so P n (t) = w NC(S n ) µ(w) tl(w) In [Albenque, N. 09] we computed this combinatorially. And then I talked to Vic Reiner.

The monoid algebra We pass from the monoid to its k-algebra A: Definition The algebra A is defined by the generators a ij and relations I =<a ij a kl a kl a ij for i < j < k < l or i < k < l < j; a ij a jk a jk a ik ; a jk a ik a ik a ij for i < j < k.

The monoid algebra We pass from the monoid to its k-algebra A: Definition The algebra A is defined by the generators a ij and relations I =<a ij a kl a kl a ij for i < j < k < l or i < k < l < j; a ij a jk a jk a ik ; a jk a ik a ik a ij for i < j < k. Elements of BKL n form a basis of A, which has a grading A = k 0 A k, with Hilb A (t) = n 0 dim A k t k = 1 P n ( t) We associate to A another algebra A, the Koszul dual of A. This transformation Q Q is defined more generally for all quadratic algebras Q.

Koszul duality of quadratic algebras Definition A quadratic algebra Q is a graded algebra where the ideal of relations is generated by elements of degree 2. Q = k x 1,..., x m /Ideal(R) with R vector subspace of W 2 := { i,j λ ijx i x j }.

Koszul duality of quadratic algebras Definition A quadratic algebra Q is a graded algebra where the ideal of relations is generated by elements of degree 2. Q = k x 1,..., x m /Ideal(R) with R vector subspace of W 2 := { i,j λ ijx i x j }. Declare that (x i x j ) i,j is an orthonormal basis of W 2, and let R be the orthogonal of R. Then define Q = k x 1,..., x m /Ideal(R )

Koszul duality of quadratic algebras Definition A quadratic algebra Q is a graded algebra where the ideal of relations is generated by elements of degree 2. Q = k x 1,..., x m /Ideal(R) with R vector subspace of W 2 := { i,j λ ijx i x j }. Declare that (x i x j ) i,j is an orthonormal basis of W 2, and let R be the orthogonal of R. Then define Examples (a) R = span{x i x j x j x i, i < j} Symmetric algebra Q = k x 1,..., x m /Ideal(R ) R =span{x 2 i, x ix j + x j x i, i < j} Exterior algebra (b) R = span{x i x j, (i, j) I [m] 2 } R = span{x i x j, (i, j) [m] 2 I} Monomial ideals

Koszul duality for algebras We have A = k a ij /Ideal(R) with R = span{a ij a kl a kl a ij for i < j < k < l or i < k < l < j a ij a jk a jk a ik ; a jk a ik a ik a ij for i < j < k}.

Koszul duality for algebras We have A = k a ij /Ideal(R) with R = span{a ij a kl a kl a ij for i < j < k < l or i < k < l < j a ij a jk a jk a ik ; a jk a ik a ik a ij for i < j < k}. What is R in this case? It has a basis consisting of: (1) all a i,j a k,l which do not appear above; (2) a i,j a k,l + a k,l a i,j for (i, j), (k, l) noncrossing; (3) a ij a jk + a jk a ik + a ik a ij with i < j < k.

Koszul duality for algebras We have A = k a ij /Ideal(R) with R = span{a ij a kl a kl a ij for i < j < k < l or i < k < l < j a ij a jk a jk a ik ; a jk a ik a ik a ij for i < j < k}. What is R in this case? It has a basis consisting of: (1) all a i,j a k,l which do not appear above; (2) a i,j a k,l + a k,l a i,j for (i, j), (k, l) noncrossing; (3) a ij a jk + a jk a ik + a ik a ij with i < j < k. Theorem [Albenque, N. 09; N. 12] Hilb A (t) = P n (t)

Koszul duality for algebras We have A = k a ij /Ideal(R) with R = span{a ij a kl a kl a ij for i < j < k < l or i < k < l < j a ij a jk a jk a ik ; a jk a ik a ik a ij for i < j < k}. What is R in this case? It has a basis consisting of: (1) all a i,j a k,l which do not appear above; (2) a i,j a k,l + a k,l a i,j for (i, j), (k, l) noncrossing; (3) a ij a jk + a jk a ik + a ik a ij with i < j < k. Theorem [Albenque, N. 09; N. 12] Hilb A (t) = P n (t) Main question: why did I reprove one of my own results?

Koszul algebras In [Albenque, N. 09], we proved a bit more. We showed that A is a Koszul algebra, which can be defined as A graded k-algebra Q such that the Q-module k admits a minimal graded free resolution which is linear.

Koszul algebras In [Albenque, N. 09], we proved a bit more. We showed that A is a Koszul algebra, which can be defined as A graded k-algebra Q such that the Q-module k admits a minimal graded free resolution which is linear. Now Q Koszul Q numerically Koszul: Hilb Q (t) Hilb Q ( t) = 1 But this gives no insight on the structure of A.

Koszul algebras In [Albenque, N. 09], we proved a bit more. We showed that A is a Koszul algebra, which can be defined as A graded k-algebra Q such that the Q-module k admits a minimal graded free resolution which is linear. Now Q Koszul Q numerically Koszul: Hilb Q (t) Hilb Q ( t) = 1 But this gives no insight on the structure of A. New work: a nice basis of the algebra A. A = A [w] w N C(n) with an explicit basis of A [w] of cardinality µ(w).

Other Coxeter groups (W, S) a finite Coxeter system Reflections t T = w wsw 1 as new generators.

Other Coxeter groups (W, S) a finite Coxeter system Reflections t T = w wsw 1 as new generators. l T (w) = minimal k such that w = t 1 t k. w T w if l T (w) + l T (w 1 w ) = l T (w ) Fix a Coxeter element c, define NC(W ) := [1, c] T.

Other Coxeter groups (W, S) a finite Coxeter system Reflections t T = w wsw 1 as new generators. l T (w) = minimal k such that w = t 1 t k. w T w if l T (w) + l T (w 1 w ) = l T (w ) Fix a Coxeter element c, define NC(W ) := [1, c] T. [Bessis 00] Define the dual braid monoid as generated by a t with t T and relations a t a u = a u a utu whenever tu T c.

Other Coxeter groups (W, S) a finite Coxeter system Reflections t T = w wsw 1 as new generators. l T (w) = minimal k such that w = t 1 t k. w T w if l T (w) + l T (w 1 w ) = l T (w ) Fix a Coxeter element c, define NC(W ) := [1, c] T. [Bessis 00] Define the dual braid monoid as generated by a t with t T and relations a t a u = a u a utu whenever tu T c. Its algebra A(W ) is clearly quadratic, we can therefore consider the dual algebra A (W ) and explicit a presentation. Same questions for A(W ) instead of A = A(S n )

Questions for the future 1) Is A(W ) numerically Koszul, ie. Hilb A(W ) (t) Hilb A (W )( t) = 1? 2) Is A(W ) a Koszul algebra? 3) Is there a decomposition A (W ) = w NC(W ) A (W )[w] with A (W )[w] has a nice basis of size µ(w)?

Questions for the future 1) Is A(W ) numerically Koszul, ie. Hilb A(W ) (t) Hilb A (W )( t) = 1? 2) Is A(W ) a Koszul algebra? 3) Is there a decomposition A (W ) = w NC(W ) A (W )[w] with A (W )[w] has a nice basis of size µ(w)? Conjecture Yes.

Questions for the future 1) Is A(W ) numerically Koszul, ie. Hilb A(W ) (t) Hilb A (W )( t) = 1? 2) Is A(W ) a Koszul algebra? 3) Is there a decomposition A (W ) = w NC(W ) A (W )[w] with A (W )[w] has a nice basis of size µ(w)? Conjecture Yes. Known and To do 3) or 2) imply 1). 2) is true for type B [Albenque, N. 09]. Check 3) (or simply 1) for exceptional types by computer. Prove 3) by checking that a certain chain complex is exact (V. Féray). Use explicit EL-shelling of NC(W).