Scholarlink

<p>We study divergence and thickness for general Coxeter groups <i>W</i>. We first characterise linear divergence, and show that if <i>W</i> has superlinear divergence then its divergence is at least quadratic. We then formulate a computable combinatorial invariant, hypergraph index, for arbitrary Coxeter systems (<i>W, S</i>). This generalises Levcovitz’s definition for the right-angled case. We prove that if (<i>W, S</i>) has finite hypergraph index <i>h</i>, then <i>W</i> is (strongly algebraically) thick of order at most <i>h</i>, hence has divergence bounded above by a polynomial of degree <i>h</i> + 1. We conjecture that these upper bounds on the order of thickness and divergence are in fact equalities, and we prove our conjecture for certain families of Coxeter groups. These families are obtained by a new construction which, given any right-angled Coxeter group, produces infinitely many examples of non-right-angled Coxeter systems with the same hypergraph index. Finally, we give an upper bound on the hypergraph index of any Coxeter system (<i>W, S</i>), and hence on the divergence of <i>W</i>, in terms of, unexpectedly, the topology of its associated Dynkin diagram.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Divergence, thickness and hypergraph index for general Coxeter groups

  • 期刊论文

  • 出版模式：

    开放获取

  • 发表日期：

    2026年3月26日

查看全文
  • Pallavi Dani,
  • Yusra Naqvi,
  • Ignat Soroko,
  • Anne Thomas

摘要

We study divergence and thickness for general Coxeter groups W. We first characterise linear divergence, and show that if W has superlinear divergence then its divergence is at least quadratic. We then formulate a computable combinatorial invariant, hypergraph index, for arbitrary Coxeter systems (W, S). This generalises Levcovitz’s definition for the right-angled case. We prove that if (W, S) has finite hypergraph index h, then W is (strongly algebraically) thick of order at most h, hence has divergence bounded above by a polynomial of degree h + 1. We conjecture that these upper bounds on the order of thickness and divergence are in fact equalities, and we prove our conjecture for certain families of Coxeter groups. These families are obtained by a new construction which, given any right-angled Coxeter group, produces infinitely many examples of non-right-angled Coxeter systems with the same hypergraph index. Finally, we give an upper bound on the hypergraph index of any Coxeter system (W, S), and hence on the divergence of W, in terms of, unexpectedly, the topology of its associated Dynkin diagram.