scientific article; zbMATH DE number 125199
[For the entire collection see Zbl 0745.00034.] Let \(\langle M;\cdot,^{-1},e\rangle\) be a polygroup; i.e. the multiplication assigns a nonempty subset to each element of \(M\times M\). Using the notation \(\theta x= \{y\mid y\theta x\}\), a conjugacy relation on \(M\) is an equivalence relation \(\theta\) such that for all \(x,y\in M\): (1) \(\theta(x,y)\subseteq (\theta x)(\theta y)\), (2) \((\theta x)^{-1}= \theta(x^{-1})\). A decomposition of a group into double cosets as well as into ordinary conjugacy classes give examples. This paper describes a few elementary properties of the lattice of conjugacy relations of a group. It is conjectured that the conjugacy lattice of a finite group \(G\) determines the group and some evidence for this conjecture is given.
- Lattices of c-degrees
- Odd systems of vectors and related lattices
- Congruence lattices of finite chains with endomorphisms
- scientific article; zbMATH DE number 4008459 (Why is no real title available?)
- scientific article; zbMATH DE number 3179495 (Why is no real title available?)
- scientific article; zbMATH DE number 2070551 (Why is no real title available?)
- On the dependence of related structures of lattices
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4026892)
