Search arXivSearch

arXiv · 2412.08107

Commuting Pairs in Quasigroups

Abstract

A quasigroup is a pair $(Q, *)$ where $Q$ is a non-empty set and $*$ is a binary operation on $Q$ such that for every $(a, b) \in Q^2$ there exists a unique $(x, y) \in Q^2$ such that $a*x=b=y*a$. Let $(Q, *)$ be a quasigroup. A pair $(x, y) \in Q^2$ is a commuting pair of $(Q, *)$ if $x * y = y * x$. Recently, it has been shown that every rational number in the interval $(0, 1]$ can be attained as the proportion of ordered pairs that are commuting in some quasigroup. For every positive integer $n$ we establish the set of all integers $k$ such that there is a quasigroup of order $n$ with exactly $k$ commuting pairs. This allows us to determine, for a given rational $q \in (0, 1]$, the spectrum of positive integers $n$ for which there is a quasigroup of order $n$ whose proportion of commuting pairs is equal to $q$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jack Allsop, Ian M. Wanless. 2024-12-11. Commuting Pairs in Quasigroups. https://arxiv.org/abs/2412.08107

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO