A lattice theoretical analogue of the Schur lemma.
Renato Ascoli, Giancarlo Teppati (1967)
Bollettino dell'Unione Matematica Italiana
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Renato Ascoli, Giancarlo Teppati (1967)
Bollettino dell'Unione Matematica Italiana
Similarity:
Manoj Dhake, Sachin Ballal, Vilas Kharat, Rupesh S. Shewale (2025)
Mathematica Bohemica
Similarity:
We characterize the pseudomodular lattices by means of a forbidden configuration.
Michael Baake, Rudolf Scharlau, Peter Zeiner (2014)
Acta Arithmetica
Similarity:
A lattice in Euclidean d-space is called well-rounded if it contains d linearly independent vectors of minimal length. This class of lattices is important for various questions, including sphere packing or homology computations. The task of enumerating well-rounded sublattices of a given lattice is of interest already in dimension 2, and has recently been treated by several authors. In this paper, we analyse the question more closely in the spirit of earlier work on similar sublattices...
Gül Deniz Çayli (2023)
Kybernetika
Similarity:
Uninorms on bounded lattices have been recently a remarkable field of inquiry. In the present study, we introduce two novel construction approaches for uninorms on bounded lattices with a neutral element, where some necessary and sufficient conditions are required. These constructions exploit a t-norm and a closure operator, or a t-conorm and an interior operator on a bounded lattice. Some illustrative examples are also included to help comprehend the newly added classes of uninorms. ...
Hua Mao (2017)
Open Mathematics
Similarity:
We characterize complete atomistic lattices whose classification lattices are geometric. This implies an proper solution to a problem raised by S. Radeleczki in 2002.
Petr Emanovský (1993)
Mathematica Bohemica
Similarity:
V. I. Marmazejev introduced in [3] the following concept: two lattices are convex isomorphic if their lattices of all convex sublattices are isomorphic. He also gave a necessary and sufficient condition under which the lattice are convex isomorphic, in particular for modular, distributive and complemented lattices. The aim this paper is to generalize this concept to the -lattices defined in [2] and to characterize the convex isomorphic -lattices.
Radomír Halaš (2002)
Discussiones Mathematicae - General Algebra and Applications
Similarity:
It is well known that every complete lattice can be considered as a complete lattice of closed sets with respect to appropriate closure operator. The theory of q-lattices as a natural generalization of lattices gives rise to a question whether a similar statement is true in the case of q-lattices. In the paper the so-called M-operators are introduced and it is shown that complete q-lattices are q-lattices of closed sets with respect to M-operators.
Ivan Rival, Bill Sands (1982)
Banach Center Publications
Similarity:
Marcin Łazarz (2016)
Bulletin of the Section of Logic
Similarity:
In the paper we investigate Birkhoff’s conditions (Bi) and (Bi*). We prove that a discrete lattice L satisfies the condition (Bi) (the condition (Bi*)) if and only if L is a 4-cell lattice not containing a cover-preserving sublattice isomorphic to the lattice S*7 (the lattice S7). As a corollary we obtain a well known result of J. Jakub´ık from [6]. Furthermore, lattices S7 and S*7 are considered as so-called partially cover-preserving sublattices of a given lattice L, S7 ≪ L and S7...
Zhang, Kunlun, Song, Lixia, Sun, Yikang (2003)
Southwest Journal of Pure and Applied Mathematics [electronic only]
Similarity: