2012
DOI: 10.1007/s00012-012-0194-z
|View full text |Cite
|
Sign up to set email alerts
|

Coset laws for categorical skew lattices

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
5
0

Year Published

2012
2012
2024
2024

Publication Types

Select...
7
1

Relationship

2
6

Authors

Journals

citations
Cited by 9 publications
(5 citation statements)
references
References 16 publications
0
5
0
Order By: Relevance
“…Problem 9.3. The index theorems presented for some varieties of skew lattices in [3,17] and [19] show a combinatorial perspective on these algebras as a direct consequence of their coset structure. Can we always obtain such results?…”
Section: Ganna Kudryavtsevamentioning
confidence: 97%
“…Problem 9.3. The index theorems presented for some varieties of skew lattices in [3,17] and [19] show a combinatorial perspective on these algebras as a direct consequence of their coset structure. Can we always obtain such results?…”
Section: Ganna Kudryavtsevamentioning
confidence: 97%
“…Transversals allows us to define the index of B in A, first presented in [4] and denoted by The nature of the coset structure of a skew lattice permits such instances of combinatorial implications that are arise frequently in the literature. These combinatorial properties enabled us to derive coset laws to characterize varieties of symmetric skew lattices and cancellative skew lattices, in [15] and [4] respectively, or in the first author's research in [5,6,18], and his PhD thesis in [19]. Similar characterizations are also available for normal (and conormal) skew lattices, as a direct consequence of Proposition 2.9.…”
Section: Coset Laws For Distributive Skew Latticesmentioning
confidence: 98%
“…[18]). A skew lattice S is normal iff for each comparable pair of Dclasses A > B in S and all x, x ∈ B, A ∧ x ∧ A = A ∧ x ∧ A. Dually, S is conormal iff for all comparable pairs of D-classes A > B in S and all x, x ∈ A, B∨x∨B = B∨x ∨B.Proposition 2.9 above essentially states that S is a normal skew lattice if and only if, for each comparable pair of D-classes A > B in S and for each x ∈ A, a unique y ∈ B exists such that y ≤ x.…”
mentioning
confidence: 99%
See 1 more Smart Citation
“…Here is a nice result: a strictly categorical skew lattice S is distributive iff its maximal lattice image S/D is distributive. A nice counting theorem quoted in this paper came from João's 2012 Algebra Universalis publication "Coset laws for categorical skew lattices" [53]: While on the topic of skew lattice architecture, further research in this area has been carried out by Karin and/or João. The relevant published papers, all appearing since 2010, are often recognized by such phrases as "coset structure" or "coset laws" appearing in the title.…”
Section: Some General Factsmentioning
confidence: 99%