相关论文: On the structure of modular lattices -- Unique glu…
We show that if a graded submodule of a Noetherian module cannot be written as a proper intersection of graded submodules, then it cannot be written as a proper intersection of submodules at all. More generally, we show that a natural…
One of the longstanding problems in universal algebra is the question of which finite lattices are isomorphic to the congruence lattices of finite algebras. This question can be phrased as which finite lattices can be represented as…
In this note a bijection is constructed between the set of partitions of n simultaneously s-regular and t-distinct, and those simultaneously t-regular and s-distinct. Some implications of the map are discussed. As a generalized version of…
We prove several fundamental results about divisorial integral domains in the setup of multiplicative lattices.
Dualization of a monotone Boolean function on a finite lattice can be represented by transforming the set of its minimal 1 to the set of its maximal 0 values. In this paper we consider finite lattices given by ordered sets of their meet and…
We prove general superrigidity results for actions of irreducible lattices on CAT(0) spaces; first, in terms of the ideal boundary, and then for the intrinsic geometry (including for infinite-dimensional spaces). In particular, one obtains…
Linear relations, defined as submodules of the direct sum of two modules, can be viewed as objects that carry dynamical information and reflect the inherent uncertainty of sampled dynamics. These objects also provide an algebraic structure…
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…
Sponges were recently proposed as a generalization of lattices, focussing on joins/meets of sets, while letting go of associativity/transitivity. In this work we provide tools for characterizing and constructing sponges on metric spaces and…
We introduce layer systems for proving generalizations of the modularity of confluence for first-order rewrite systems. Layer systems specify how terms can be divided into layers. We establish structural conditions on those systems that…
We first show that the tilings of a general domain form a lattice which we then undertake to decompose and generate without any redundance. To this end, we study extensively the relatively simple case of hexagons and their deformations. We…
It is well known by analysts that a concept lattice has an exponential size in the data. Thus, as soon as he works with real data, the size of the concept lattice is a fundamental problem. In this chapter, we propose to investigate factor…
We consider module categories of path algebras of connected acyclic quivers. It is shown in this paper that the set of functorially finite torsion classes form a lattice if and only if the quiver is either Dynkin quiver of type A, D, E, or…
We consider complete lattices equipped with preorderings indexed by the ordinals less than a given (limit) ordinal subject to certain axioms. These structures, called stratified complete lattices, and weakly monotone functions over them,…
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.…
A relational structure is called reversible iff every bijective endomorphism of that structure is an automorphism. We give several equivalents of that property in the class of disconnected binary structures and some its subclasses. For…
We show that any finite group $G$ there exists a bijction $f$ from $G$ onto $C_{n}$ such that $o(x)$ divides $o(f(x))$ for all $x\in G$. This confirm Problem 18.1 in [7].
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 prove that every finite distributive lattice is isomorphic to a final segment of the d.c.e. Turing degrees (i.e., the degrees of differences of computably enumerable sets). As a corollary, we are able to infer the undecidability of the…
Meet-distributive lattices form an intriguing class of lattices, because they are precisely the lattices obtainable from a closure operator with the so-called anti-exchange property. Moreover, meet-distributive lattices are join…