Related papers: On arrangements of hyperplanes from connected subg…
The L-intersection graphs are the graphs that have a representation as intersection graphs of axis parallel shapes in the plane. A subfamily of these graphs are {L, |, --}-contact graphs which are the contact graphs of axis parallel L, |,…
Hypergraphs are structures that can be decomposed or described; in other words they are recursively countable. Here, we get exact and asymptotic enumeration results on hypergraphs by means of exponential generating functions. The number of…
A hyperplane arrangement in $\mathbb{R}^n$ is a finite collection of affine hyperplanes. Counting regions of hyperplane arrangements is an active research direction in enumerative combinatorics. In this paper, we consider the arrangement…
Topological drawings are representations of graphs in the plane, where vertices are represented by points, and edges by simple curves connecting the points. A drawing is simple if two edges intersect at most in a single point, either at a…
The main purpose of the present paper is to provide a partial classification, performed with respect the weak-combinatorics, of free arrangements consisting of lines and one smooth conic with quasi-homogeneous ordinary singularities.
Generalizing a result of Yoshinaga in dimension 3, we show that a central hyperplane arrangement in 4-space is free exactly if its restriction with multiplicities to a fixed hyperplane of the arrangement is free and its reduced…
Let A be an arrangement of complex hyperplanes. The fundamental group of the complement of A is determined by a braid monodromy homomorphism from a finitely generated free group to the pure braid group. Using the Gassner representation of…
A pseudoline is a homeomorphic image of the real line in the plane so that its complement is disconnected. An arrangement of pseudolines is a set of pseudolines in which every two cross exactly once. A drawing of a graph is pseudolinear if…
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.
We present a graph-theoretic characterisation of when a quantum spin model admits an exact solution via a mapping to free parafermions. Our characterisation is based on the concept of a frustration graph, which represents the commutation…
From a root system, one may consider the arrangement of reflecting hyperplanes, as well as its toric and elliptic analogues. The corresponding Weyl group acts on the complement of the arrangement and hence on its cohomology. We consider a…
Any arrangement of hyperplanes in general position in $P^n$ can be regarded as a divisor with normal crossing. We study the bundles of logarithmic 1-forms corresponding to such divisors` from the point of view of classification of vector…
Let $W$ be a finite Weyl group and $\A$ be the corresponding Weyl arrangement. A deformation of $\A$ is an affine arrangement which is obtained by adding to each hyperplane $H\in\A$ several parallel translations of $H$ by the positive root…
Recently, neural network architectures have been developed to accommodate when the data has the structure of a graph or, more generally, a hypergraph. While useful, graph structures can be potentially limiting. Hypergraph structures in…
We study combinatorial configurations with the associated point and line graphs being strongly regular. Examples not belonging to known classes such as partial geometries and their generalizations or elliptic semiplanes are constructed.…
We consider a random geometric hypergraph model based on an underlying bipartite graph. Nodes and hyperedges are sampled uniformly in a domain, and a node is assigned to those hyperedges that lie with a certain radius. From a modelling…
Several papers have been written studying unexpected hypersurfaces. We say a finite set of points Z admits unexpected hypersurfaces if a general union of fat linear subspaces imposes less that the expected number of conditions on the ideal…
We define and study the Tutte polynomial of a hyperplane arrangement. We introduce a method for computing it by solving an enumerative problem in a finite field. For specific arrangements, the computation of Tutte polynomials is then…
We define an algebraic setup of homology for hypergraphs, which defaults to simplicial homology in the case of graphs, and study its basic properties. As part of our study we define algebraic spanning trees of hypergraphs, along with…
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…