Search Results: 1 - 10 of 100 matches for " "
All listed articles are free for downloading (OA Articles)
Page 1 /100
Display every page Item
Alexander quandles of order 16  [PDF]
Gabriel Murillo,Sam Nelson
Mathematics , 2004,
Abstract: Isomorphism classes of Alexander quandles of order 16 are determined, and classes of connected quandles are identified. This paper extends the list of known distinct connected finite Alexander quandles.
Classification of Finite Alexander Quandles  [PDF]
Sam Nelson
Mathematics , 2002,
Abstract: Two finite Alexander quandles with the same number of elements are isomorphic iff their Z[t,t^-1]-submodules Im(1-t) are isomorphic as modules. This yields specific conditions on when Alexander quandles of the form Z_n[t,t^-1]/(t-a) where gcd(n,a)=1 (called linear quandles) are isomorphic, as well as specific conditions on when two linear quandles are dual and which linear quandles are connected. We apply this result to obtain a procedure for classifying Alexander quandles of any finite order and as an application we list the numbers of distinct and connected Alexander quandles with up to fifteen elements.
On classification of quandles of cyclic type  [PDF]
Seiichi Kamada,Hiroshi Tamaru,Koshiro Wada
Mathematics , 2013,
Abstract: In this paper, we study quandles of cyclic type, which form a particular subclass of finite quandles. The main result of this paper describes the set of isomorphism classes of quandles of cyclic type in terms of certain cyclic permutations. By using our description, we give a direct classification of quandles of cyclic type with cardinality up to $12$.
Toward a classification of finite quandles  [PDF]
G. Ehrman,A. Gurpinar,M. Thibault,D. N. Yetter
Mathematics , 2005,
Abstract: This paper summarizes substantive new results derived by a student team (the first three authors) under the direction of the fourth author at the 2005 session of the KSU REU ``Brainstorming and Barnstorming''. The main results are a decomposition theorem for quandles in terms of an operation of `semidisjoint union' showing that all finite quandles canonically decompose via iterated semidisjoint unions into connected subquandles, and a structure theorem for finite connected quandles with prescribe inner automorphism group. The latter theorem suggests a new approach to the classification of finite connected quandles.
Automorphism groups of Quandles  [PDF]
M. Elhamdadi,J. MacQuarrie,R. Restrepo
Mathematics , 2010, DOI: 10.1142/S0219498812500089
Abstract: We prove that the automorphism group of the dihedral quandle with n elements is isomorphic to the affine group of the integers mod n, and also obtain the inner automorphism group of this quandle. In [9], automorphism groups of quandles (up to isomorphisms) of order less than or equal to 5 were given. With the help of the software Maple, we compute the inner and automorphism groups of all seventy three quandles of order six listed in the appendix of [4]. Since computations of automorphisms of quandles relates to the problem of classification of quandles, we also describe an algorithm implemented in C for computing all quandles (up to isomorphism) of order less than or equal to nine.
Canonical forms for operation tables of finiate connected quandles  [PDF]
Chuichiro Hayashi
Mathematics , 2011,
Abstract: We introduce a notion of natural orderings of elements of finite connected quandles of order $n$. When the elements of such a quandle $Q$ are already ordered naturally, any automophism on $Q$ is a natural ordering. Although there are many natural orderings, the operation tables for such orderings coincide when the permutation $*q$ is a cycle of length $n-1$. This leads to the classification of automorphisms on such a quandle. Moreover, it is also shown that every row and column of the operation table of such a quandle contains all the elements of $Q$, which is due to K. Oshiro. We also consider the general case of finite connected quandles.
Small connected quandles  [PDF]
F. J. B. J. Clauwens
Mathematics , 2010,
Abstract: It is the purpose of this note to classify connected quandles up to order 14, and in particular to show that there is no connected quandle of order 14.
Connected quandles and transitive groups  [PDF]
Alexander Hulpke,David Stanovsky,Petr Vojtěchovsky
Mathematics , 2014,
Abstract: 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.
Connected Quandles with Order Equal to Twice an Odd Prime  [PDF]
James McCarron
Mathematics , 2012,
Abstract: We show that there is an unique connected quandle of order twice an odd prime number greater than 3. It has order 10 and is isomorphic to the conjugacy class of transpositions in the symmetric group of degree 5. This establishes a conjecture of L. Vendramin.
Symbolic computation with finite quandles  [PDF]
Richard Henderson,Todd Macedo,Sam Nelson
Mathematics , 2005,
Abstract: Algorithms are described and Maple implementations are provided for finding all quandles of order $n$, as well as computing all homomorphisms between two finite quandles or from a finitely presented quandle (e.g., a knot quandle) to a finite quandle, computing the automorphism group of a finite quandle, etc. Several of these programs work for arbitrary binary operation tables and hence algebraic structures other than quandles. We also include a stand-alone C program which finds quandles of order $n$ and provide URLs for files containing the results for $n=6,$ 7 and 8.
Page 1 /100
Display every page Item

Copyright © 2008-2017 Open Access Library. All rights reserved.