相关论文: On arrangements of hyperplanes from connected subg…

In this paper we study Cynk-Szemberg octic hyperplane arrangements from the perspective of homological properties of their derivation modules. In particular, we define the notion of the type of hyperplane arrangements that will be used in…

The Shi arrangement is an affine arrangement of hyperplanes consisting of the hyperplanes of the Weyl arrangement and their parallel translations. It was introduced by J.-Y. Shi in the study of the Kazhdan-Lusztig representation of the…

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…

In the theory of hyperplane arrangements, the most important and difficult problem is the combinatorial dependency of several properties. In this atricle, we prove that Terao's celebrated addition-deletion theorem for free arrangements is…

Building on previous work, this paper extends the modeling of political structures from simplicial complexes to hypergraphs. This allows the analysis of more complex political dynamics where agents who are willing to form coalitions contain…

We consider an algebraic formulation of Quantum Theory and develop a combinatorial model of the Heisenberg-Weyl algebra structure. It is shown that by lifting this structure to the richer algebra of graph operator calculus, we gain a simple…

We give a combinatorial characterization of isotropic subspaces in the Orlik- Solomon algebra of a hyperplane arrangement in terms of decorations of its intersection lattice. We then use this characterization to prove a result that relates…

Given a simplicial hyperplane arrangement H and a subspace arrangement A embedded in H, we define a simplicial complex Delta_{A,H} as the subdivision of the link of A induced by H. In particular, this generalizes Steingrimsson's coloring…

Flip graphs of combinatorial and geometric objects are at the heart of many deep structural insights and connections between different branches of discrete mathematics and computer science. They also provide a natural framework for the…

Let p be a singular point of a variety. Consider a resolution where the preimage of p is a simple normal crossing divisor E. The combinatorial structure of E is described by a cell complex D(E), called the dual graph or dual complex of E.…

Questions that seek to determine whether a hyperplane arrangement property, be it geometric, arithmetic or topological, is of a combinatorial nature (that is determined by the intersection lattice) are abundant in the literature. To tackle…

We investigate the representations of the hyperalgebras associated to the map algebras $\mathfrak g\otimes \mathcal A$, where $\mathfrak g$ is any finite-dimensional complex simple Lie algebra and $\mathcal A$ is any associative commutative…

The relation space of a hyperplane arrangement is the vector space of all linear dependencies among the defining forms of the hyperplanes in the arrangement. In this paper, we study the relationship between the relation space and the…

Given a real finite hyperplane arrangement A and a point p not on any of the hyperplanes, we define an arrangement vo(A,p), called the *valid order arrangement*, whose regions correspond to the different orders in which a line through p can…

The aim of this article is to link Schubert varieties in the flag manifold with hyperplane arrangements. For a permutation, we construct a certain graphical hyperplane arrangement. We show that the generating function for regions of this…

We show that if a planar graph $G$ has a plane straight-line drawing in which a subset $S$ of its vertices are collinear, then for any set of points, $X$, in the plane with $|X|=|S|$, there is a plane straight-line drawing of $G$ in which…

We construct consistent interacting gauge theories for M conformal massless spin-2 fields ("Weyl gravitons") with the following properties: (i) in the free limit, each field fulfills the equation ${\cal B}^{\mu \nu} = 0$, where ${\cal…

We consider hyperplane arrangements generated by generic points and study their intersection lattices. These arrangements are known to be equivalent to discriminantal arrangements. We show a fundamental structure of the intersection…

We introduce and investigate generalizations of interval and proper interval graphs to simplicial complexes, including strong interval, unit interval, and under closed variants. Through equivalent combinatorial and algebraic…

Subgraphs reveal information about the geometry and functionalities of complex networks. For scale-free networks with unbounded degree fluctuations, we obtain the asymptotics of the number of times a small connected graph occurs as a…