Related papers: Distributive lattices and Auslander regular algebr…
We consider the convex subset $[A,B]$ of all elements between two levels $A$ and $B$ of a finite distributive lattice, as a union of (or covered by) intervals $[a,b]$. A 1988 result of Voigt and Wegener shows that for such convex subsets of…
We provide a characterization of upper locally distributive lattices (ULD-lattices) in terms of edge colorings of their cover graphs. In many instances where a set of combinatorial objects carries the order structure of a lattice this…
A modular or distributive lattice is `diamond-colored' if its order diagram edges are colored in such a way that, within any diamond of edges, parallel edges have the same color. Such lattices arise naturally in combinatorial representation…
We introduce the class of split regular Hom-Leibniz algebras as the natural generalization of split Leibniz algebras and split regular Hom-Lie algebras. By developing techniques of connections of roots for this kind of algebras, we show…
Let $\Lambda$ be a finite dimensional Auslander algebra. For a $\Lambda$-module $M$, we prove that the projective dimension of $M$ is at most one if and only if the projective dimension of its socle soc\,$M$ is at most one. As an…
D.Happel and L.Unger defined a partial order on the set of basic tilting modules. We study the poset of basic pre-projective tilting modules over path algebra of infinite type. We give an equivalent condition for that this poset is a…
By a rectangular distributive lattice we mean the direct product of two non-singleton finite chains. We prove that the retracts (ordered by set inclusion and together with the empty set) of a rectangular distributive lattice $G$ form a…
It is shown that every Leavitt path algebra L of an arbitrary directed graph E over a field K is an arithmetical ring, that is, the two-sided ideals of L form a distributive lattice. It is also shown that L is a multiplication ring, that…
Covering is a common type of data structure and covering-based rough set theory is an efficient tool to process this data. Lattice is an important algebraic structure and used extensively in investigating some types of generalized rough…
We study Auslander-Reiten components of an artin algebra with bounded short cycles, namely, there exists a bound for the depths of maps appearing on short cycles of non-zero non-invertible maps between modules in the given component. First,…
A rotational lattice is a structure (L;\vee,\wedge, g) where L=(L;\vee,\wedge) is a lattice and g is a lattice automorphism of finite order. We describe the subdirectly irreducible distributive rotational lattices. Using J\'onsson's lemma,…
The reticulation of an algebra $A$ is a bounded distributive lattice ${\cal L}(A)$ whose prime spectrum of filters or ideals is homeomorphic to the prime spectrum of congruences of $A$, endowed with the Stone topologies. We have obtained a…
A partial algebra construction of Gr\"atzer and Schmidt from "Characterizations of congruence lattices of abstract algebras" (Acta Sci. Math. (Szeged) 24 (1963), 34-59) is adapted to provide an alternative proof to a well-known fact that…
Birkhoff's representation theorem for finite distributive lattices states that any finite distributive lattice is isomorphic to the lattice of order ideals (lower sets) of the partial order of the join-irreducible elements of the lattice.…
A closure endomorphism of a Hilbert algebra A is a mapping that is simultaneously an endomorphism of and a closure operator on A. It is known that the set CE of all closure endomorphisms of A is a distributive lattice where the meet of two…
In this paper, we define a property, trimness, for lattices. Trimness is a not-necessarily-graded generalization of distributivity; in particular, if a lattice is trim and graded, it is distributive. Trimness is preserved under taking…
Let $L$ be a finite lattice and let $I$ be an ideal of $L$. Then the restriction map is a bounded lattice homomorphism of the congruence lattice of~$L$ into the congruence lattice of $I$. In a 2009 paper, the authors proved the converse. In…
A subalgebra $\mathcal{A}$ of a $C^*$-algebra $\mathcal{M}$ is logmodular (resp. has factorization) if the set $\{a^*a; a\text{ is invertible with }a,a^{-1}\in\mathcal{A}\}$ is dense in (resp. equal to) the set of all positive and…
In a finite distributive lattice $\L$ we define two functions $s(\alpha)=|\{\delta \in \mathcal{L} | \delta \leq \alpha \}|$ and $l(\alpha)=|\{\delta \in \mathcal{L} | \delta \geq \alpha \}|$. In this present article we prove that the sum…
We consider the Kronecker algebra $A=\mathcal{O}[X, Y]/(X^2, Y^2)$, where $\mathcal{O}$ is a complete discrete valuation ring. Since $A \otimes\kappa$ is a special biserial algebra, where $\kappa$ is the residue field of $\mathcal{O}$, one…