English
Related papers

Related papers: Free arrangements with low exponents

200 papers

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

In his paper and thesis in 1989, Ziegler posed several conjectures regarding commutative algebra related to hyperplane arrangements. In this article, we revisit two of them. One is on generic cuts of free arrangements, and the other has to…

Combinatorics · Mathematics 2026-05-20 Takuro Abe , Graham Denham

Polar orderings arose in recent work of Salvetti and the second author on minimal CW-complexes for complexified hyperplane arrangements. We study the combinatorics of these orderings in the classical framework of oriented matroids, and…

Combinatorics · Mathematics 2012-10-26 Emanuele Delucchi , Simona Settepanella

In 2024, Bellamy, Craw, Rayan, Schedler, and Weiss introduced a particular family of real hyperplane arrangements stemming from hyperpolygonal spaces associated with certain quiver varieties which we thus call hyperpolygonal arrangements…

Combinatorics · Mathematics 2026-03-04 Lorenzo Giordani , Paul Mücksch , Gerhard Roehrle , Johannes Schmitt

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. There is the stronger…

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

We study the combinatorics of pseudoline arrangements in the real projective plane. Our focus lies on two classes of arrangements: simplicial arrangements and arrangements whose characteristic polynomials have only real roots. We derive…

Combinatorics · Mathematics 2019-02-08 David Geis

In the present paper, we study conic-line arrangements having nodes, tacnodes, and ordinary triple points as singularities. We provide combinatorial constraints on such arrangements and we give the complete classification of free…

Algebraic Geometry · Mathematics 2022-08-16 Alexandru Dimca , Piotr Pokora

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

An arrangement of hyperplanes is a finite collection of hyperplanes in a real Euclidean space. To such a collection one associates the characteristic polynomial that encodes the combinatorics of intersections of the hyperplanes. Finding the…

Combinatorics · Mathematics 2019-04-19 A. R. Balasubramanian

We prove Terao conjecture saying that the freeness is determined by the combinatorics for arrangements of 13 lines in the complex projective plane and that the property of being nearly free is combinatorial for line arrangements of up to 12…

Algebraic Topology · Mathematics 2018-05-03 Alexandru Dimca , Denis Ibadula , Anca Macinic

Saito's criterion is a foundational result that algebraically characterizes free hyperplane arrangements via the determinant of a square matrix of logarithmic derivations. It is natural to ask whether this criterion can be generalized to…

Commutative Algebra · Mathematics 2026-03-25 Junyan Chu

It is an open question to give a combinatorial interpretation of the Falk invariant of a hyperplane arrangement, i.e. the third rank of successive quotients in the lower central series of the fundamental group of the arrangement. In this…

Combinatorics · Mathematics 2021-01-13 Weili Guo , Michele Torielli

In this article there are two main results. The first result gives a formula, in terms of a log resolution, for the graded pieces of the Hodge filtration on the cohomology of a unitary local system of rank one on the complement of an…

Algebraic Geometry · Mathematics 2008-09-27 Nero Budur

We extend the relation between random matrices and free probability theory from the level of expectations to the level of all correlation functions (which are classical cumulants of traces of products of the matrices). We introduce the…

Operator Algebras · Mathematics 2007-06-13 Benoit Collins , James A. Mingo , Piotr Sniady , Roland Speicher

Let $ G $ be a simple graph of $ \ell $ vertices $ \{1, \dots, \ell \} $ with edge set $ E_{G} $. The graphical arrangement $ \mathcal{A}_{G} $ consists of hyperplanes $ \{x_{i}-x_{j}=0\} $, where $ \{i, j \} \in E_{G} $. It is well known…

Combinatorics · Mathematics 2018-07-09 Daisuke Suyama , Shuhei Tsujie

We show that a hypersimple unidimensional theory that has a club of reducts, in the partial order of all countable reducts, that are coordinatized in finite rank, is supersimple.

Logic · Mathematics 2016-04-05 Ziv Shami

In the present note we study some arrangements of inflectional lines, hyperosculating conics, and a nodal plane cubic that are free. Moreover, we study weak combinatorics of arrangements consisting of lines, conics, and elliptic curves…

Algebraic Geometry · Mathematics 2025-09-12 Artur Bromboszcz

Athanasiadis studied arrangements obtained by adding shifted hyperplanes to the braid arrangement. Similarly, Bailey studied arrangements obtained by adding tilted hyperplanes to the braid arrangement. These two kinds of arrangements are…

Combinatorics · Mathematics 2024-04-09 Daisuke Suyama , Michele Torielli , Shuhei Tsujie

The purpose of this paper is to give new examples of families of free singularities. We first show that a generic equidimensional subspace arrangement is free. Furthermore, we show that a product of two reduced Cohen-Macaulay subspaces is…

Algebraic Geometry · Mathematics 2020-12-23 Raul Epure , Delphine Pol

We establish a connection between linear codes and hyperplane arrangements using the Thomas decomposition of polynomial systems and the resulting counting polynomial. This yields both a generalization and a refinement of the weight…

Information Theory · Computer Science 2014-04-14 Wilhelm Plesken , Thomas Bächler
‹ Prev 1 3 4 5 6 7 10 Next ›