Related papers: Amalgamating poset extensions and generating free …
This paper illustrates the combinatorial approach to vertex algebra - study of vertex algebras presented by generators and relations. A necessary ingredient of this method is the notion of free vertex algebra. Borcherds \cite{bor} was the…
In a recent study by Tenner, the concept of the interval poset of a permutation was introduced to effectively represent all intervals and their inclusions within a permutation. In this paper, we present a new geometric viewpoint on interval…
In this paper we systematically describe relations between various structure sets which arise naturally for pairs of compact topological manifolds with boundary. Our consideration is based on a deep analogy between the case of a compact…
We establish a topological duality for bounded lattices. The two main features of our duality are that it generalizes Stone duality for bounded distributive lattices, and that the morphisms on either side are not the standard ones. A…
We show that the process of spontaneous symmetry breaking can trap a field theoretic system in a highly non-trivial state containing a lattice of domain walls. In one large compact space dimension, a lattice is inevitably formed. In two…
We characterize all residuated lattices that have height equal to $3$ and show that the variety they generate has continuum-many subvarieties. More generally, we study unilinear residuated lattices: their lattice is a union of disjoint…
The free Banach lattice over a Banach space is introduced and analyzed. This generalizes the concept of free Banach lattice over a set of generators, and allows us to study the Nakano property and the density character of non-degenerate…
We show that finite lattices with arbitrary boundaries may support large degenerate subspaces, stemming from the underlying translational symmetry of the lattice. When the lattice is coupled to an environment, a potentially large number of…
The purpose of this paper is to extend some useful results, such as the multiplication being open, previously known for suitable finitely generated relatively free profinite semigroups, to relatively free profinite semigroupoids over…
Sign imbalance is a statistic on posets which counts the difference between the number of even and odd linear extensions. We prove complexity results about the sign imbalance and parity of linear extensions, focusing on the representative…
Antichains of a finite bounded poset are assigned antichains playing a role analogous to that played by blockers in the Boolean lattice of all subsets of a finite set. Some properties of lattices of generalized blockers are discussed.
We characterize conservative median algebras and semilattices by means of forbidden substructures and by providing their representation as chains. Moreover, using a dual equivalence between median algebras and certain topological…
By median we mean a scheme that inputs three element of a lattice, and outputs an element that is an average of the three inputs in a certain sense. The medians of a given finite lattice form a new lattice that is usually larger than the…
In this note, we discuss planar lattices generated by their atoms. We prove that if $L$ is a planar lattice generated by $n$ atoms, then both the left and the right boundaries of $L$ have at most $n+1$ elements. On the other hand, $L$ can…
This paper studies the differential lattice, defined to be a lattice $L$ equipped with a map $d:L\to L$ that satisfies a lattice analog of the Leibniz rule for a derivation. Isomorphic differential lattices are studied and classifications…
We prove that a tolerance relation of a lattice is a homomorphic image of a congruence relation.
A poset is called upper homogeneous, or "upho," if all of its principal order filters are isomorphic to the whole poset. In previous work of the first author, it was shown that each (finite-type N-graded) upho lattice has associated to it a…
This paper examines operad structures derived from poset matrices by formulating a set of new construction rules for poset matrices. In this direction, eleven different partial composition operations will be introduced as the basis for the…
Define an expansion poset to be the poset of monomials of a cluster variable attached to an arc in a polygon, where each monomial is represented by the corresponding combinatorial object from some fixed combinatorial cluster expansion…
For a closure space (P,f) with f(\emptyset)=\emptyset, the closures of open subsets of P, called the regular closed subsets, form an ortholattice Reg(P,f), extending the poset Clop(P,f) of all clopen subsets. If (P,f) is a finite convex…