English
Related papers

Related papers: Relative uniform completion of a vector lattice

200 papers

We study several separation axioms for $X$-top-lattices (i.e. a lattice $L$ for which a given subset $X\subseteq L\backslash \{1\}$ admits a \emph{% Zariski-like topology}). Such spaces are $T_{0}$ and usually far away from being $T_{2}.$…

Rings and Algebras · Mathematics 2026-01-14 Jawad Abuhlail , Abdulmushin Alfaraj

Properties of several sorts of lattices of convex subsets of R^n are examined. The lattice of convex sets containing the origin turns out, for n>1, to satisfy a set of identities strictly between those of the lattice of all convex subsets…

Metric Geometry · Mathematics 2007-06-13 George M. Bergman

We prove a general categorical theorem that enables us to state that under certain conditions, the range of a functor is large. As an application, we prove various results of which the following is a prototype: If every diagram, indexed by…

General Mathematics · Mathematics 2007-05-23 Friedrich Wehrung

The "Up-and-down" theorem which describes the structure of the Boolean algebra of fragments of a linear positive operator is the well known result of the operator theory. We prove an analog of this theorem for a positive abstract Uryson…

Functional Analysis · Mathematics 2015-07-29 Marat A. Pliev

We study online robust matrix completion on graphs. At each iteration a vector with some entries missing is revealed and our goal is to reconstruct it by identifying the underlying low-dimensional subspace from which the vectors are drawn.…

Information Theory · Computer Science 2016-05-16 Symeon Chouvardas , Mohammed Amin Abdullah , Lucas Claude , Moez Draief

Rough sets are efficient for data pre-processing in data mining. Matroids are based on linear algebra and graph theory, and have a variety of applications in many fields. Both rough sets and matroids are closely related to lattices. For a…

Artificial Intelligence · Computer Science 2013-12-17 Qingyin Li , William Zhu

Given an Archimedean vector lattice $E$, we present one elementary property of $E$ which is equivalent to the entire traditional list of axioms which makes $E$ a $\Phi$-algebra. We call a vector lattice with this property ``square closed".…

Functional Analysis · Mathematics 2025-10-21 Christopher Schwanke

The notion of a Levi operator is an operator abstraction of the Levy property of a norm or, more generally of the Levi topology on a locally solid vector lattice. Various aspects of Levi operators have been studied recently by several…

Functional Analysis · Mathematics 2025-06-24 Eduard Emelyanov

A closure operator on a set $X$ is a function $\operatorname{cl}: \wp(X) \to \wp(X)$ satisfying, for all $A, B \subseteq X$, the following properties: extensivity, $A \subseteq \operatorname{cl}(A)$; monotonicity, which states that if $A…

Combinatorics · Mathematics 2026-03-17 Paulo Magalhães Junior , Renan Maneli Mezabarba , Rodrigo Santos Monteiro

Let $\mathcal{M}=\{m_\lambda\}_{\lambda\in\Lambda}$ be a separating family of lattice seminorms on a vector lattice $X$, then $(X,\mathcal{M})$ is called a multi-normed vector lattice (or MNVL). We write $x_\alpha \xrightarrow{\mathrm{m}}…

Functional Analysis · Mathematics 2017-06-21 Y. A. Dabboorasad , E. Y. Emelyanov , M. A. A. Marabeh

In this paper we prove a Hille-Yosida type theorem for relatively uniformly continuous positive semigroups on vector lattices. We introduce the notions of relatively uniformly continuous, differentiable, and integrable functions on…

Functional Analysis · Mathematics 2019-12-02 M. Kaplin , M. Kramar Fijavz

We provide conditions under which a modular function defined on a semilattice $X$ and with values in a commutative group is homomorphic to a modular function on a lattice $L$ for any embedding $X\hookrightarrow L$.

Probability · Mathematics 2020-03-03 Gianluca Cassese

We study deterministic constructions of graphs for which the unique completion of low rank matrices is generically possible regardless of the values of the entries. We relate the completability to the presence of some patterns (particular…

Information Theory · Computer Science 2026-01-01 Augustin Cosse

The Sasaki projection was introduced as a mapping from the lattice of closed subspaces of a Hilbert space onto one of its segments. To use this projection and its dual so-called Sasaki operations were introduced by the second two authors.…

Logic · Mathematics 2024-12-23 Václav Cenker , Ivan Chajda , Helmut Länger

For a vector field $X$ on a smooth manifold $M$ there exists a smooth but not necessarily Hausdorff manifold $M_\Bbb R$ and a complete vector field $X_\Bbb R$ on it which is the universal completion of $(M,X)$.

Differential Geometry · Mathematics 2007-05-23 Franz W. Kamber , Peter W. Michor

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

Let $X$ be a normal, connected and projective variety over an algebraically closed field $k$. It is known that a vector bundle $V$ on $X$ is essentially finite if and only if it is trivialized by a proper surjective morphism $f:Y\to X$. In…

Algebraic Geometry · Mathematics 2017-02-14 Fabio Tonini , Lei Zhang

For a partially ordered set P, let Co(P) denote the lattice of all order-convex subsets of P. For a positive integer n, we denote by SUB(LO) (resp., SUB(n)) the class of all lattices that can be embedded into a product of lattices of convex…

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

Relatively uniformly continuous (ruc) semigroups were recently introduced and studied by Kandi\'c, Kramar-Fijav\v{z}, and the second-named author, in order to make the theory of one-parameter operator semigroups available in the setting of…

Functional Analysis · Mathematics 2023-08-30 Jochen Glück , Michael Kaplin

We introduce a new class of abstract structures, which we call generalized ultrametric semilattices, and in which the meet operation of the semilattice coexists with a generalized distance function in a tightly coordinated way. We prove a…

Logic in Computer Science · Computer Science 2013-09-05 Eleftherios Matsikoudis , Edward A. Lee
‹ Prev 1 4 5 6 7 8 10 Next ›