Related papers: Poset representations of distributive semilattices

We introduce a new method for showing that the roots of the characteristic polynomial of certain finite lattices are all nonnegative integers. This method is based on the notion of a quotient of a poset which will be developed to explain…

This paper discusses the split feasibility problem with polynomials. The sets are semi-algebraic, defined by polynomial inequalities. They can be either convex or nonconvex, either feasible or infeasible. We give semidefinite relaxations…

In this article, we prove that finite semidistributive lattices are dismantlable if and only if they are planar. This extends a well-known result by Kelly and Rival that states the same property for finite distributive lattices. Moreover,…

D.Happel and L.Unger defined a partial order on the set of basic tilting modules. We study the poset of basic pre-projective tilting modules over path algebra of infinite type. We give an equivalent condition for that this poset is a…

Properties of several sorts of lattices of convex subsets of R^n are examined. The lattice of convex sets containing the origin turns out, for n>1, to satisfy a set of identities strictly between those of the lattice of all convex subsets…

We characterize well-founded algebraic lattices by means of forbidden subsemilattices of the join-semilattice made of their compact elements. More specifically, we show that an algebraic lattice $L$ is well-founded if and only if $K(L)$,…

In this paper, we provide an alternative description of the duality result for distributive lattices and coherent locales using ultraposet. In particular, we show that there are fully faithful embeddings from the opposite of the category of…

A specialization semilattice is a structure which can be embedded into $(\mathcal P(X), \cup, \sqsubseteq )$, where $X$ is a topological space, $ x \sqsubseteq y$ means $x \subseteq Ky$, for $x,y \subseteq X$, and $K$ is closure in $X$.…

In 2008, M. Marshall settled a long-standing open problem by showing that if f(x,y) is a polynomial that is non-negative on the strip [0,1] x R, then there exist sums of squares s(x,y) and t(x,y) such that f(x,y) = s(x,y) + (x - x^2)…

An instance of a strongly stable matching problem (SSMP) is an undirected bipartite graph $G=(A \cup B, E)$, with an adjacency list of each vertex being a linearly ordered list of ties, which are subsets of vertices equally good for a given…

It is an easy observation that every residuated lattice is in fact a semiring because multiplication distributes over join and the other axioms of a semiring are satisfied trivially. This semiring is commutative, idempotent and simple. The…

A lattice is called well-rounded if its minimal vectors span the corresponding Euclidean space. In this paper we completely describe well-rounded full-rank sublattices of ${\mathbb Z}^2$, as well as their determinant and minima sets. We…

We prove a simple formula for arbitrary cluster variables in the marked surfaces model. As part of the formula, we associate a labeled poset to each tagged arc, such that the associated $F$-polynomial is a weighted sum of order ideals. Each…

A partial lattice P is ideal-projective, with respect to a class C of lattices, if for every K $\in$ C and every homomorphism $\phi$ of partial lattices from P to the ideal lattice of K, there are arbitrarily large choice functions f : P…

We prove a representation theorem for totally ordered idempotent monoids via a nested sum construction. Using this representation theorem we obtain a characterization of the subdirectly irreducible members of the variety of semilinear…

For a positive integer n and a subset S of [n-1], the descent polytope DP_S is the set of points x_1, ..., x_n in the n-dimensional unit cube [0,1]^n such that x_i >= x_{i+1} for i in S and x_i <= x_{i+1} otherwise. First, we express the…

Let alpha = (a,b,...) be a composition. Consider the associated poset F(alpha), called a fence, whose covering relations are x_1 < x_2 < ... < x_{a+1} > x_{a+2} > ... > x_{a+b+1} < x_{a+b+2} < ... . We study the associated distributive…

Dualization of a monotone Boolean function on a finite lattice can be represented by transforming the set of its minimal 1 to the set of its maximal 0 values. In this paper we consider finite lattices given by ordered sets of their meet and…

Birkhoff's representation theorem for finite distributive lattices states that any finite distributive lattice is isomorphic to the lattice of order ideals (lower sets) of the partial order of the join-irreducible elements of the lattice.…

Distributive skew lattices satisfying $x\wedge (y\vee z)\wedge x = (x\wedge y\wedge x) \vee (x\wedge z\wedge x)$ and its dual are studied, along with the larger class of linearly distributive skew lattices, whose totally preordered…