Related papers: The canonical join complex for biclosed sets
The isometry class of the intersection form of a compact complex surface can be easily determined from complex-analytic invariants. For projective surfaces the primitive lattice is another naturally occurring lattice. The goal of this note…
The canonical polynomial is an important output of the multivariable topological Poincar\'e series associated with a normal surface singularity. It can be considered as a multivariable polynomial generalization of the Seiberg--Witten…
Consider a face F in an arrangement of n Jordan curves in the plane, no two of which intersect more than s times. We prove that the combinatorial complexity of F is O(\lambda_s(n)), O(\lambda_{s+1}(n)), and O(\lambda_{s+2}(n)), when the…
In this paper, we define the concepts of semi-canonical and canonical binary matrix. Strictly mathematical, we prove the correctness of these definitions. We describe and we implement an algorithm for finding all semi-canonical binary…
In this paper, we establish a one-to-one correspondence between the set of biclosed sets in an irreducible root system of type $A_n$ and the set of quasitrivial semigroup structures on a set with $n+1$ elements. Building on this…
A join-semilattice $L$ is said to be conjunctive if it has a top element $1$ and it satisfies the following first-order condition: for any two distinct $a,b\in L$, there is $c\in L$ such that either $a\vee c\not=1=b\vee c$ or $a\vee…
In tri-partite systems, there are three basic biseparability, $A$-$BC$, $B$-$CA$ and $C$-$AB$ biseparability according to bipartitions of local systems. We begin with three convex sets consisting of these basic biseparable states in the…
Faces play a central role in the combinatorial and computational aspects of polyhedra. In this paper, we present the first formalization of faces of polyhedra in the proof assistant Coq. This builds on the formalization of a library…
The canonical extension of a lattice is in an essential way a two-sided completion. Domain theory, on the contrary, is primarily concerned with one-sided completeness. In this paper, we show two things. Firstly, that the canonical extension…
Two semigroups are lattice isomorphic if the lattices of their subsemigroups are isomorphic, and a class of semigroups is lattice closed if it contains every semigroup which is lattice isomorphic to some semigroup from that class. An…
A compact complex surface with positive definite intersection lattice is either the projective plane or a false projective plane. If the intersection lattice is negative definite, the surface is either a non-minimal secondary Kodaira…
The aim of this note is to characterize those doubly ordered frames $\langle X, \leq_1, \leq_2 \rangle$ which are embeddable into the canonical frame of its Urquhart complex algebra.
We prove that if a simplicial complex is shellable, then the intersection lattice for the corresponding diagonal arrangement is homotopy equivalent to a wedge of spheres. Furthermore, we describe precisely the spheres in the wedge, based on…
The universal centralizer of a semisimple algebraic group is the family of centralizers of regular elements, parametrized by their conjugacy classes. When the group is of adjoint type, we construct a smooth, log-symplectic fiberwise…
The lattice of partitions of a set and its d-divisible generalization have been much studied for their combinatorial, topological, and representation-theoretic properties. An ordered set partition is a set partition where the subsets are…
The Tamari lattice, defined on Catalan objects such as binary trees and Dyck paths, is a well-studied poset in combinatorics. It is thus natural to try to extend it to other families of lattice paths. In this article, we fathom such a…
Semifields are semirings in which every nonzero element has a multiplicative inverse. A rough classification uses the characteristic of the semifield, that is the isomorphism type of the semifield generated by the two neutral elements. For…
''Positive geometries'' are a class of semi-algebraic domains which admit a unique ''canonical form'': a logarithmic form whose residues match the boundary structure of the domain. The study of such geometries is motivated by recent…
A distributive lattice structure ${\mathbf M}(G)$ has been established on the set of perfect matchings of a plane bipartite graph $G$. We call a lattice {\em matchable distributive lattice} (simply MDL) if it is isomorphic to such a…
Intersection homology is defined for simplicial, singular and PL chains and it is well known that the three versions are isomorphic for a full filtered simplicial complex. In the literature, the isomorphism, between the singular and the…