Related papers: Compatible topologies on mixed lattice vector spac…
We introduce a notion of strong proximity join-semilattice, a predicative notion of continuous lattice which arises as the Karoubi envelop of the category of algebraic lattices. Strong proximity join-semilattices can be characterised by the…
We prove a uniformly continuous linear extension principle in topological vector spaces from which we derive a very short and canonical construction of the Lebesgue integral of Banach space valued maps on a finite measure space. The Vitali…
A lattice L is spatial if every element of L is a join of completely join-irreducible elements of L (points), and strongly spatial if it is spatial and the minimal coverings of completely join-irreducible elements are well-behaved.…
In topological phases of matter, the interplay between intrinsic topological order and global symmetry is an interesting task. In the study of topological orders with discrete global symmetry, an important systematic approach is the…
We consider vector lattices endowed with locally solid convergence structures, which are not necessarily topological. We show that such a convergence is defined by the convergence to $0$ on the positive cone. Some results on unbounded…
The aim of this short note is to develop a (co)homology theory for topological spaces together with the specialisation preorder. A known way to construct such a (co)homology is to define a partial order on the topological space starting…
We present a new algorithm for the design of the connection region between different lattice materials. We solve a Stokes-type topology optimization problem on a narrow morphing region to smoothly connect two different unit cells. The…
Flow polytopes of acyclic oriented graphs arise naturally in combinatorial optimization, and the study of their volumes and triangulations has revealed intriguing connections across combinatorics, geometry, algebra, and representation…
We consider the category of all locally Lipschitz contractible metric spaces and all locally Lipschitz maps, which is a wide class of metric spaces, including all finite dimensional Alexandrov spaces and all CAT spaces. We also consider the…
We propose an abstract definition of convex spaces as sets where one can take convex combinations in a consistent way. A priori, a convex space is an algebra over a finitary version of the Giry monad. We identify the corresponding Lawvere…
A linear operator $T$ between two vector lattices normed by locally solid Riesz spaces is said to be $p_\tau$-continuous if, for any $p_\tau$-null net $(x_\alpha)$, the net $(Tx_\alpha)$ is $p_\tau$-null, and $T$ is said to be…
We characterize the polytopes in $\mathbb{R}^d$ (not necessarily convex or connected ones) which multi-tile the space by translations along a given lattice. We also give a necessary and sufficient condition for two polytopes in…
Covering is a common type of data structure and covering-based rough set theory is an efficient tool to process this data. Lattice is an important algebraic structure and used extensively in investigating some types of generalized rough…
We give geometric characterisations of patch and Lawson topologies in the context of predicative point-free topology using the constructive notion of located subset. We present the patch topology of a stably locally compact formal topology…
We develop a theory of large scale geometry of metrisable topological groups that, in a significant number of cases, allows one to define and identify a unique quasi-isometry type intrinsic to the topological group. Moreover, this…
Vortices are localized planar structures that attain topological stability and can be used to describe collective behavior in a diversity of situations of current interest in nonlinear science. In high energy physics, vortices engender…
Realization by linear vector fields is constructed for any Lie algebra which admits a biorthogonal system and for its any suitable representation. The embedding into Lie algebras of linear vector fields is analogous to the classical…
In this paper, we deal with a notion of Banach space-valued mappings defined on a set consisting of finite graphs with uniformly bounded vertex degree. These functions will be endowed with certain boundedness and additivity criteria. We…
A Lattice is a partially ordered set where both least upper bound and greatest lower bound of any pair of elements are unique and exist within the set. K\"{o}tter and Kschischang proved that codes in the linear lattice can be used for error…
In this paper the theory of uniformly convex metric spaces is developed. These spaces exhibit a generalized convexity of the metric from a fixed point. Using a (nearly) uniform convexity property a simple proof of reflexivity is presented…