English
Related papers

Related papers: Unbounded Order Convergence and Universal Completi…

200 papers

We prove that the problems of representing a finite ordered complemented semigroup or finite lattice-ordered semigroup as an algebra of binary relations over a finite set are undecidable. In the case that complementation is taken with…

Logic · Mathematics 2015-03-17 Murray Neuzerling

This paper has been withdrawn by the authors due to a crucial computational error. In this paper we deal with the finite case. We prove that a finite bounded ordered set can be represented as the order of principal congruences of a finite…

Rings and Algebras · Mathematics 2013-04-02 G. Grätzer , E. T. Schmidt

Let $(x_\alpha)$ be a net in a vector lattice normed by locally solid lattice $(X,p,E_\tau)$. We say that $(x_\alpha)$ is unbounded $p_\tau$-convergent to $x\in X$ if $p(\lvert x_\alpha-x\rvert\wedge u)\xrightarrow{\tau} 0$ for every $u\in…

Functional Analysis · Mathematics 2018-11-16 Abdulla Aydın

In this note, we show that the order convergence in a vector lattice $X$ is not topological unless $\dim X<\infty$. Furthermore, we show that, in atomic order continuous Banach lattices, the order convergence is topological on order…

Functional Analysis · Mathematics 2017-05-30 Y. A. Dabboorasad , E. Y. Emelyanov , M. A. A. Marabeh

One of the longstanding problems in universal algebra is the question of which finite lattices are isomorphic to the congruence lattices of finite algebras. This question can be phrased as which finite lattices can be represented as…

Combinatorics · Mathematics 2014-12-25 Jeremy F. Alm , John W. Snow

Unbounded order convergence has lately been systematically studied as a generalization of almost everywhere convergence to the abstract setting of vector and Banach lattices. This paper presents a duality theory for unbounded order…

Functional Analysis · Mathematics 2017-05-18 Niushan Gao , Denny H. Leung , Foivos Xanthos

The congruence lattices of all algebras defined on a fixed finite set $A$ ordered by inclusion form a finite atomistic lattice $\mathcal E$. We describe the atoms and coatoms. Each meet-irreducible element of $\mathcal E$ being determined…

General Mathematics · Mathematics 2017-02-27 Danica Jakubíková-Studenovská , Reinhard Pöschel , Sándor Radeleczki

Based on the concept of unbounded absolutely weakly convergence, we give new characterizations of L-weakly compact sets. As applications, we find some properties of order weakly compact operators. Also, a new characterizations of order…

Functional Analysis · Mathematics 2020-05-05 Hassan Khabaoui , Jawad H'michane , Kamal El Fahri

Several recent papers investigated unbounded and statistical versions of order convergence and topology convergence in locally solid Riesz space. In this papers, we study the statistical unbounded order and topology convergence in Riesz…

Functional Analysis · Mathematics 2019-09-12 Zhangjun Wang , Zili Chen , Jinxi Chen

A net $(x_\alpha)_{\alpha\in \Gamma}$ in a vector lattice $X$ is unbounded order convergent (uo-convergent) to $x$ if $|x_\alpha-x| \wedge y \xrightarrow{o} 0$ for each $y \in X_+$, and is unbounded order Cauchy (uo-Cauchy) if the net…

Functional Analysis · Mathematics 2013-06-12 Niushan Gao , Foivos Xanthos

We describe a natural generalization of irreducibility in order lattices with arbitrary metrics. We analyse the special cases of valuation metrics and more general metrics for lattices. This article is mainly based on a part of the author's…

Metric Geometry · Mathematics 2010-05-28 Andreas Lochmann

For a partially ordered set P, we denote by Co(P) the lattice of order-convex subsets of P. We find three new lattice identities, (S), (U), and (B), such that the following result holds. Theorem. Let L be a lattice. Then L embeds into some…

General Mathematics · Mathematics 2007-05-23 Marina V. Semenova , Friedrich Wehrung

We show that all balanced d-lattices must be complemented, answering a question of Chajda and Eigenthaler. (A bounded lattice is balanced if any two congruences agree on their 1-classes iff they agree on their 0-classes.) Our main tool is…

Rings and Algebras · Mathematics 2007-05-23 Martin Goldstern , Miroslav Ploscica

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…

Rings and Algebras · Mathematics 2021-04-29 Kirby A. Baker , George Grätzer

We give several characterizations of order continuous vector lattice homomorphisms between Archimedean vector lattices. We reduce the proofs of some of the equivalences to the case of composition operators between vector lattices of…

Functional Analysis · Mathematics 2024-03-13 Eugene Bilokopytov

We study first-order concatenation theory with bounded quantifiers. We give axiomatizations with interesting properties, and we prove some normal-form results. Finally, we prove a number of decidability and undecidability results.

Logic · Mathematics 2020-03-12 Lars Kristiansen , Juvenal Murwanashyaka

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…

Combinatorics · Mathematics 2019-04-12 Henri Mühle

We define bidual bounded $uo$-convergence in vector lattices and investigate relations between this convergence and $b$-property. We prove that for a regular Riesz dual system $\langle X,X^{\sim}\rangle$, $X$ has $b$-property if and only if…

Functional Analysis · Mathematics 2020-09-17 Safak Alpay , Eduard Emelyanov , Svetlana Gorokhova

This paper introduces the order-theoretic concept of lattices along with the concept of consistent quantification where lattice elements are mapped to real numbers in such a way that preserves some aspect of the order-theoretic structure.…

Logic in Computer Science · Computer Science 2018-07-23 Kevin H. Knuth

In algebraic number theory, the finiteness of the Picard group of an order in a number field is generally proved via a lattice argument: the order forms a lattice and every ideal class contains an integral ideal with a small enough non-zero…

Number Theory · Mathematics 2021-11-02 Daniël M. H. van Gent