Related papers: Countable homogeneous lattices
We characterize supersolvable lattices in terms of a certain modular type relation. McNamara and Thomas earlier characterized this class of lattices as those graded lattices having a maximal chain that consists of left-modular elements. Our…
We shall prove that a moduli space of flat irreducible Lie algebroid connections over a compact manifold has locally a natural structure of a smooth differentiable space. This is a generalization of some well known results for the moduli…
A resolution of the intersection of a finite number of subgroups of an abelian group by means of their sums is constructed, provided the lattice generated by these subgroups is distributive. This is used for detecting singularities of…
Let $n$ be a positive integer, and let $R$ be a (possibly infinite dimensional) finitely presented algebra over a computable field of characteristic zero. We describe an algorithm for deciding (in principle) whether $R$ has at most finitely…
We give a new proof of the fact that finite bipartite graphs cannot be axiomatized by finitely many first-order sentences among FINITE graphs. (This fact is a consequence of a general theorem proved by L. Ham and M. Jackson, and the…
The Finiteness Problem is shown to be unsolvable for any sufficiently large class of modular lattices.
There is a family of constructions to produce orthomodular structures from modular lattices, lattices that are M and M*-symmetric, relation algebras, the idempotents of a ring, the direct product decompositions of a set or group or…
We examine various categorical structures that can and cannot be constructed. We show that total computable functions can be mimicked by constructible functors. More generally, whatever can be done by a Turing machine can be constructed by…
Will the cosmological multiverse, when described mathematically, have easily stated properties that are impossible to prove or disprove using mathematical physics? We explore this question by constructing lattice multiverses which exhibit…
Divisible residuated lattices are algebraic structures corresponding to a more comprehensive logic than Hajek's basic logic with an important significance in the study of fuzzy logic. The purpose of this paper is to investigate commutative…
We propose a construction of lattices from (skew-) polynomial codes, by endowing quotients of some ideals in both number fields and cyclic algebras with a suitable trace form. We give criteria for unimodularity. This yields integral and…
In this paper we study the representation theory for certain ``half lattice vertex algebras.'' In particular we construct a large class of irreducible modules for these vertex algebras. We also discuss how the representation theory of these…
We consider the compact spaces sigma_n(I) of subsets of an uncountable set I of cardinality at most n and their countable products. We give a complete classification of their Banach spaces of continuous functions and a partial topological…
We study the multiplication operation of square matrices over lattices. If the underlying lattice is distributive, then matrices form a semigroup; we investigate idempotent and nilpotent elements and the maximal subgroups of this matrix…
Does a given a set of polyominoes tile some rectangle? We show that this problem is undecidable. In a different direction, we also consider tiling a cofinite subset of the plane. The tileability is undecidable for many variants of this…
It is shown that CH implies the existence of a compact Hausdorff space that is countable dense homogeneous, crowded and does not contain topological copies of the Cantor set. This contrasts with a previous result by the author which says…
Let X be a right-angled building. We show that the lattices in Aut(X) share many properties with tree lattices. For example, we characterise the set of covolumes of uniform and of nonuniform lattices in Aut(X), and show that the group…
We count the number of lattice paths lying under a cyclically shifting piecewise linear boundary of varying slope. Our main result extends well known enumerative formulae concerning lattice paths, and its derivation involves a classical…
We consider posets of lattice paths (endowed with a natural order) and begin the study of such structures. We give an algebraic condition to recognize which ones of these posets are lattices. Next we study the class of Dyck lattices (i.e.,…
We indicate a way of distinguishing between structures, for which, we call two structures distinguishable. Roughly, being distinguishable means that they differ in the number of realizations each gives for some formula. Being…