Related papers: Join-continuity + Hypercontinuity = Prime continui…

In this paper, a subclass of bounded distributive lattices, that is, finitely disjunctive distributive lattices (FDD-lattices) have been introduced. Then we apply it to establish a Stone duality for Lawson compact algebraic L-domains.…

We give a new proof of the fact that finite bipartite graphs cannot be axiomatized by finitely many first-order sentences among FINITE graphs. (This fact is a consequence of a general theorem proved by L. Ham and M. Jackson, and the…

In contrast to the fact that every completely distributive lattice is necessarily continuous in the sense of Scott, it is shown that complete distributivity of a category enriched over the closed category obtained by endowing the unit…

Dai Pra et al studied two notions of monotonicity for continuous-time Markov processes on a finite partially ordered set (poset), and conjectured that monotonicity equivalence holds for a poset of W-glued diamond, and that there is no other…

We affirm a conjecture of Sacks [1972] by showing that every countable distributive lattice is isomorphic to an initial segment of the hyperdegrees, $\mathcal{D}_{h}$. In fact, we prove that every sublattice of any hyperarithmetic lattice…

This paper first gives a necessary and sufficient condition that a lattice $L$ can be represented as the collection of all up-sets of a poset. Applying the condition, it obtains a necessary and sufficient condition that a lattice can be…

As a corollary to the recent extraordinary theorem of Maynard and Tao, we re-prove, in a stronger form, a result of Shiu concerning "strings" of consecutive, congruent primes.

Super-stability and strong stability are properties of a matching in the stable matching problem with ties. In this paper, we introduce a common generalization of super-stability and strong stability, which we call non-uniform stability.…

We present a short proof of the Jordan-H\"older theorem with uniqueness for semimodular semilattice: Given two maximal chains in a semimodular semilattice of finite height, they both have the same length. Moreover there is a unique…

We consider overdetermined systems of difference equations for a single function $u$ which are consistent, and propose a general framework for their analysis. The integrability of such systems is defined as the existence of higher order…

We consider the interactions of finite dipoles in a doubly-periodic domain. A finite dipole is a pair of equal and opposite strength point vortices separated by a finite distance. The dynamics of multiple finite dipoles in an unbounded…

It is elementary and well-known that if an element x of a bounded modular lattice L has a complement in L then x has a relative complement in every interval [a,b] containing x. We show that the relatively strong assumption of modularity of…

Let p>2 be a prime, K a finite extension over Q_p and G :=Gal(\bar K/K). We extend Kisin's theory on \phi-modules of finite E(u)-height to give a new classification of G-stable Z_p-lattices in semi-stable representations

For a given transitive binary relation e on a set E, the transitive closures of open (i.e., co-transitive in e) sets, called the regular closed subsets, form an ortholattice Reg(e), the extended permutohedron on e. This construction, which…

Two related issues are explored for bond percolation on the d-dimensional cubic lattice (with d > 2) and its dual plaquette process. Firstly, for what values of the parameter p does the complement of the infinite open cluster possess an…

A hyperidentity $E$ can be viewed as a statement in second order logic. When combined with a similarity type $\tau$, it can also be considered as a set of first order statements. Based on examples from "A small basis for…

Composition and lattice join (transitive closure of a union) of equivalence relations are operations taking pairs of decidable equivalence relations to relations that are semi-decidable, but not necessarily decidable. This article addresses…

We characterize the order of principal congruences of a bounded lattice as a bounded ordered set. We also state a number of open problems in this new field.

A brief introduction to the theory of ordered sets and lattice theory is given. To illustrate proof techniques in the theory of ordered sets, a generalization of a conjecture of Daykin and Daykin, concerning the structure of posets that can…

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…