首页 | 本学科首页   官方微博 | 高级检索  
     检索      


A pattern avoidance criterion for free inversion arrangements
Authors:William Slofstra
Institution:1.Institute for Quantum Computing,University of Waterloo,Waterloo,Canada
Abstract:We show that the hyperplane arrangement of a coconvex set in a finite root system is free if and only if it is free in corank 4. As a consequence, we show that the inversion arrangement of a Weyl group element w is free if and only if w avoids a finite list of root system patterns. As a key part of the proof, we use a recent theorem of Abe and Yoshinaga to show that if the root system does not contain any factors of type C or F, then Peterson translation of coconvex sets preserves freeness. This also allows us to give a Kostant–Shapiro–Steinberg rule for the coexponents of a free inversion arrangement in any type.
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号