Related papers: Free multiderivations of connected subgraph arrang…
Recently, Cuntz and K\"uhne introduced a particular class of hyperplane arrangements stemming from a given graph $G$, so called connected subgraph arrangements $A_G$. In this note we strengthen some of the result from their work and prove…
Ideal subarrangements of a Weyl arrangement are proved to be free by the multiple addition theorem (MAT) due to Abe-Barakat-Cuntz-Hoge-Terao (2016). They form a significant class among Weyl subarrangements that are known to be free so far.…
We define specific multiplicities on the braid arrangement by using edge-bicolored graphs. To consider their freeness, we introduce the notion of bicolor-eliminable graphs as a generalization of Stanley's classification theory of free…
We construct an efficient model for graphs of finitely generated subgroups of free groups. Using this we give a very short proof of Dicks's reformulation of the strengthened Hanna Neumann Conjecture as the Amalgamated Graph Conjecture. In…
In this article, we study freeness of hyperplane arrangements. One of the most investigated arrangement is a graphic arrangement. Stanley proved that a graphic arrangement is free if and only if the corresponding graph is chordal and Dirac…
To every $C^*$ correspondence over a $C^*$-algebra one can associate a Cuntz-Pimsner algebra generalizing crossed product constructions, graph $C^*$-algebras, and a host of other classes of operator algebras. Cuntz-Pimsner algebras come…
We prove Hadwiger's Conjecture for $\{\text{co-claw}, \text{co-gem}\}$-free graphs and $\{\text{fork}, \text{antifork}\}$-free graphs, where the co-claw is the disjoint union of a triangle and a vertex, the co-gem is the disjoint union of a…
k-graphs are higher-rank analogues of directed graphs which were first developed to provide combinatorial models for operator algebras of Cuntz-Krieger type. Here we develop the theory of covering spaces for k-graphs, obtaining a…
The class of subarrangements of the well-studied braid arrangement, so-called graphic hyperplane arrangements, is important for analysing new concepts and properties in hyperplane arrangement theory. While there is a nice characterization…
In this note we study the logarithmic derivation module of a non-free arrangement. We prove a generalized addition theorem for all arrangements. This addition theorem allows us to find various relationships between non-free arrangements,…
We investigate a construction which associates a finite von Neumann algebra $M(\Gamma,\mu)$ to a finite weighted graph $(\Gamma,\mu)$. Pleasantly, but not surprisingly, the von Neumann algebra associated to to a `flower with $n$ petals' is…
We give a complete classification of free and non-free multiplicities on the $A_3$ braid arrangement. Namely, we show that all free multiplicities on $A_3$ fall into two families that have been identified by Abe-Terao-Wakefield (2007) and…
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…
Let $G$ be a bipartite graph, and let $H$ be a bipartite graph with a fixed bipartition $(B_H,W_H)$. We consider three different, natural ways of forbidding $H$ as an induced subgraph in $G$. First, $G$ is $H$-free if it does not contain…
We develop a notion of a generalized Cuntz-Krieger family of projections and partial isometries where the range of the partial isometries need not have trivial intersection. We associate to these generalized Cuntz-Krieger families a…
We show that some results of L. Makar-Limanov, P. Malcolmson and Z. Reichstein on the existence of free associative algebras are valid in the more general context of varieties of algebras.
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…
This paper investigates derivations of the free semigroupoid algebra $\mathfrak{L}_G$ of a countable or uncountable directed graph $G$ and its norm-closed version, the tensor algebra $\mathcal{A}_G$. We first prove a weak Dixmier…
For a given multigraph H, a graph G is H-linked, if |G| \geq |H| and for every injective map {\tau}: V (H) \rightarrow V (G), we can find internally disjoint paths in G, such that every edge from uv in H corresponds to a {\tau} (u) - {\tau}…
Given a finite simple undirected graph $G$, let $T_1(G)$ denote the subset of vertices of $G$ such that every vertex of $T_1(G)$ belongs to at least one subgraph isomorphic to a graph obtained by connecting a single vertex to two vertices…