Commuting degree for BCK-algebras

Abstract

We discuss the following question: given a finite BCK-algebra, what is the probability that two randomly selected elements commute? We call this probability the commuting degree of a BCK-algebra. In a previous paper, the author gave sharp upper and lower bounds for the commuting degree of a BCK-algebra with order n. We expand on those results in this paper: we show that, for each n≥ 3, there is a BCK-algebra of order n realizing each possible commuting degree and that the minimum commuting degree is achieved by a unique BCK-algebra of order n Additionally, we show that every rational number in (0,1] is the commuting degree of some finite BCK-algebra.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…