Related papers: Separator-based derivations of graphic arrangement…
We study the change of the minimal degree of a logarithmic derivation of a hyperplane arrangement under the addition or the deletion of a hyperplane, and give a number of applications. First, we prove the existence of Tjurina maximal line…
In this paper we give full classification of rank 3 line arrangements in $\mathbb P^2$ (over a field of characteristic 0) that have a minimal logarithmic derivation of degree 3. The classification presents their defining polynomials, up to…
Minimal separators in graphs are an important concept in algorithmic graph theory. In particular, many problems that are NP-hard for general graphs are known to become polynomial-time solvable for classes of graphs with a polynomially…
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…
Let $G$ be a simple graph on the vertex set $\{v_1,\dots,v_n\}$ with edge set $E$. Let $K$ be a field. The graphical arrangement $\mathcal{A}_G$ in $K^n$ is the arrangement $x_i-x_j=0, v_iv_j \in E$. An arrangement $\mathcal{A}$ is…
Computing maximum independent sets in graphs is an important problem in computer science. In this paper, we develop an evolutionary algorithm to tackle the problem. The core innovations of the algorithm are very natural combine operations…
This write-up contains some minor results and notes related to our work [HQ15] (some of them already known in the literature). In particular, it shows the following: - We show that a graph with polynomial expansion have sublinear…
This is the expanded notes of the lecture by the author in "Arrangements in Pyrenees", June 2012. We are discussing relations of freeness and splitting problems of vector bundles, several techniques proving freeness of hyperplane…
A pseudoline arrangement graph is a planar graph induced by an embedding of a (simple) pseudoline arrangement. We study the corresponding graph realization problem and properties of pseudoline arrangement graphs. In the first part, we give…
A graph separator is a subset of vertices of a graph whose removal divides the graph into small components. Computing small graph separators for various classes of graphs is an important computational task. In this paper, we present a…
We show that the deletion theorem of a free arrangement is combinatorial, i.e., whether we can delete a hyperplane from a free arrangement keeping freeness depends only on the intersection lattice. In fact, we give an explicit sufficient…
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…
We propose an approach to study logarithmic sheaves T(-log A) associated with a hyperplane arrangements A on the projective space, based on projective duality, direct image functors and vector bundles methods. We focus on freeness of line…
We study the bounded regions in a generic slice of the hyperplane arrangement in $\mathbb{R}^n$ consisting of the hyperplanes defined by $x_i$ and $x_i+x_j$. The bounded regions are in bijection with several classes of combinatorial…
An upward planar order on an acyclic directed graph $G$ is a special linear extension of the edge poset of $G$ that satisfies the nesting condition. This order was introduced to combinatorially characterize upward plane graphs and…
We introduce a weighted version of the module of logarithmic derivations of a divisor in weighted projective space, and provide a generalization of Saito's criterion for freeness in terms of weighted multiple eigenschemes (wME-schemes).…
We introduce and study a construction of higher derived brackets generated by a (not necessarily inner) derivation of a Lie superalgebra. Higher derived brackets generated by an element of a Lie superalgebra were introduced in our earlier…
We investigate the superalgebra of derivations generated by the fundamental forms on manifolds with reduced structure group. In particular, we point out a relation between the algebra of derivations of heterotic geometries that admit…
Graph-based signal processing techniques have become essential for handling data in non-Euclidean spaces. However, there is a growing awareness that these graph models might need to be expanded into `higher-order' domains to effectively…
The fundamental group of the complement of a hyperplane arrangement plays an important role in studying the corresponding arrangements. In particular, for large families of hyperplane arrangements, this fundamental group, being isomorphic…