English
Related papers

Related papers: Modular Construction of Free Hyperplane Arrangemen…

200 papers

An m-free hyperplane arrangement is a generalization of a free arrangement. Holm asked the following two questions: (1)Does m-free imply (m+1)-free for any arrangement? (2)Are all arrangements m-free for m large enough? In this paper, we…

Combinatorics · Mathematics 2017-10-31 Takuro Abe , Norihiro Nakashima

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

This paper presents a bridge between the theories of wonderful models associated with toric arrangements and wonderful models associated with hyperplane arrangements. In a previous work, the same authors noticed that the model of the toric…

Algebraic Topology · Mathematics 2024-07-08 Giovanni Gaiffi , Oscar Papini , Viola Siconolfi

The concept of a Dirac algebroid, which is a linear almost Dirac structure on a vector bundle, was designed to generate phase equations for mechanical systems with linear nonholonomic constraints. We apply it to systems with magnetic-like…

Mathematical Physics · Physics 2025-05-01 Katarzyna Grabowska , Michalina Borczyńska , Joanna Majsak , Tomasz Sobczak

In the present note we study determinantal arrangements constructed with use of the $3$-minors of a $3 \times 5$ generic matrix of indeterminates. In particular, we show that certain naturally constructed hypersurface arrangements in…

Algebraic Geometry · Mathematics 2022-11-29 Marek Janasz , Paulina Wiśniewska

We give a counterexample to a conjecture by Miasnikov, Ventura and Weil, stating that an extension of free groups is algebraic if and only if the corresponding morphism of their core graphs is onto, for every basis of the ambient group. In…

Group Theory · Mathematics 2021-01-05 Noam Kolodner

We prove the torsion freeness of the decomposable Orlik--Solomon algebra of a simple matroid on ground set $[n]$. In the class of hypersolvable \& non-supersolvable complex hyperplane arrangements, the torsion freeness, in a certain degree,…

Combinatorics · Mathematics 2023-02-22 Anca Macinic

Questions that seek to determine whether a hyperplane arrangement property, be it geometric, arithmetic or topological, is of a combinatorial nature (that is determined by the intersection lattice) are abundant in the literature. To tackle…

Algebraic Geometry · Mathematics 2021-11-02 Benoît Guerville-Ballé

The freeness of hyperplane arrangements in a three dimensional vector space over finite field is discussed. We prove that if the number of hyperplanes is greater than some bound, then the freeness is determined by the characteristic…

Combinatorics · Mathematics 2011-11-09 Masahiko Yoshinaga

A free multiarrangement of rank $k$ is defined to be extendable if it is obtained from a simple rank $(k+1)$ free arrangement by the natural restriction to a hyperplane (in the sense of Ziegler). Not all free multiarrangements are…

Combinatorics · Mathematics 2008-04-28 Masahiko Yoshinaga

We show that the fundamental group of the complement of an arrangement of complex lines in the complex plane is a free group if and only if the arrangement is a union of parallel lines.

Geometric Topology · Mathematics 2009-05-11 Kwai-Man Fan

Given a simple undirected graph $G$ there is a simplicial complex $\mathrm{Ind}(G)$, called the independence complex, whose faces correspond to the independent sets of $G$. This is a well studied concept because it provides a fertile ground…

Combinatorics · Mathematics 2025-10-06 Fred M. Abdelmalek , Priyavrat Deshpande , Shuchita Goyal , Amit Roy , Anurag Singh

Free Fermions on vertices of distance-regular graphs are considered. Bipartition are defined by taking as one part all vertices at a given distance from a reference vertex. The ground state is constructed by filling all states below a…

Mathematical Physics · Physics 2020-10-09 Nicolas Crampe , Krystal Guo , Luc Vinet

This is a survey and research note on the modified Orlik conjecture derived from the division theorem introduced in [2]. The division theorem is a generalization of classical addition-deletion theorems for free arrangements. The division…

Commutative Algebra · Mathematics 2016-03-15 Takuro Abe

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

We give inductive constructions of independent graphs that contain implied nonedges but do not contain any non-trivial rigid subgraphs, or \emph{nucleations}: some of the constructions and proofs apply to 3-dimensional abstract rigidity…

Combinatorics · Mathematics 2025-08-19 Jialong Cheng , Meera Sitharam , Ileana Streinu , William Sims

Only few categories of free arrangements are known in which Terao's conjecture holds. One of such categories consists of $3$-arrangements with unbalanced Ziegler restrictions. In this paper, we generalize this result to arbitrary…

Combinatorics · Mathematics 2019-06-05 Takuro Abe , Lukas Kühne

Let $\mathcal C :f=0$ be a curve arrangement in the complex projective plane. If $\mathcal C$ contains a curve subarrangement consisting of at least three members in a pencil, then one obtains an explicit syzygy among the partial…

Algebraic Geometry · Mathematics 2017-08-30 Alexandru Dimca

In this article we describe two new characterizations of freeness for hyperplane arrangements via the study of the generic initial ideal and of the sectional matrix of the Jacobian ideal of arrangements.

Algebraic Geometry · Mathematics 2018-01-31 Anna Maria Bigatti , Elisa Palezzato , Michele Torielli

J.H.C. Whitehead's second free-group algorithm determines whether or not two given elements of a free group lie in the same orbit of the automorphism group of the free group. The algorithm involves certain connected graphs, and Whitehead…

Group Theory · Mathematics 2017-06-30 Warren Dicks