Related papers: Modular Construction of Free Hyperplane Arrangemen…

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 $(\mathcal…

Consider a collection of points in the plane and the sets of slopes or directions of the lines between pairs of points. It is known that the algebraic matroid on the set of direction constraints between the points is equivalent to the…

We re-cast in a more combinatorial and computational form the foldings approach of John Stallings and pursue a detailed study of the subgroup structure of free groups. In particular, we introduce the notions of an "algebraic" and a "free"…

Let $G$ be a group which admits the structure of an iterated semidirect product of finitely generated free groups. We construct a finite, free resolution of the integers over the group ring of $G$. This resolution is used to define…

We establish a general theory for projective dimensions of the logarithmic derivation modules of hyperplane arrangements. That includes the addition-deletion and restriction theorem, Yoshinaga-type result, and the division theorem for…

This paper considers a hyperplane arrangement constructed with a subset of a set of all simple paths in a graph. A connection of the constructed arrangement to the maximum matching problem is established. Moreover, the problem of finding…

Dyadic lattice graphs and their duals are commonly used as discrete approximations to the hyperbolic plane. We use them to give examples of random rooted graphs that are stationary for simple random walk, but whose duals have only a…

An arrangement of hyperplanes is called formal, if the relations between the hyperplanes are generated by relations in codimension 2. Formality is not a combinatorial property, raising the question for a characterization for combinatorial…

In [Discrete differential calculus on simplicial complexes and constrained homology, Chin. Ann. Math. Ser. B 44(4), 615-640, 2023], the constrained (co)homology for simplicial complexes and independence hypergraphs is constructed via…

In this research, we determine the structure of (claw, bull)-free graphs. We show that every connected (claw, bull)-free graph is either an expansion of a path, an expansion of a cycle, or the complement of a triangle-free graph; where an…

Hyperplane arrangements form the latest addition to the zoo of combinatorial objects dealt with by polymake. We report on their implementation and on a algorithm to compute the associated cell decomposition. The implemented algorithm…

The extended Shi and Catalan arrangements are well investigated arrangements. In this paper, we prove that the cone of the extended Catalan arrangement of type A is always hereditarily free, while we determine the dimension in which the…

To any graph and smooth algebraic curve $C$ one may associate a "hypercurve" arrangement and one can study the rational homotopy theory of the complement $X$. In the rational case ($C=\mathbb{C}$), there is considerable literature on the…

Inductive $k$-independent graphs generalize chordal graphs and have recently been advocated in the context of interference-avoiding wireless communication scheduling. The NP-hard problem of finding maximum-weight induced $c$-colorable…

Given a graph $G$ with vertex set $\{1,\ldots,n\}$, we can project the graphical arrangement of $G$ to an $(n-1)$-dimensional torus to obtain a toric hyperplane arrangement. Adams, Defant, and Striker constructed a toric combinatorial…

We study the structure algebra $\mathcal{Z}$ of the stable moment graph for the case of the affine root system $A_{1}$. The structure algebra $\mathcal{Z}$ is an algebra over a symmetric algebra and in particular, it is a module over a…

The intersection data of a hyperplane arrangement is described by a geometric lattice, or equivalently a simple matroid. There is a rich interplay between this combinatorial structure and the topology of the arrangement complement. In this…

The fundamental group of the complement of a hyperplane arrangement in a complex vector space is an important topological invariant. The third rank of successive quotients in the lower central series of the fundamental group was called Falk…

We prove Anzis and Tohaneanu conjecture, that is the Dirac-Motzkin conjecture for supersolvable line arrangements in the projective plane over an arbitrary field of characteristic zero. Moreover, we show that a divisionally free…

Let $Oct_{1}^{+}$ and $Oct_{2}^{+}$ be the planar and non-planar graphs that obtained from the Octahedron by 3-splitting a vertex respectively. For $Oct_{1}^{+}$, we prove that a 4-connected graph is $Oct_{1}^{+}$-free if and only if it is…