Search arXivSearch

arXiv · 2308.11852

The rack congruence condition and half congruences in racks

Abstract

Racks and quandles are algebraic structures with a single binary operation that is right self-distributive and right invertible, and additionally idempotent in the case of quandles. The invertibility condition is equivalent to the existence of a second binary operation that acts as a right inverse to the first, so that racks and quandles may also be viewed as algebraic structures with a pair of (dependent) binary operations. When forming a quotient rack or quandle it is necessary to take this two-operation view, and define a congruence as an equivalence relation on the rack or quandle that respects both operations. However, in defining a congruence some authors have omitted the condition on the inverse operation, and defined a congruence as an equivalence relation respecting the primary operation only. We show that while respecting the primary operation is sufficient in the case of finite racks and quandles, it is not in general sufficient in the infinite case. We do this by constructing explicit examples of "half congruences": equivalence relations that respect exactly one of the two operations. Our work also allows us to completely characterise congruences in connected Alexander quandles.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Wayne Burrows, Christopher Tuffley. 2024-07-22. The rack congruence condition and half congruences in racks. https://arxiv.org/abs/2308.11852

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

KEEP EXPLORING

Related papers

On solutions of singular Sylvester equations in quaternions

The quaternionic equations ax-xb=0 and ax-xb=c are investigated, which are called homogeneous and inhomogeneous Sylvester equations, respectively. Conditions for the existence of solutions are provided. In addition, the general and nonzero solutions to these equations are derived applying quaternion square roots.

math.RA

Positivity preservers over finite fields II

We say that a matrix over a finite field $\mathbb{F}_q$ is positive definite if it is symmetric and each of its leading principal minors is a nonzero square in $\mathbb{F}_q$. In previous work of the authors [J. Algebra, 2025], the entrywise positivity preservers on $M_n(\mathbb{F}_q)$ were classified in every case except when $n=2$, $q\equiv1\pmod4$, and $q$ is not a square. We settle this remaining case, thereby completing the classification of entrywise positivity preservers over every finite field and in every dimension $n\ge2$. Our proof is based on a novel idempotent reduction that not only resolves the remaining case but also yields a self-contained proof of the complete classification, while avoiding several technical results used in the earlier arguments. As a further application of the same reduction, we classify the entrywise preservers of strongly nonsingular matrices, i.e., matrices whose leading principal minors are all nonzero. We also prove a more general theorem in odd characteristic: for every prescribed sign pattern of nonzero leading principal minors of matrices of a fixed dimension $n\ge2$, the entrywise preservers are precisely the positive scalar multiples of field automorphisms. Thus, in odd characteristic, preserving any nonzero leading-principal-minor sign pattern surprisingly forces the preservation of every such sign pattern.

math.RA

Graphs of Moore-Penrose inverse of matrices possessing the treeangle property

It is known that the inverse of an invertible real square matrix satisfying the treeangle property, is a treediagonal matrix. A converse statement also holds. We show that the verbatim analogues are not true for the Moore-Penrose inverse, and obtain the precise structure of graphs corresponding to the Moore-Penrose inverse of matrices possessing the treeangle property.

math.RA