Displaying 181 – 200 of 238

Showing per page

On the lattice of congruences on inverse semirings

Anwesha Bhuniya, Anjan Kumar Bhuniya (2008)

Discussiones Mathematicae - General Algebra and Applications

Let S be a semiring whose additive reduct (S,+) is an inverse semigroup. The relations θ and k, induced by tr and ker (resp.), are congruences on the lattice C(S) of all congruences on S. For ρ ∈ C(S), we have introduced four congruences ρ m i n , ρ m a x , ρ m i n and ρ m a x on S and showed that ρ θ = [ ρ m i n , ρ m a x ] and ρ κ = [ ρ m i n , ρ m a x ] . Different properties of ρθ and ρκ have been considered here. A congruence ρ on S is a Clifford congruence if and only if ρ m a x is a distributive lattice congruence and ρ m a x is a skew-ring congruence on S. If η (σ) is the least distributive...

On the nontrivial solvability of systems of homogeneous linear equations over in ZFC

Jan Šaroch (2020)

Commentationes Mathematicae Universitatis Carolinae

Motivated by the paper by H. Herrlich, E. Tachtsis (2017) we investigate in ZFC the following compactness question: for which uncountable cardinals κ , an arbitrary nonempty system S of homogeneous -linear equations is nontrivially solvable in provided that each of its subsystems of cardinality less than κ is nontrivially solvable in ?

On the number of finite algebraic structures

Erhard Aichinger, Peter Mayr, R. McKenzie (2014)

Journal of the European Mathematical Society

We prove that every clone of operations on a finite set A , if it contains a Malcev operation, is finitely related – i.e., identical with the clone of all operations respecting R for some finitary relation R over A . It follows that for a fixed finite set A , the set of all such Malcev clones is countable. This completes the solution of a problem that was first formulated in 1980, or earlier: how many Malcev clones can finite sets support? More generally, we prove that every finite algebra with few...

Currently displaying 181 – 200 of 238