Related papers: Not every countable complete lattice is sober

Field theories place one or more degrees of freedom at every point in space. Hilbert spaces describing quantum field theories, or their finite-dimensional discretizations on lattices, therefore have large amounts of structure: they are…

It is proved that any countable topological vector space over a finite field $\mathbb F_p$ or, equivalently, any countable Abelian topological group of prime exponent has a closed discrete basis.

This paper extends the recently obtained complete and continuous map of the Lattice Isometry Space (LISP) to the practical case of dimension 3. A periodic 3-dimensional lattice is an infinite set of all integer linear combinations of basis…

The notion of a capped tensor product, introduced by G. Gr\"{a}tzer and the author, provides a convenient framework for the study of tensor products of lattices that makes it possible to extend many results from the finite case to the…

A space $X$ is called {\it selectively pseudocompact} if for each sequence $(U_{n})_{n\in \mathbb{N}}$ of pairwise disjoint nonempty open subsets of $X$ there is a sequence $(x_{n})_{n\in \mathbb{N}}$ of points in $X$ such that $cl_X(\{x_n…

We call a poset factorable if its characteristic polynomial has all positive integer roots. Inspired by inductive and divisional freeness of a central hyperplane arrangement, we introduce and study the notion of inductive posets and their…

Assume that $k$ is an algebraically closed field and $A$ is a finite-dimensional wild $k$-algebra. Recently, L. Gregory and M. Prest proved that in this case the width of the lattice of all pointed $A$-modules is undefined and hence there…

For P a poset or lattice, let Id(P) denote the poset, respectively, lattice, of upward directed downsets in P, including the empty set, and let id(P)=Id(P)-\{\emptyset\}. This note obtains various results to the effect that Id(P) is always,…

In this thesis we will present and discuss various results pertaining to tiling problems and mathematical logic, specifically computability theory. We focus on Wang prototiles, as defined in [32]. We begin by studying Domino Problems, and…

The class of uniformly smooth hyperbolic spaces was recently introduced by the first author as a common generalization of both CAT(0) spaces and uniformly smooth Banach spaces, in a way that Reich's theorem on resolvent convergence could…

Finite smooth digraphs, that is, finite directed graphs without sources and sinks, can be partially ordered via pp-constructability. We give a complete description of this poset and, in particular, we prove that it is a distributive…

In 1972, Dana Scott proved a fundamental result on the connection between order and topology which says that injective $T_0$ spaces are precisely continuous lattices endowed with Scott topology. This paper investigates whether this is true…

We first show that in the function realizability topos every metric space is separable, and every object with decidable equality is countable. More generally, working with synthetic topology, every $T_0$-space is separable and every…

Recall that a space X is selectively pseudocompact if for every sequence (U_n) of non-empty open subsets of X one can choose a point x_n in U_n for all n such that the resulting sequence (x_n) has an accumulation point in X. This notion was…

Let $L$ be an even, hyperbolic lattice with infinitely many simple $(-2)$-roots. We call $L$ a Borcherds lattice if it admits an isotropic vector with bounded inner product with all the simple $(-2)$-roots. We show that this is the case if…

Let $(X,\mathcal{O}_X(1))$ be a polarized smooth projective variety over the complex numbers. Fix $\mathcal{D}\in \mathrm{coh}(X)$ and a nonnegative rational polynomial $\delta$. Using GIT we contruct a coarse moduli space for…

Suppose X/Gamma is an arithmetic locally symmetric space of noncompact type (with the natural metric induced by the Killing form of the isometry group of X), and let p be a point on the visual boundary of X. It was shown by T.Hattori that…

An $N$-free poset is a poset whose comparability graph does not embed an induced path with four vertices. We use the well-quasi-order property of the class of countable $N$-free posets and some labelled ordered trees to show that a…

This article continues the study of computable elementary topology started by the author and T. Grubba in 2009 and extends the author's 2010 study of axioms of computable separation. Several computable T3- and Tychonoff separation axioms…

We study the computational complexity of satisfiability problems for classes of simple finite height (ortho)complemented modular lattices $L$. For single finite $L$, these problems are shown tobe $\mc{NP}$-complete; for $L$ of height at…