Dual Euclidean Artin Groups and the Failure of the Lattice Property

نویسندگان

  • JON MCCAMMOND
  • Noel Brady
چکیده

The irreducible euclidean Coxeter groups that naturally act geometrically on euclidean space are classified by the well-known extended Dynkin diagrams and these diagrams also encode the modified presentations that define the irreducible euclidean Artin groups. These Artin groups have remained mysterious with some exceptions until very recently. Craig Squier clarified the structure of the three examples with three generators more than twenty years ago and François Digne more recently proved that two of the infinite families can be understood by constructing a dual presentation for each of these groups and showing that it forms an infinite-type Garside structure. In this article I establish that none of the remaining dual presentations for irreducible euclidean Artin groups corrspond to Garside structures because their factorization posets fail to be lattices. These are the first known examples of dual Artin presentations that fail to form Garside structures. Nevertheless, the results presented here about the cause of this failure form the foundation for a subsequent article in which the structure of euclidean Artin groups is finally clarified. There is an irreducible Artin group of euclidean type for each of the extended Dynkin diagrams. In particular, there are four infinite families, Ãn, B̃n, C̃n and D̃n, known as the classical types plus five remaining exceptional examples Ẽ8, Ẽ7, Ẽ6, F̃4, and G̃2. Most of these groups have been poorly understood until very recently. Among the few known results are a clarification of the structure of the Artin groups of types Ã2, C̃2 and G̃2 by Craig Squier in [Squ87] and two papers by François Digne [Dig06, Dig12] proving that the Artin groups of type Ãn and C̃n have dual presentations that are Garside structures. Our main result is that Squier’s and Digne’s examples are the only ones that have dual presentations that are Garside structures. Date: November 12, 2014. 2010 Mathematics Subject Classification. 20F36.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Structure of Euclidean Artin Groups

The Coxeter groups that act geometrically on euclidean space have long been classified and presentations for the irreducible ones are encoded in the well-known extended Dynkin diagrams. The corresponding Artin groups are called euclidean Artin groups and, despite what one might naively expect, most of them have remained fundamentally mysterious for more than forty years. Recently, my coauthors ...

متن کامل

A Property of the Haar Measure of Some Special LCA Groups

The Euclidean group (Rn,+) where (n?N, plays a key role in harmonic analysis. If we consider the Lebesgue measure ()nd?xR as the Haar measure of this group then 12(2)()nd?x=d?RR. In this article we look for LCA groups K, whose Haar measures have a similar property. In fact we will show that for some LCA groups K with the Haar measure K?, there exists a constant such that 0KC>()(2)KKK?A=C?A for ...

متن کامل

Artin groups of euclidean type

Coxeter groups were introduced by Jacques Tits in the 1960s as a natural generalization of the groups generated by reflections which act geometrically (which means properly discontinuously cocompactly by isometries) on spheres and euclidean spaces. And ever since their introduction their basic structure has been reasonably well understood [BB05, Bou02, Dav08]. More precisely, every Coxeter grou...

متن کامل

Three-generator Artin Groups of Large Type Are Biautomatic

In this article we construct a piecewise Euclidean, non-positively curved 2-complex for the 3-generator Artin groups of large type. As a consequence we show that these groups are biautomatic. A slight modification of the proof shows that many other Artin groups are also biautomatic. The general question (whether all Artin groups are biautomatic) remains open.

متن کامل

Primal-dual path-following algorithms for circular programming

Circular programming problems are a new class of convex optimization problems that include second-order cone programming problems as a special case. Alizadeh and Goldfarb [Math. Program. Ser. A 95 (2003) 3-51] introduced primal-dual path-following algorithms for solving second-order cone programming problems. In this paper, we generalize their work by using the machinery of Euclidean Jordan alg...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014