相关论文: On the lattice of cotorsion theories

Since their introduction, torsion theories have played a key role in the study of abelian and pointed categories. In representation theory, torsion theories and lattices of torsion classes of mod$ A$, for $A$ a finite-dimensional algebra,…

In this paper, we determine the genus of the subgroup lattice of several families of abelian groups. In doing so, we classify all finite abelian groups whose subgroup lattices can be embedded into the torus.

We investigate the representation of lattices as sublattices of the lattice of all convex subsets (intervals) of a linearly ordered set $(X,\le)$. We introduce the purely lattice-theoretic notion of a \textit{loc-lattice} and prove that…

We study certain lattices constructed from finite abelian groups. We show that such a lattice is eutactic, thereby confirming a conjecture by B\"ottcher, Eisenbarth, Fukshansky, Garcia, Maharaj. Our methods also yield simpler proofs of two…

Torsion theories play an important role in abelian categories and they have been widely studied in the last sixty years. In recent years, with the introduction of pretorsion theories, the definition has been extended to general…

A notion of interpretation between arbitrary logics is introduced, and the poset Log of all logics ordered under interpretability is studied. It is shown that in Log infima of arbitrarily large sets exist, but binary suprema in general do…

We show that a large class of divisible abelian $\ell$-groups (lattice ordered groups) of continuous functions is interpretable (in a certain sense) in the lattice of the zero sets of these functions. This has various applications to the…

Compact connected abelian groups, or protori, have intrinsic structural characteristics that present for the entire category. In the case of finite-dimensional torus-free protori, The Resolution Theorem for Compact Abelian Groups sets the…

We prove that there is a lattice embedded from every countable distributive lattice into the Boolean algebra of computable subsets of $\mathbb{N}$. Along the way, we discuss all relevant results about lattices, Boolean algebras and…

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…

For a partially ordered set P, we denote by Co(P) the lattice of order-convex subsets of P. We find three new lattice identities, (S), (U), and (B), such that the following result holds. Theorem. Let L be a lattice. Then L embeds into some…

We prove that the lattice of normal subgroups of ultraproducts of compact simple non-abelian groups is distributive. In the case of ultraproducts of finite simple groups or compact connected simple Lie groups of bounded rank the set of…

Let L be a nonunimodular definite lattice. Using a theorem of Elkies we show that whether L embeds in the standard definite lattice of the same rank is completely determined by a collection of lattice correction terms, one for each…

A brief introduction to the theory of ordered sets and lattice theory is given. To illustrate proof techniques in the theory of ordered sets, a generalization of a conjecture of Daykin and Daykin, concerning the structure of posets that can…

An abelian lattice-ordered group, or abelian $\ell$-group, is an abelian group equipped with a compatible lattice ordering. In this paper, we introduce two multi-sorted extensions of abelian lattice-ordered groups inspired by the zero-set…

Building on the principle of combinatorial gauge symmetry, lattice gauge theories can be formulated with only one- and two-body interactions that ensure the exact realization of the symmetry rather than its approximate emergence in a…

The Resolution Theorem for Compact Abelian Groups is applied to show that the profinite subgroups of a finite-dimensional compact connected abelian group (protorus) which induce tori quotients comprise a lattice under intersection (meet)…

In this article we introduce theory and algorithms for learning discrete representations that take on a lattice that is embedded in an Euclidean space. Lattice representations possess an interesting combination of properties: a) they can be…

A general result by Jackson (Flat algebras and the translation of universal Horn logic to equational logic, J. Symb. Log. 73(1) (2008) 90--128) implies that the lattice of all quasivarieties of groups of exponent dividing $n$ embeds into…

This paper first gives a necessary and sufficient condition that a lattice $L$ can be represented as the collection of all up-sets of a poset. Applying the condition, it obtains a necessary and sufficient condition that a lattice can be…