Related papers: Completeness for vector lattices
Every Dedekind complete Riesz space X has a unique sup-completion X^{s}, which is a Dedekind complete lattice cone. This paper aims to present a systematic study this cone by extending several known results to general setting, proving new…
The concept of complementability is extended from bounded operators to densely defined operators on Hilbert spaces. By introducing appropriate projections and decomposition techniques, a framework is developed for analyzing…
It is argued that Goedel's incompleteness theorem should be seen as self-evident, rather than unexpected or surprising.
The aim of the present paper is to extend the concept of a congruence from lattices to posets. We use an approach different from that used by the first author and V. Sn\'a\v{s}el. By using our definition we show that congruence classes are…
This article is concerned with the approximation of unbounded convex sets by polyhedra. While there is an abundance of literature investigating this task for compact sets, results on the unbounded case are scarce. We first point out the…
A perfect matching in a hypergraph is a set of edges that partition the set of vertices. We study the complexity of deciding the existence of a perfect matching in orderable and separable hypergraphs. We show that the class of orderable…
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…
In this paper, we study the property of hereditary completeness of vector systems $\{x_k\}_{k=1}^\infty$ in a Hilbert space. A criterion of hereditary completeness is obtained in terms of projectors on closed linear spans of systems of the…
An increasing sequence of integers is said to be universal for knots and links if every knot and link has a projection to the sphere such that the number of edges of each complementary face of the projection comes from the given sequence.…
We call a finitely complete category algebraically coherent when the change-of-base functors of its fibration of points are coherent, which means that they preserve finite limits and jointly strongly epimorphic pairs of arrows. We give…
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…
A lattice L is coordinatizable, if it is isomorphic to the lattice L(R) of principal right ideals of some von Neumann regular ring R. This forces L to be complemented modular. All known sufficient conditions for coordinatizability, due…
A configuration of lattice vectors is supernormal if it contains a Hilbert basis for every cone spanned by a subset. We study such configurations from various perspectives, including triangulations, integer programming and Groebner bases.…
Trees are partial orderings where every element has a linearly ordered set of smaller elements. We define and study several natural notions of completeness of trees, extending Dedekind completeness of linear orders and Dedekind-MacNeille…
In this note, we find a sharp bound for the minimal number (or in general, indexing set) of subspaces of a fixed (finite) codimension needed to cover any vector space V over any field. If V is a finite set, this is related to the problem of…
As the first part of the treatise on A General Theory of Concept Lattice (I-V), this work develops the general concept lattice for the problem concerning categorization of objects according to their properties. Unlike the conventional…
In this paper we define a degree for ends of infinite digraphs. The well-definedness of our definition in particular resolves a problem by Zuther. Furthermore, we extend our notion of end degree to also respect, among others, the vertices…
Representation of convex geometry as an appropriate join of compatible total orderings of the base set can be achieved, when closure operator of convex geometry is algebraic, or finitary. This bears to the finite case proved by P.H.~Edelman…
In this note we introduce a notion of a generically (strongly generically) NP-complete problem and show that the randomized bounded version of the halting problem is strongly generically NP-complete.
Several recent papers investigated unbounded convergences in Banach lattices. Combine all unbounded convergences, including unbounded order (norm, absolute weak, absolute weak*) convergence, we characterize L-weakly compact sets, L-weakly…