Related papers: Modular Construction of Free Hyperplane Arrangemen…
We study a generalization of the concept of harmonic conjugation from projective geometry and full algebraic matroids to a larger class of matroids called \emph{harmonic matroids}. We use harmonic conjugation to construct a projective plane…
By using Alexander duality on simplicial complexes we give a new and algebraic proof of Dirac's theorem on chordal graphs.
We give a construction of a free digroup $F(X)$ on a set $X$ and formulate the halo and the group parts of $F(X)$. We prove that $F(X)$ is isomorphic to $F(Y)$ if and only if $card(X)=card(Y)$.
We study algebras of meromorphic modular forms whose poles lie on Heegner divisors for orthogonal and unitary groups associated to root lattices. We give a uniform construction of $147$ hyperplane arrangements on type IV symmetric domains…
Necessary and sufficient conditions for a finite connected graph with a strict partial order on vertices to be a combinatorial invariant of pseudoharmonic function are obtained.
A matroid is a machine capturing linearity of mathematical objects and producing combinatorial structures. Matroid structure arises everywhere since linearity is a ubiquitous concept. One natural way to obtain matroids is by considering…
We review the Dirac formalism for dealing with constraints in a canonical Hamiltonian formulation and discuss gauge freedom and display constraints for gauge theories in a general context. We introduce the Dirac bracket and show that it…
We show that the notion of MAT-freeness for hyperplane arrangements depends on the underlying field. In particular, MAT-freeness is not combinatorial.
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…
The classical Dirac theorem asserts that every graph $G$ on $n$ vertices with minimum degree $\delta(G) \ge \lceil n/2 \rceil$ is Hamiltonian. The lower bound of $\lceil n/2 \rceil$ on the minimum degree of a graph is tight. In this paper,…
Freer monads are a useful structure commonly used in various domains due to their expressiveness. However, a known issue with freer monads is that they are not amenable to static analysis. This paper explores freer arrows, a relatively…
We prove a characterization of freeness, conjectured by Athanasiadis, for the family of hyperplane arrangements which lie between the Coxeter and the Catalan arrangement of type $A_\ell$. One direction was already proved in [2]. Here we…
What can be said about the structure of graphs that do not contain an induced copy of some graph H? Rodl showed in the 1980s that every H-free graph has large parts that are very dense or very sparse. More precisely, let us say that a graph…
We extend previous results by Cumplido, Martin and Vaskou on parabolic subgroups of large-type Artin groups to a broader family of two-dimensional Artin groups. In particular, we prove that an arbitrary intersection of parabolic subgroups…
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…
Discriminantal arrangements are hyperplane arrangements, which are generalized braid ones. They are constructed from given hyperplane arrangements, but their combinatorics are not invariant under combinatorial equivalence. However, it is…
We study Hamiltonian paths and cycles in undirected graphs from an operadic viewpoint. We show that the graphical collection $\mathsf{Ham}$ encoding directed Hamiltonian paths in connected graphs admits an operad-like structure, called a…
When can a unimodular random planar graph be drawn in the Euclidean or the hyperbolic plane in a way that the distribution of the random drawing is isometry-invariant? This question was answered for one-ended unimodular graphs in…
We show that if the fundamental groups of the complements of two line arrangements in the complex projective plane are isomorphic to the same direct sum of free groups, then the complements of the arrangements are homotopy equivalent. For…
The existence of Hamiltonian cycles in 1-planar graphs with higher connectivity has attracted considerable attention. Recently, the authors and Dong proved that 4-connected 1-planar chordal graphs are Hamiltonian-connected. In this paper,…