Searcharxiv⌕ Search

arXiv subjects

David Stanovský

Publications and source records attributed to David Stanovský.

22 records · Page 2Linked to original sources

Connected quandles and transitive groups

We establish a canonical correspondence between connected quandles and certain configurations in transitive groups, called quandle envelopes. This correspondence allows us to efficiently enumerate connected quandles of small orders, and present new proofs concerning connected quandles of order p and 2p. We also present a new characterization of connected quandles that are affine.

math.GR↗

Distributive and anti-distributive Mendelsohn triple systems

We prove that the existence spectrum of Mendelsohn triple systems whose associated quasigroups satisfy distributivity corresponds to the Loeschian numbers, and provide some enumeration results. We do this by considering a description of the quasigroups in terms of commutative Moufang loops. In addition we provide constructions of Mendelsohn quasigroups that fail distributivity for as many combinations of elements as possible. These systems are analogues of Hall triple systems and anti-mitre Steiner triple systems respectively.

math.CO↗

The structure of medial quandles

Medial quandles are represented using a heterogeneous affine structure. As a consequence, we obtain numerous structural properties, including enumeration of isomorphism classes of medial quandles up to 13 elements.

math.GR↗

A combinatorial approach to knot recognition

This is a report on our ongoing research on a combinatorial approach to knot recognition, using coloring of knots by certain algebraic objects called quandles. The aim of the paper is to summarize the mathematical theory of knot coloring in a compact, accessible manner, and to show how to use it for computational purposes. In particular, we address how to determine colorability of a knot, and propose to use SAT solving to search for colorings. The computational complexity of the problem, both in theory and in our implementation, is discussed. In the last part, we explain how coloring can be utilized in knot recognition.

math.GT↗