Related papers: Free uniformly complete vector lattices
We show that a free vector lattice over a real vector space $V$ can be realised canonically as a vector lattice of real-valued positively homogeneous functions on any linear subspace of its dual space that separates the points of $V$. This…
We study completions of Archimedean vector lattices relative to any nonempty set of positively-homogeneous functions on finite-dimensional real vector spaces. Examples of such completions include square mean closed and geometric closed…
We provide a representation of the homomorphisms $U\longrightarrow \mathbb R$, where $U$ is the lattice of all uniformly continuous on the line. The resulting picture is sharp enough to describe the fine topological structure of the space…
We show how the existence of various free vector lattices and free vector lattice algebras can be derived from a theorem on equational classes in universal algebra. A discussion about free $f$-algebras over non-empty sets is given, where…
A periodic lattice in Euclidean 3-space is the infinite set of all integer linear combinations of basis vectors. Any lattice can be generated by infinitely many different bases. This ambiguity was only partially resolved, but standard…
In the category \(\mathbf{V}\) of unital archimedean vector lattices, four notions of uniform completeness obtain. In all cases completeness requires the convergence of uniformly Cauchy sequences; the completions are distinguished by the…
The notion of unboundedly order converges has been recieved recently a particular attention by several authors. The main result of the present paper shows that the notion is efficient and deserves that care. It states that a vector lattice…
We characterize the Archimedean vector lattices that admit a positively homogeneous continuous function calculus by showing that the following two conditions are equivalent for each $n$-tuple $\boldsymbol{x} = (x_1,\ldots,x_n)\in X^n$,…
Gaussian elimination answers any question about a finitely presented vector space. However, a "uniform family" of such presentations--given as generic relations among an unspecified number of generators--is susceptible to elimination only…
We introduce and study the notion of orthosymmetric spaces over an Archimedean vector lattice as a generalization of finite-dimentional Euclidean inner spaces. A special attention has been paid to linear operators on these spaces.
We prove that a variety of algebras whose finitely generated members are free must be definitionally equivalent to the variety of sets, the variety of pointed sets, a variety of vector spaces over a division ring, or a variety of affine…
It is observed that a constant unit vector denoted by $\mathbf I$ is needed to characterize a complete orthonormal set of vector diffraction-free beams. The previously found diffraction-free beams are shown to be included as special cases.…
We continue our work on the model theory of free lattices, solving two of the main open problems from our first paper on the subject. Our main result is that the universal (existential) theory of infinite free lattices is decidable. Our…
Given a reference lattice, we define fuzzy intervals to be the fuzzy sets such that their p-cuts are crisp closed intervals. We show that: given a complete reference lattice, the collection of its fuzzy intervals is a complete lattice.…
We develop a functional calculus on Archimedean vector lattices for semicontinuous positively homogeneous real-valued functions defined on $\R^n$ which are bounded on the unit sphere. It is further shown that this semicontinuous Archimedean…
In the paper, we revisit several approaches to the concept of uniform completion $X^{\mathrm{ru}}$ of a vector lattice $X$. We show that many of these approaches yield the same result. In particular, if $X$ is a sublattice of a uniformly…
A collection of vectors in a real vector space is called a unimodular system if any of its maximal linearly independent subsets generates the same free abelian group. This notion is closely connected with totally unimodular matrices: rows…
The notion of {\it free} generalized vertex algebras is introduced. It is equivalent to the notion of {\it generalized principal subspaces} associated with lattices which are not necessarily integral. Combinatorial bases and the characters…
We prove an explicit upper bound on the number of real quadratic fields that admit a universal quadratic form of a given rank, thus establishing a density zero statement. More generally, we obtain such a result for totally positive definite…
This paper illustrates the combinatorial approach to vertex algebra - study of vertex algebras presented by generators and relations. A necessary ingredient of this method is the notion of free vertex algebra. Borcherds \cite{bor} was the…