相关论文: Lattices freely generated by posets within a varie…

We introduce an algorithm for computing closure systems derived from a family of implications on a set. Semilattices presentations are explored and used in conjunction with the algorithm to compute various types of lattices freely generated…

In general it is a difficult problem to construct the lattice of submodules $L(M)$ of a given module $M$. In \cite{St} R. P. Stanley outlined a method for constucting a distributive lattice from a knowledge of its join irreducibles. However…

The main objective of this thesis is a classification project for integral lattices. Using Kneser's neighbour method we have developed the computer program tn to classify complete genera of integral lattices. Main results are detailed…

This article is part of my upcoming masters thesis which investigates the following open problem from the book, Free Lattices, by R.Freese, J.Jezek, and J.B. Nation published in 1995: "Which lattices (and in particular which countable…

We investigate connections between the free lattice generated by a poset while preserving certain bounds and the canonical extension of a poset. Explicitly, we describe how the free lattice generated by a poset while preserving certain…

An algorithm is presented for generating finite modular, semimodular, graded, and geometric lattices up to isomorphism. Isomorphic copies are avoided using a combination of the general-purpose graph-isomorphism tool nauty and some…

We introduce the free Banach lattice generated by a lattice L. We give an explicit description of it and we study some of its properties for the case when $\mathbb{L}$ is a linear order, like the countable chain condition.

For a finite lattice $L$, let Gm($L$) denote the least $n$ such that $L$ can be generated by $n$ elements. For integers $r>2$ and $k>1$, denote by FD$(r)^k$ the $k$-th direct power of the free distributive lattice FD($r$) on $r$ generators.…

Let G be any locally compact, unimodular, metrizable group. The main result of this paper, roughly stated, is that if F<G is any finitely generated free group and \Gamma < G any lattice, then up to a small perturbation and passing to a…

In this paper we determine, under some mild restrictions, the lattice of submodules $\gL$ of a module $M$ all of whose composition factors have multiplicity one. Such a lattice is distributive, and hence determined by its poset of down-sets…

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 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…

We consider a category of all finite partial orderings with quotient maps as arrows and construct a Fra\"iss\'e sequence in this category. Then we use commonly known relations between partial orders and lattices to construct a sequence of…

Modular lattices, introduced by R. Dedekind, are an important subvariety of lattices that includes all distributive lattices. Heitzig and Reinhold developed an algorithm to enumerate, up to isomorphism, all finite lattices up to size 18.…

We study the equational theories and bases of meets and joins of several varieties of plactic-like monoids. Using those results, we construct sublattices of the lattice of varieties of monoids, generated by said varieties. We calculate the…

Let L denote the variety of lattices. In 1982, the second author proved that L is strongly tolerance factorable, that is, the members of L have quotients in L modulo tolerances, although L has proper tolerances. We did not know any other…

We study the algebras of modular forms on type IV symmetric domains for simple lattices; that is, lattices for which every Heegner divisor occurs as the divisor of a Borcherds product. For every simple lattice $L$ of signature $(n,2)$ with…

We consider a variation of Construction A of lattices from linear codes based on two classes of number fields, totally real and CM Galois number fields. We propose a generic construction with explicit generator and Gram matrices, then focus…

We prove that every finite lattice L can be embedded in a three-generated finite lattice K. We also prove that every algebraic lattice with accessible cardinality is a complete sublattice of an appropriate algebraic lattice K such that K is…

Let G be a lattice in PSL(2,C). The pro-normal topology on G is defined by taking all cosets of non-trivial normal subgroups as a basis. This topology is finer than the pro-finite topology, but it is not discrete. We prove that every…