Related papers: Smallest order closed sublattices and option spann…

Assume that a normed lattice $E$ is order dense majorizing of a vector lattice $E^t$. There is an extension norm $\Vert.\Vert_t$ for $E^t$ and we extend some lattice and topological properties of normed lattice $(E,\Vert.\Vert)$ to new…

Each straight infinite line defined by two vertices of a finite square point lattice contains (covers) these two points and a - possibly empty - subset of points that happen to be collinear to these. This work documents vertex subsets of…

An operator $T$ from vector lattice $E$ into vector topology $(F,\tau)$ is said to be order-to-topology continuous whenever $x_\alpha\xrightarrow{o}0$ implies $Tx_\alpha\xrightarrow{\tau}0$ for each $(x_\alpha)_\alpha\subset E$. The…

Let $G=(V,E)$ be a graph. An ordering of $G$ is a bijection $\alpha: V\dom \{1,2,..., |V|\}.$ For a vertex $v$ in $G$, its closed neighborhood is $N[v]=\{u\in V: uv\in E\}\cup \{v\}.$ The profile of an ordering $\alpha$ of $G$ is…

We construct a metrizable semitopological semilattice $X$ whose partial order $P=\{(x,y)\in X\times X:xy=x\}$ is a non-closed dense subset of $X\times X$. As a by-product we find necessary and sufficient conditions for the existence of a…

Let $G=(V,E)$ be a graph. A subset $S \subseteq V$ is a dominating set of $G$ if every vertex not in $S$ is adjacent to a vertex in $S$. A set $\tilde{D} \subseteq V$ of a graph $G=(V,E) $ is called an outer-connected dominating set for $G$…

An ordered graph $\mathcal{G}$ is a simple graph together with a total ordering on its vertices. The (2-color) Ramsey number of $\mathcal{G}$ is the smallest integer $N$ such that every 2-coloring of the edges of the complete ordered graph…

An ordered Banach space $X$ is said to have the Levi property or to be regular if every increasing order bounded net (equivalently, sequence) is norm convergent. We prove four theorems related to this classical concept: (i) The Levi…

In this paper we study the Y-convexity, a property which is obtained by considering a real Banach sequence lattice Y instead of $\ell^p$ for a linear operator $T : E \rightarrow X$, where E is a Banach space and X is a Banach lattice. We…

Orderability, weak orderability and the existence of continuous weak selections on filter spaces (i.e., spaces with a single non-isolated point) and their products are discussed. We prove that a closed continuous image X of a suborderable…

The Bandwidth Theorem of B\"ottcher, Schacht and Taraz [Mathematische Annalen 343 (1), 175-205] gives minimum degree conditions for the containment of spanning graphs H with small bandwidth and bounded maximum degree. We generalise this…

We study $b$-property of a sublattice (or an order ideal) $F$ of a vector lattice $E$. In particular, $b$-property of $E$ in $E^\delta$, the Dedekind completion of $E$, $b$-property of $E$ in $E^u$, the universal completion of $E$, and…

The subject under study is an open subsystem of a larger linear and conservative system and the way in which it is coupled to the rest of system. Examples are a model of crystalline solid as a lattice of coupled oscillators with a finite…

Entanglement is a digraph complexity measure that origins in fixed-point theory. Its purpose is to count the nested depth of cycles in digraphs. In this paper we prove that the class of undirected graphs of entanglement at most $k$, for…

We propose experimental schemes to create and probe minimum forms of different topologically ordered states in a plaquette of an optical lattice: Resonating Valence Bond, Laughlin and string-net condensed states. We show how to create…

A $k$-ordering of a graph $G$ assigns distinct order-labels from the set $\{1,\ldots,|G|\}$ to $k$ vertices in $G$. Given a $k$-ordering $H$, the ordered Ramsey number $R_<(H)$ is the minimum $n$ such that every edge-2-coloring of the…

This paper introduces a partial order on the maximal chains of any finite bounded poset $P$ which has a CL-labeling $\lambda$. We call this the maximal chain descent order induced by $\lambda$, denoted $P_{\lambda}(2)$. As a first example,…

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…

The XY model (s=1/2) on the one-dimensional alternating superlattice (closed chain) is solved exactly by using a generalized Jordan-Wigner transformation and the Green function method. Closed expressions are obtained for the excitation…

Given an arbitrary spectral space $X$, we endow it with its specialization order $\leq$ and we study the interplay between suprema of subsets of $(X,\leq)$ and the constructible topology. More precisely, we investigate about when the…