English
Related papers

Related papers: Smallest order closed sublattices and option spann…

200 papers

We present tight bounds on the spanning ratio of a large family of ordered $\theta$-graphs. A $\theta$-graph partitions the plane around each vertex into $m$ disjoint cones, each having aperture $\theta = 2 \pi/m$. An ordered $\theta$-graph…

Computational Geometry · Computer Science 2016-02-02 Prosenjit Bose , Pat Morin , André van Renssen

Given a Banach space X, denote by SP_{w}(X) the set of equivalence classes of spreading models of X generated by normalized weakly null sequences in X. It is known that SP_{w}(X) is a semilattice, i.e., it is a partially ordered set in…

Functional Analysis · Mathematics 2007-08-24 Denny H. Leung , Wee-Kee Tang

We study the congruence lattice of the poset of regions of a hyperplane arrangement, with particular emphasis on the weak order on a finite Coxeter group. Our starting point is a theorem from a previous paper which gives a geometric…

Combinatorics · Mathematics 2026-05-13 Nathan Reading

A specialization semilattice is a join semilattice together with a coarser preorder $ \sqsubseteq $ satisfying an appropriate compatibility condition. If $X$ is a topological space, then $(\mathcal P(X), \cup, \sqsubseteq )$ is a…

Rings and Algebras · Mathematics 2022-08-23 Paolo Lipparini

We investigate the descriptive complexity of order convergence in separable Banach lattices. While uniform convergence is Borel and $\sigma$-order convergence is known to be ${\bf \Delta}^1_2$, it is unclear in general when $\sigma$-order…

Functional Analysis · Mathematics 2026-04-06 Antonio Avilés , Christian Rosendal , Mitchell A. Taylor , Pedro Tradacete

The aim of this article is to extend results of M.~Popov and second named author about orthogonally additive narrow operators on vector lattices. The main object of our investigations are an orthogonally additive narrow operators between…

Functional Analysis · Mathematics 2015-10-01 Xiao Chun Fang , Marat Pliev

Let $(x_n)$ be a normalized weakly null sequence in a Banach space and let $\varep>0$. We show that there exists a subsequence $(y_n)$ with the following property: $$\hbox{ if }\ (a_i)\subseteq \IR\ \hbox{ and }\ F\subseteq \nat$$ satisfies…

Functional Analysis · Mathematics 2008-02-03 Edward Odell

Let $X$ be an ordered vector space. The net $\{x_\alpha\}\subseteq X$ is semi unbounded order convergent to $x$ (in symbol $x_\alpha\xrightarrow{suo}x$), if there is a net $\{y_\beta\}$, possibly over a different index set, such that…

Functional Analysis · Mathematics 2022-01-03 Masoumeh Ebrahimzadeh , Kazem Haghnejad Azar

A Hausdorff topological group is called minimal if it does not admit a strictly coarser Hausdorff group topology. This paper mostly deals with the topological group $H_+(X)$ of order-preserving homeomorphisms of a compact linearly ordered…

General Topology · Mathematics 2015-06-19 Michael Megrelishvili , Luie Polev

In this paper we consider the relationship between order and topology in the vector lattice $C_b(X)$ of all bounded continuous functions on a Hausdorff space $X$. We prove that the restriction of $f\in C_b(X)$ to a closed set $A$ induces an…

Functional Analysis · Mathematics 2019-11-18 Marko Kandić , Aleš Vavpetič

A rack is a set with a binary operation such that left multiplications are automorphisms of the set and a quandle is a rack satisfying a certain condition. Let $S$ be a subset of a finite group $G$ which is closed under the conjugation…

Group Theory · Mathematics 2024-10-08 Selçuk Kayacan

We investigate robust Orlicz spaces as a generalisation of robust $L^p$-spaces. Two constructions of such spaces are distinguished, a top-down approach and a bottom-up approach. We show that separability of robust Orlicz spaces or their…

Probability · Mathematics 2021-05-11 Felix-Benedikt Liebrich , Max Nendel

The aim of this article is to extend results of Maslyuchenko O., Mykhaylyuk V. Popov M. about narrow operators on vector lattices. We give a new definition of a narrow operator where a vector lattice as the domain space of a narrow operator…

Functional Analysis · Mathematics 2013-09-24 M. Pliev

The purpose of this article is to propose and investigate a partial order structure weaker than the lattice structure and which have nice properties regarding closure operators. We extend accordingly closed pattern mining and formal concept…

Logic in Computer Science · Computer Science 2021-02-25 Henry Soldano

We study the construction of the minimum cost spanning geometric graph of a given rooted point set $P$ where each point of $P$ is connected to the root by a path that satisfies a given property. We focus on two properties, namely the…

Computational Geometry · Computer Science 2017-01-27 Konstantinos Mastakas , Antonios Symvonis

A subset of vertices of a graph is minimal if, within all subsets of the same size, its vertex boundary is minimal. We give a complete, geometric characterization of minimal sets for the planar integer lattice X. Our characterization…

Combinatorics · Mathematics 2020-09-28 Radhika Gupta , Ivan Levcovitz , Alexander Margolis , Emily Stark

We study uO convergence on infinitely distributive lattices, extending key properties known from Riesz spaces. We show that order continuity of uO convergence characterizes infinite distributivity. We examine O-adherence and uO adherence of…

Functional Analysis · Mathematics 2025-06-12 Abela Kevin , Chetcuti Emmanuel

In this paper we study the norm-attainment of positive operators between Banach lattices. By considering an absolute version of James boundaries, we prove that: If $E$ is a reflexive Banach lattice whose order is given by a basis and $F$ is…

Functional Analysis · Mathematics 2025-07-03 José Lucas P. Luiz , Vinícius C. C. Miranda

The C-minor partial orders determined by the clones generated by a semilattice operation (and possibly the constant operations corresponding to its identity or zero elements) are shown to satisfy the descending chain condition.

Rings and Algebras · Mathematics 2016-05-17 Erkko Lehtonen

For a (possibly infinite) fixed family of graphs F, we say that a graph G overlays F on a hypergraph H if V(H) is equal to V(G) and the subgraph of G induced by every hyperedge of H contains some member of F as a spanning subgraph.While it…

Data Structures and Algorithms · Computer Science 2017-03-16 Nathann Cohen , Frédéric Havet , Dorian Mazauric , Ignasi Sau , Rémi Watrigant