Related papers: On intersection lattices of hyperplane arrangement…
We introduce a concept of multiplicity lattices of 2-multiarrangements, determine the combinatorics and geometry of that lattice, and give a criterion and method to construct a basis for derivation modules effectively.
Matrix factorizations of a hypersurface yield a description of the asymptotic structure of minimal free resolutions over the hypersurface. We introduce a new concept of matrix factorizations for complete intersections that allows us to…
We extend the facial weak order from finite Coxeter groups to central hyperplane arrangements. The facial weak order extends the poset of regions of a hyperplane arrangement to all its faces. We provide four non-trivially equivalent…
This paper provides an overview of selected results and open problems in the theory of hyperplane arrangements, with an emphasis on computations and examples. We give an introduction to many of the essential tools used in the area, such as…
We consider arrangements of axis-aligned rectangles in the plane. A geometric arrangement specifies the coordinates of all rectangles, while a combinatorial arrangement specifies only the respective intersection type in which each pair of…
We study a relation between roots of characteristic polynomials and intersection points of line arrangements. Using these results, we obtain a lot of applications for line arrangements. Namely, we give (i) a generalized addition theorem for…
This paper is devoted to the classification problems concerning extended deformations of convex polyhedra and real hyperplane arrangements in the following senses: combinatorial equivalence of face posets, normal equivalence on normal fans…
We give an explicit expression for the contact loci of hyperplane arrangements and show that their cohomology rings are combinatorial invariants. We also give an expression for the restricted contact loci in terms of Milnor fibers of…
We examine properties of generic automorphisms of the random poset, with the goal of explicitly characterizing them. We associate to each automorphism an auxiliary first-order structure, consisting of the random poset equipped with an…
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…
Two sorts of bosons in an optical lattice at commensurate filling factors can form five stable superfluid and insulating groundstates with rich and non-trivial phase diagram. The structure of the groundstate diagram is established by…
We illustrate the use of intersection types as a semantic tool for showing properties of the lattice of lambda theories. Relying on the notion of easy intersection type theory we successfully build a filter model in which the interpretation…
It is shown that the structure of the generalized quadrangle of order two is fully encoded in the properties of the Desargues configuration. A point of the quadrangle is represented by a geometric hyperplane of the Desargues configuration…
An oriented hypergraph is an oriented incidence structure that generalizes and unifies graph and hypergraph theoretic results by examining its locally signed graphic substructure. In this paper we obtain a combinatorial characterization of…
Graphical designs are subsets of vertices of a graph that perfectly average a selected set of eigenvectors of the Graph Laplacian. We show that in highly-structured graphs, graphical designs can coincide with highly structured and…
I answer an open question left by Gui-Song Li in "On self-intersections of immersed surfaces" (AMS Proceedings, Volume 126, 1998, pp.3721-3726.) The intersection graph $M(i)$ of a generic surface $i:F \to S^3$ is the set of values which are…
The decomposition into interaction subspaces is an important result for graphical models and plays a central role for results on the linearized marginal problem; similarly the Chaos decomposition plays an important role in statistical…
We remark that Pearl's Graphoid intersection property, also called intersection property in Bayesian networks, is a particular case of a general intersection property, in the sense of intersection of coverings, for factorisation spaces,…
We consider decompositions of topes of the oriented matroid realizable as the arrangement of coordinate hyperplanes in $\mathbb{R}^{2^t}$, with respect to a distinguished symmetric $2\cdot 2^t$-cycle in its hypercube graph of topes…
In these notes we study hyperplane arrangements having at least one logarithmic derivation of degree two that is not a combination of degree one logarithmic derivations. It is well-known that if a hyperplane arrangement has a linear…