Related papers: On intersection lattices of hyperplane arrangement…
The interval poset of a permutation is the set of intervals of a permutation, ordered with respect to inclusion. It has been introduced and studied recently in [B. Tenner, arXiv:2007.06142]. We study this poset from the perspective of the…
Higher order anisotropic superspaces are constructed as generalized vector superbundles provided with compatible nonlinear connection, distinguished connection and metric structures.
Lattices induced by coverings arise naturally in matroid theory and combinatorial optimization, providing a structured framework for analyzing relationships between independent sets and closures. In this paper, we explore the structural…
Let $B$ be an arrangement of linear complex hyperplanes in $C^d$. Then a classical result by Orlik \& Solomon asserts that the cohomology algebra of the complement can be constructed from the combinatorial data that are given by the…
There is a one-to-one correspondence between geometric lattices and the intersection lattices of arrangements of homotopy spheres. When the arrangements are essential and fully partitioned, Zaslavsky's enumeration of the cells of the…
We investigate the representation of lattices as sublattices of the lattice of all convex subsets (intervals) of a linearly ordered set $(X,\le)$. We introduce the purely lattice-theoretic notion of a \textit{loc-lattice} and prove that…
This work proposes an alternative approach to the so-called lattice of embedded subsets, which is included in the product of the subset and partition lattices of a finite set, and whose elements are pairs consisting of a subset and a…
An algorithm is demonstrated that finds an ordinary intersection in an arrangement of $n$ lines in $\mathbb{R}^2$, not all parallel and not all passing through a common point, in time $O(n \log{n})$. The algorithm is then extended to find…
Two arrangements with the same combinatorial intersection lattice but whose complements have different fundamental groups are called a Zariski pair. This work finds that there are at most nine such pairs amongst all ten line arrangements…
We construct CW spheres from the lattices that arise as the closed sets of a convex closure, the meet-distributive lattices. These spheres are nearly polytopal, in the sense that their barycentric subdivisions are simplicial polytopes. The…
This article studies a large, general class of orthogonal polytopes which we may call "generic orthotopes". These objects emerged from a desire to represent a Coxeter complex by an orthogonal polytope that is particularly nice with respect…
We provide a complete classification, in the language of weak-combinatorics, of minimal plus-one generated line arrangements in the complex projective plane with double and triple intersection points.
We introduce a construction called realisation which transforms posets into posets. We show that realisations share several key features with upper semilattices. For example, we define local dimensions of points in a poset and show that…
Partially ordered sets (posets) play a universal role as an abstract structure in many areas of mathematics. For finite posets, an explicit enumeration of distinct partial orders on a set of unlabelled elements is known only up to a…
We initiate the combinatorial study of factorization systems on finite lattices, paying special attention to the role that reflective and coreflective factorization systems play in partitioning the poset of factorization systems on a fixed…
We show that sublattice-polarized states (SLPSs) appear ubiquitously on the common lattices. We first establish the destructive-interference (DI) scenario for the SLPSs, which is systematized by a point-group-symmetry interpretation. The…
Intersection bodies represent a remarkable class of geometric objects associated with sections of star bodies and invoking Radon transforms, generalized cosine transforms, and the relevant Fourier analysis. The main focus of this article is…
Given a space $X$ and a simplicial complex $K$ with $m$-vertices, the arrangement of partially diagonal subspaces of $X^m$, called the dragonal arrangement, is defined. We decompose the suspension of the diagonal arrangement when $2(dim K +…
Given a finite set of arbitrarily distributed points in affine space with arbitrary multiplicity structures, we present an algorithm to compute the reduced Groebner basis of the vanishing ideal under the lexicographic ordering. Our method…
If $I$ is a perfect ideal in a local Cohen-Macaulay ring, the generators of ideals linked to $I$ are well understood. However, the generators of the residual intersections of $I$ have only been computed in a few special cases. In this…