Related papers: Lattice uniformities on effect algebras

For a lattice L with 0 and 1, let Princ L denote the ordered set of principal congruences of L. For {0,1}-sublattices A subseteq B of L, congruence generation defines a natural map from Princ A to Princ B. In this way, we obtain a small…

It is shown that, given a lattice H in a totally disconnected, locally compact group G, the contraction subgroups in G and the values of the scale function on G are determined by their restrictions to H. Group theoretic properties intrinsic…

Let $L$ be a lattice. We call a congruence relation $\gQ$ of $L$ isoform, if any two congruence classes of $\gQ$ are isomorphic (as lattices). Let us call the lattice $L$ isoform, if all congruences of $L$ are isoform. G. Gr\"atzer and…

It is shown that the universal theory of the free pseudocomplemented distributive lattice is decidable and a recursive axiomatization is presented. This contrasts with the case of the full elementary theory of the finitely generated free…

An incline is an additively idempotent semiring in which the product of two elements is always less than or equal to either factor. This paper proves that the only regular inclines are distributive lattices, which also implies that there is…

Let $E$ and $F$ be Banach lattices. Let $G$ be a vector sublattice of $E$ and $T: G\rightarrow F$ be an order continuous positive compact (resp. weakly compact) operators. We show that if $G$ is an ideal or an order dense sublattice of $E$,…

Let S be the set of scalings 1, 2,3,4, ... and consider the corresponding set of scaled lattices in the plane. In this paper averaging operators are defined for plaquette functions on a lattice to plaquette functions on a coarser lattice…

The classical theorems of Banach and Stone, Gelfand and Kolmogorov, and Kaplansky show that a compact Hausdorff space $X$ is uniquely determined by the linear isometric structure, the algebraic structure, and the lattice structure,…

We show that all finite lattices, including non-distributive lattices, arise as stable matching lattices when all agents have path-independent choice functions. This result answers an open question of Blair~\cite{blair1988lattice}. In the…

In this paper we introduce the notion of $\mathcal{I^*}\text{-}\alpha$-uniform equal convergence and $\mathcal{I^*}\text{-}\alpha$-strong uniform equal convergence of sequences of functions and then investigate some lattice properties of…

Covering is a common type of data structure and covering-based rough set theory is an efficient tool to process this data. Lattice is an important algebraic structure and used extensively in investigating some types of generalized rough…

Let $\Omega \subset \mathbb{C}^n$ be a bounded domain and let $\mathcal{A} \subset \mathcal{C}(\bar{\Omega})$ be a uniform algebra generated by a set $F$ of holomorphic and pluriharmonic functions. Under natural assumptions on $\Omega$ and…

Let E be a locally solid vector lattice. In this paper, we consider two particular vector subspaces of the space of all order bounded operators on E. With the aid of two appropriate topologies, we show that under some conditions, they…

Let $X$ be a vector lattice and $(E,\tau)$ be a locally solid vector lattice. An operator $T:X\to E$ is said to be $ob$-bounded if, for each order bounded set $B$ in $X$, $T(B)$ is topologically bounded in $E$. In this paper, we study on…

Under very general conditions it is shown that if $A$ is a uniform algebra generated by real-analytic functions, then either $A$ consists of all continuous functions or else there exists a disc on which every function in $A$ is holomorphic.…

We show that the algebraic aspects of Lie symmetries and generalized symmetries in nonrelativistic and relativistic quantum mechanics can be preserved in linear lattice theories. The mathematical tool for symmetry preserving discretizations…

We prove that there is a lattice embedded from every countable distributive lattice into the Boolean algebra of computable subsets of $\mathbb{N}$. Along the way, we discuss all relevant results about lattices, Boolean algebras and…

A comprehensive overview of lattice rules and polynomial lattice rules is given for function spaces based on $\ell_p$ semi-norms. Good lattice rules and polynomial lattice rules are defined as those obtaining worst-case errors bounded by…

We investigate the alternate order on a congruence-uniform lattice $\mathcal{L}$ as introduced by N. Reading, which we dub the core label order of $\mathcal{L}$. When $\mathcal{L}$ can be realized as a poset of regions of a simplicial…

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…