English
Related papers

Related papers: On inductively free reflection arrangements

200 papers

Suppose that W is a finite, unitary, reflection group acting on the complex vector space V. Let A = A(W) be the associated hyperplane arrangement of W. Terao has shown that each such reflection arrangement A is free. Let L(A) be the…

Group Theory · Mathematics 2012-11-06 Torsten Hoge , Gerhard Roehrle

The reflection arrangement of a Coxeter group is a well known instance of a free hyperplane arrangement. In 2002, Terao showed that equipped with a constant multiplicity each such reflection arrangement gives rise to a free…

Combinatorics · Mathematics 2016-01-19 Henning Conrad , Gerhard Roehrle

Let W be a finite complex reflection group acting on the complex vector space V and let A(W) = (A(W), V) be the associated reflection arrangement. In an earlier paper by the last two authros, we classified all inductively free reflection…

Group Theory · Mathematics 2014-07-22 Nils Amend , Torsten Hoge , Gerhard Roehrle

Let A = (A,V) be a complex hyperplane arrangement and let L(A) denote its intersection lattice. The arrangement A is called supersolvable, provided its lattice L(A) is supersolvable, a notion due to Stanley. Jambu and Terao showed that…

Group Theory · Mathematics 2013-05-03 Torsten Hoge , Gerhard Roehrle

Using the classification of finite Weyl groupoids we prove that crystallographic arrangements, a large subclass of the class of simplicial arrangements which was recently defined, are hereditarily inductively free. In particular, all…

Combinatorics · Mathematics 2016-12-06 Mohamed Barakat , Michael Cuntz

Let $\mathcal{A} = \mathcal{A}(W)$ be the reflection arrangement of the finite complex reflection group $W$. By Terao's famous theorem, the arrangement $\mathcal{A}$ is free. In this paper we classify all reflection arrangements which…

Group Theory · Mathematics 2020-03-05 Paul Mücksch

Let $A$ be a free hyperplane arrangement. In 1989, Ziegler showed that the restriction $A''$ of $A$ to any hyperplane endowed with the natural multiplicity is then a free multiarrangement. We initiate a study of the stronger freeness…

Combinatorics · Mathematics 2018-07-17 Torsten Hoge , Gerhard Roehrle

In 2002, Terao showed that every reflection multi-arrangement of a real reflection group with constant multiplicity is free by providing a basis of the module of derivations. We first generalize Terao's result to multi-arrangements stemming…

Group Theory · Mathematics 2019-04-18 Torsten Hoge , Toshiyuki Mano , Gerhard Roehrle , Christian Stump

Let $\mathscr A$ be a Coxeter arrangement of rank $\ell$. In 1987 Orlik, Solomon and Terao conjectured that for every $1\leq d \leq \ell$, the first $d$ exponents of $\mathscr A$ -- when listed in increasing order -- are realized as the…

Group Theory · Mathematics 2022-02-21 Paul Mücksch , Gerhard Roehrle

Let $\mathcal A$ be a free hyperplane arrangement. In 1989, Ziegler showed that the restriction $\mathcal A"$ of $\mathcal A$ to any hyperplane endowed with the natural multiplicity $\kappa$ is then a free multiarrangement. In 2024, the…

Combinatorics · Mathematics 2025-02-14 Torsten Hoge , Gerhard Roehrle , Sven Wiesner

We study some aspects of divisionally free arrangements which were recently introduced by Abe. Crucially, Terao's conjecture on the combinatorial nature of freeness holds within this class. We show that while it is compatible with products,…

Combinatorics · Mathematics 2017-09-04 Gerhard Roehrle

Extending earlier work by Sommers and Tymoczko, in 2016 Abe, Barakat, Cuntz, Hoge, and Terao established that each arrangement of ideal type $\mathcal{A}_\mathcal{I}$ stemming from an ideal $\mathcal{I}$ in the set of positive roots of a…

Combinatorics · Mathematics 2019-02-01 Michael Cuntz , Gerhard Roehrle , Anne Schauenburg

We introduce the class of MAT-free hyperplane arrangements which is based on the Multiple Addition Theorem by Abe, Barakat, Cuntz, Hoge, and Terao. We also investigate the closely related class of MAT2-free arrangements based on a recent…

Combinatorics · Mathematics 2020-03-05 Michael Cuntz , Paul Mücksch

Let A = (A,V) be a complex hyperplane arrangement and let L(A) denote its intersection lattice. The arrangement A is called supersolvable, provided its lattice L(A) is supersolvable. For X in L(A), it is known that the restriction A^X is…

Combinatorics · Mathematics 2014-07-09 N. Amend , T. Hoge , G. Roehrle

In 1989, Ziegler introduced the concept of a multi-arrangement. One natural example is the reflection arrangement of a unitary reflection group with multiplicity given by the number of reflections associated with each hyperplane. For all…

Group Theory · Mathematics 2014-06-30 Torsten Hoge , Gerhard Roehrle

The aim of this note is a classification of all nice and all inductively factored reflection arrangements. It turns out that apart from the supersolvable instances only the monomial groups $G(r,r,3)$ for $r \ge 3$ give rise to nice…

Group Theory · Mathematics 2015-05-19 Torsten Hoge , Gerhard Roehrle

Let $W$ be a finite reflection group. For a given $w \in W$, the following assertion may or may not be satisfied: (*) The principal Bruhat order ideal of $w$ contains as many elements as there are regions in the inversion hyperplane…

Combinatorics · Mathematics 2010-10-05 Axel Hultman

In a recent paper, Hoge and the second author classified all nice and all inductively factored reflection arrangements. In this note we extend this classification by determining all nice and all inductively factored restrictions of…

Combinatorics · Mathematics 2016-09-23 Tilman Moeller , Gerhard Roehrle

We call a poset factorable if its characteristic polynomial has all positive integer roots. Inspired by inductive and divisional freeness of a central hyperplane arrangement, we introduce and study the notion of inductive posets and their…

Combinatorics · Mathematics 2024-01-09 Roberto Pagaria , Maddalena Pismataro , Tan Nhat Tran , Lorenzo Vecchi

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…

Combinatorics · Mathematics 2014-09-26 William Slofstra
‹ Prev 1 2 3 10 Next ›