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

Size: px

Start display at page:

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

Lawrence Weaver
5 years ago
Views:

Braid combinatorics, permutations, and noncrossing partitions Patrick Dehornoy Laboratoire de Mathématiques Nicolas Oresme, Université de Caen A few combinatorial questions

1 Braid combinatorics, permutations, and noncrossing partitions Patrick Dehornoy Laboratoire de Mathématiques Nicolas Oresme, Université de Caen A few combinatorial questions involving braids and their Garside structures: the classical Garside structure, connected with permutations, the dual Garside structure, connected with noncrossing partitions.

2 Plan : 1. Braid combinatorics: Artin generators 2. Braid combinatorics: Garside generators 3. Braid combinatorics: Birman Ko Lee generators

3 Plan : 1. Braid combinatorics: Artin generators 2. Braid combinatorics: Garside generators 3. Braid combinatorics: Birman Ko Lee generators

4 Braids a 4-strand braid diagram = 2D-projection of a 3D-figure: isotopy = move the strands but keep the ends fixed: isotopic to a braid := an isotopy class represented by 2D-diagram, but different 2D-diagrams may give rise to the same braid.

5 Braid groups Product of two braids: := Then well-defined (with respect to isotopy), associative, admits a unit: = and inverses: isotopic to braid = braid braid d For each n, the group B n of n-strand braids (E. Artin, 1925).

6 Artin presentation of B n Artin generators of B n : = σ 1 σ 2 σ 3 σ 1 1 Theorem (Artin). The group B n is generated by σ 1,...,σ n 1, { σi σ j σ i = σ j σ i σ j for i j = 1, subject to σ i σ j = σ j σ i for i j 2. σ 1 σ 2 σ 1 σ 2 σ 1 σ 2 σ 1 σ 3 σ 3 σ 1

7 Countings For n 2, the group B n is infinite consider finite subsets. B + n := monoid of classes of n-strand positive diagrams all crossings have a positive orientation Theorem (Garside, 1967). As a monoid, B + n admits the presentation... (as B n ); it is cancellative, and admits lcms and gcds. Hence: Equivalent positive braid words have the same length, every positive braid β has a well-defined length β Art w.r.t. Artin generators σ i. Question: Determine N Art+ n,l := #{β B+ n β Art = l} and/or the associated generating series.

8 Generating series Theorem (Deligne, 1972). For every n, the g.f. of N Art+ n,l is rational. Proof: For β in B + n, define M(β):= {βγ γ B + n } = right-multiples of β. Then B + n \ {1} = i M(σ i ), and M(σ i ) M(σ j ) = M(lcm(σ i, σ j )). By inclusion exclusion, get induction N Art+ n,l = c 1N Art+ n,l c KN Art+ n,l K. More precisely: for every n, the generating series of N Art+ n,l is the inverse of a polynomial P n (t). Proposition (Bronfman, 2001). Starting from P 0 (t) = P 1 (t) = 1, one has n P n (t) = ( 1) i+1 t i(i 1) 2 P n i (t). i=1

9 Geodesic length Same question for B n instead of B + n ; all representatives dont have the same length define β Art := the minimal length of a word representing β. Question: Determine N Art n,l := #{β B n β Art = l} and/or determine the associated generating series. Proposition (Mairesse Matheus, 2005). The generating series of N Art 3,l is 2t(2 2t t 1+ 2 (1 t)(1 2t)(1 t t 2 ). Then open, even N Art 4,l : (Mairesse) no rational fraction with degree 13 denominator. Explanation : Artin generators are not the right generators... change generators

10 Plan : 1. Braid combinatorics: Artin generators 2. Braid combinatorics: Garside generators 3. Braid combinatorics: Birman Ko Lee generators

11 Garside structure Definition: A Garside structure in a group G is a subset S of G s.t. every element g of G admits an S-normal decomposition, meaning g = s 1 p s 1 1 t 1 t q with s 1,...,s p, t 1,...,t q in S and, using f left-divides g for f 1 g lies in the submonoid Ŝ of G generated by S, every element of S left-dividing s i s i+1 left-divides s i, every element of S left-dividing t i t i+1 left-divides t i, 1 is the only element of S left-dividing s 1 and t 1. When it exists, an S-normal decomposition is (essentially) unique, and geodesic. Every group is a Garside structure in itself: interesting only when S is small. Normality is local: if S is finite, S-normal sequences make a rational language automatic structure, solution of the word and conjugacy problems,... counting problems: # elements with S-normal decompositions of length l. Definition: A Garside structure S in a group G is bounded if there exists an element ( Garside element ) such that S consists of the left-divisors of in Ŝ. In this case: the S-normal decomposition of g in Ŝ is recursively given by s 1=gcd(g, ); (s, t) is S-normal iff 1 is the only element of S left-dividing s 1 and t.

12 Back to braids Permutation associated with a braid: (4,2,1,3) 4 1 A surjective homomorphism π n : B n S n. Lemma: Call a braid simple if it can be represented by a positive diagram in which any two strands cross at most once. Then, for every permutation f in S n, there exists exactly one simple braid σ f satisfying π n (σ f )=f. 3 4 (4,2,1,3) : σ 1 σ 2 σ 1 σ The family S n of all simple n-strand braids is a copy of S n.

13 Garside structure 1 Theorem (Garside, Adjan, Morton ElRifai, Thurston). For each n, the family S n is a Garside structure in B n, bounded by σ (n,...,1) ; the associated monoid is B + n. Garside s fundamental braid n := σ (n,...,1), whence n = n 1 σ n 1...σ 2 σ 1 : 1 = 1, 2 = σ 1, 2 = σ 1 σ 2 σ 1, etc. A new family of generators: the Garside generators σ f a very redundant family: n! elements, whereas only n 1 Artin generators; many expressions for a braid, but a distinguished one: the S n -normal one; in terms of Garside generators, the group B n and the monoid B + n are presented by the relations σ f σ g = σ fg with l(f) + l(g) = l(fg); length of f:= # of inversions in f the poset (S n, ) is isomorphic to (S n, ). left-divisibility in B + n weak order in S n

14 Back to counting Question: Determine N Gar+ n,l := #{β B + n β Gar = l} and/or its generating series, where β Gar := length of the S n -normal decomposition. (and idem with N Gar n,l := #{β B n β Gar = l}.) An easy question (contrary to the case of Artin generators): by construction, N Gar+ n,l = # length l normal sequences in B + n, and normality is a local property: a sequence is S n -normal iff every length 2 subsequence is S n -normal. Proposition. Let M n be the { n! n! matrix indexed by simple braids (i.e., by 1 if (s, t) is normal, permutations) s.t. (M n ) s,t = 0 otherwise. For each n, the generating series of N Gar+ n,l Then N Gar+ n,l is the idth entry in (1,...,1) M l n. is rational.

15 Reducing the size of the matrix Lemma 1: For f, g in S n, the pair (σ f, σ g ) is normal iff Desc(f) Desc(g 1 ). descents of f := {k f(k) > f(k + 1)} Hence, if Desc(g 1 ) = Desc(g 1 ), the columns of g and g in M n are equal; columns can be gathered: replace M n (size n!) with M n (size 2 n 1 ). Lemma 2: The # of permutations f satisfying Desc(f) I and Desc(f 1 ) J is the # of k l matrices with entries in N s.t. the sum of the ith row is p i and the sum of the jth column is q j, with (p 1,...,p k ) the composition of I and (q 1,...,q l ) that of J. sequence of sizes of the blocks of adjacent elements set of sizes of the blocks of adjacent elements Hence (M n ) I,J only depends on the partition of J; can gather columns again: replace M n (size 2 n 1 ) with M n (size p(n)). Remarks: Going from M n to M n reducing the size of the automatic structure of B n from n! to p(n) ( 1 4n 3 eπ 2n/3 ) (Hohlweg) That (M n ) I,J only depends on the partition of J is (another) form of Solomon s result about the descent algebra.

16 Eigenvalues The growth rate of N Gar+ n,l is connected with the eigenvalues of M n, hence of M n: CharPol(M 1 ) = x 1 CharPol(M 2 ) = CharPol(M 1 ) (x 1) CharPol(M 3 ) = CharPol(M 2 ) (x 2) CharPol(M 4 ) = CharPol(M 3 ) (x2 6x + 3) CharPol(M 5 ) = CharPol(M 4 ) (x2 20x + 24),... Theorem (Hivert Novelli Thibon). The characteristic polynomial of M n divides that of M n+1. Proof: Interpret M n in terms of quasi-symmetric functions in the sense of Malvenuto Reutenauer, and determine the LU-decomposition. Spectral radius: n ρ(m n ) ρ(m n )/(nρ(m n 1 )) What is the asymptotic behaviour?

17 Other countings So far: N Gar+ n,l with n fixed and l varying; for l fixed and n varying, different induction schemes (starting with N Gar+ n,1 = n!). n 1 Proposition. N Gar+ n,2 = ( ) n ( 1) n+i+1 2 N Gar+ i i,2, 0 whence (Carlitz Scoville Vaughan) 1 + n N Gar+ n,2 z n (n!) 2 = 1 J 0 ( z). Put N Gar+ n,l (s) := # normal sequences in B+ n finishing with s: Bessel function J 0 N Gar+ n,3 ( n 1) = 2 n 1, N Gar+ n,3 ( n 2) 2 3 n, N Gar+ n,4 ( n 1) = n!e 1... Conclusion: Braid combinatorics w.r.t. Garside generators leads to new, interesting (?) questions about permutation combinatorics.

18 Motivation Braid groups are countable, braids can be encoded in integers, and most of their (algebraic) properties can be proved in the logical framework of Peano arithmetic, and even of weaker subsystems, like IΣ 1 where induction is limited to formulas involving at most one unbounded quantifier. Braids admit an ordering, s.t. (B + n, ) is a well-ordering of type ω ωn 2 ; one can construct long (finite) descending sequences of positive braids; but this cannot be done in IΣ 1 (reminiscent of Goodstein s sequences); where is the transition from IΣ 1 -provability to IΣ 1 -unprovability? Definition: For F : N N, let WO F be the statement: For every l, there exists m s.t. every strictly decreasing sequence (β t ) t 0 in B + 3 satisfying β t Gar l + F(t) for each t has length at most m. WO 0 trivially true (finite #), and WO F provable for every F using König s Lemma. Theorem (Carlucci, D., Weiermann). For r ω, let F r (x) := Ack 1 r (x) x. Then WO Fr is IΣ 1 -provable for finite r, and IΣ 1 -unprovable for r = ω. Proof: Evaluate #{β B + 3 β Gar l & β < k 3 }.

19 Plan : 1. Braid combinatorics: Artin generators 2. Braid combinatorics: Garside generators 3. Braid combinatorics: Birman Ko Lee generators

20 An alternative Garside structure Another family of generators for B n : the Birman Ko Lee generators a i,j := σ j 1 σ i+1 σ i σ 1 i+1 σ 1 j 1 for 1 i < j n. j i The dual braid monoid: the submonoid B + n of B n generated by the elements a i,j. Proposition (Birman Ko Lee, 1997). Let δ n = σ n 1 σ 2 σ 1. Then the family of all divisors of δ n in B + n is a Garside structure in B n; it is bounded by δ n.

21 Chords Chord representation of the Birman Ko Lee generators: n 1 n 2 a i,j n 1 2 i 2 1 j Lemma: In terms of the BKL generators, B n is presented by the relations = for disjoint chords, = = for adjacent chords enumerated in clockwise order. Hence: For P a p-gon, can define a P to be the product of the a i,j corresponding to p 1 adjacent edges of P in clockwise order; idem for an union of disjoint polygons. a 2,8 a 3,5 a 5,

22 Noncrossing partitions Proposition (Bessis Digne Michel). The elements of the Garside structure S n (divisors of δ n in B + n ) are the elements a P with P a union of disjoint polygons with n vertices, hence in 1-1 correspondence with the Cat n noncrossing partitions of {1,...,n}. notation a λ for λ a noncrossing partition Examples: {{1}, {2,8}, {3,5,6}, {4}, {7}} 7 3 a 2,8 a 3,5 a 5, {{1,2,3,4,5,6,7,8}} 7 3 δ 8 = a 12 a 23 a 78 6 Remark: The permutation of the braid a λ is the permutation associated with λ (product of cycles of the parts) 5 4

23 Countings Question: Determine N BKL+ n,l := #{β B + n β BKL = l} and its generating series, where β BKL := length of the S n-normal decomposition of β. For instance: N BKL+ n,1 = #S n = Cat n. Exactly similar to the classical case: local property, etc. Proposition. Let { M n be the Cat n Cat n matrix indexed by noncrossing partitions s.t. (M 1 if (a n) λ,µ = λ, a µ ) is S n-normal, Then N BKL+ n,l is the 1 n th entry in 0 otherwise. (1,...,1) M n l. For every n, the generating series of N BKL+ n,l is rational. the partition with n parts

24 The normality relation When is (a λ,a µ ) S n -normal? Recall: If a Garside structure S is bounded by, then (s, t) is S-normal iff s and t have no nontrivial common left-divisor. the element s s.t. ss = When does a i,j left-divide a λ? What is the partition of a λ in terms of that of a λ? Lemma (Bessis Digne Michel): The element a i,j left- (or right-) divides a λ iff the chord (i, j) is included in the polygon of λ. Lemma (Bessis Digne Michel): The partition of a λ is the Kreweras complement λ of λ a λ a λ = a λ a λ = φ n (a λ)

25 Length 2 normal sequences Proposition (Biane). The generating series G(z) of N BKL+ n,2 is derived from the generating series F(z) of Cat 2 n by G(z) = F(zG(z)). (#) Proof: Let G(z) = n NBKL+ n,2 zn, with N BKL+ n,2 = # length 2 normal sequences = # positive entries in M n. Recall: (M n) λ,µ = 1 iff λ µ = 1 n. As λ λ is a bijection, N BKL+ n,2 = # positive entries in M n s.t. (M n) λ,µ = 1 iff λ µ = 1 n. The numbers N BKL+ n,2 are the free cumulants for pairs of noncrossing partitions. Hence connected to the g.f. F of pairs of noncrossing partitions under (#).

26 Questions First values: d N BKL+ 2,d N BKL+ 3,d N BKL+ 4,d N BKL+ 5,d N BKL+ 6,d Questions about columns (OK for d 2): What is the behaviour of N BKL+ n,3, etc.? Questions about rows (OK for n 3): Can one reduce the size of M n? Is M n always invertible? What is the asymptotic behaviour of the spectral radius of M n? n tr(m n ) det(m n) ρ(m n )

27 A few more remarks Whenever a group admits a finite Garside structure, there is a finite state automaton, whence an incidence matrix. The associated combinatorics is likely to be interesting if the Garside structure is connected with combinatorially meaningful objects: permutations (Garside case), noncrossing partitions (Birman Ko Lee case), etc. The family of group(oid)s that admit an interesting Garside structure is large and so far not well understood: for instance (Bessis, 2006) free groups do; also: exotic Garside structures on braid groups; and exotic non-garside normal forms with local characterizations; most results involving braids extend to Artin Tits groups of spherical type (i.e., associated with a finite Coxeter group); many potential combinatorial problems Specific case of dual braid monoids and noncrossing partitions: (almost) nothing known so far, but the analogy B + n /B+ n suggests that combinatorics could be interesting (?).

28 References J.Mairesse & F. Matheus, Growth series for Artin groups of dihedral type Internat. J. Algebra Comput. 16 (2006) P. Dehornoy, Combinatorics of normal sequences of braids, J. Combinatorial Th. Series A, 114 (2007) F. Hivert, J.-C. Novelli, J.-Y. Thibon, Sur une conjecture de Dehornoy Comptes Rendus Math. 346 (2008) P. Dehornoy, with F. Digne, E. Godelle, D. Krammer, J. Michel, Foundations of Garside Theory, EMS Tracts in Mathematics (2015), garside/ L. Carlucci, P. Dehornoy, A. Weiermann, Unprovability statements involving braids; Proc. London Math. Soc., 102 (2011) D. Bessis, F. Digne, J. Michel, Springer theory in braid groups and the Birman-Ko-Lee monoid; Pacific J. Math. 205 (2002) dehornoy

Use subword reversing to constructing examples of ordered groups.

Subword Reversing and Ordered Groups Patrick Dehornoy Laboratoire de Mathématiques Nicolas Oresme Université de Caen Use subword reversing to constructing examples of ordered groups. Abstract Subword Reversing