Related papers: The Blackwell relation defines no lattice

We give an effective upper bound on the h^*-polynomial of a lattice polytope in terms of its degree and leading coefficient, confirming a conjecture of Batyrev. We deduce this bound as a consequence of a strong Cayley decomposition theorem…

This note reformulates certain classical combinatorial duality theorems in the context of order lattices. For source-target networks, we generalize bottleneck path-cut and flow-cut duality results to edges with capacities in a distributive…

In queuing theory, it is usual to have some models with a "reset" of the queue. In terms of lattice paths, it is like having the possibility of jumping from any altitude to zero. These objects have the interesting feature that they do not…

In development of the started activity on lattice analogues of $W$-algebras, we define the notion of lattice $W_{\infty}$-algebra, accociated with lattice integrable system with infinite set of fields. Various kinds of reduction to lattice…

Bilattice-based triangle provides an elegant algebraic structure for reasoning with vague and uncertain information. But the truth and knowledge ordering of intervals in bilattice-based triangle can not handle repetitive belief revisions…

We denote by Conc(L) the semilattice of all finitely generated congruences of a lattice L. For varieties (i.e., equational classes) V and W of lattices such that V is contained neither in W nor its dual, and such that every simple member of…

For a presentation $\mathcal{A}$ of a transversal matroid $M$, we study the set $T_{\mathcal{A}}$ of single-element transversal extensions of $M$ that have presentations that extend $\mathcal{A}$; we order these extensions by the weak…

In the process of constructing invariant difference schemes which approximate partial differential equations we write down a procedure for discretizing an arbitrary partial differential equation on an arbitrary lattice. An open problem is…

We prove that the following three properties can not match each other on a lattice, that differentials of coordinate functions are algebraically dependent to their involutive conjugates, that the involution on a lattice is an…

In this paper we consider a general way of constructing profinite struc- tures based on a given framework - a countable family of objects and a countable family of recognisers (e.g. formulas). The main theorem states: A subset of a family…

This paper deals with join-semilattices whose sections, i.e. principal filters, are pseudocomplemented lattices. The pseudocomplement of a\vee b in the section [b,1] is denoted by a\rightarrow b and can be considered as the connective…

This paper focuses on analyzing and differentiating between lattice linear problems and algorithms. It introduces a new class of algorithms called \textit{(fully) lattice linear algorithms}. A property of these algorithms is that they…

We introduce a pointfree theory of convergence on lattices and coframes. A convergence lattice is a lattice $L$ with a monotonic map $\lim_L$ from the lattice of filters on $L$ to $L$, meant to be an abstract version of the map sending…

For a many-to-many matching market, we study the lattice structure of the set of random stable matchings. We define a partial order on the random stable set and present two intuitive binary operations to compute the least upper bound and…

Locales have been studied as "topologies without points", mainly by tools of category theory. While traditional topology presents a space as a set of points with specified neighborhoods, localic topology presents a space as a lattice of…

We construct a monadic second-order sentence that characterizes the ternary relations that are the betweenness relations of finite or infinite partial orders. We prove that no first-order sentence can do that. We characterize the partial…

Relational lattice reduces the set of six classic relational algebra operators to two binary lattice operations: natural join and inner union. We give an introduction to this theory with emphasis on formal algebraic laws. New results…

We show that every family of quasi-arithmetic means generated by (a subset of) $\mathcal{C}^1$ functions with nonvanishing derivative which is bounded (from below or from above) by a quasi-arithmetic mean, possesses the best (lower or…

This paper develops a detailed lattice-continuum correspondence for all common examples of Abelian gauge theories, with and without matter. These rules for extracting a continuum theory out of a lattice one represent an elementary way to…

Zilber's Theorem states that a finite lattice $L$ is planar if{}f it has a complementary order relation. We provide a new proof for this crucial result and discuss some applications, including a canonical form for finite planar lattices and…