St Andrews Research Repository

St Andrews University Home
View Item 
  •   St Andrews Research Repository
  • University of St Andrews Research
  • University of St Andrews Research
  • University of St Andrews Research
  • View Item
  •   St Andrews Research Repository
  • University of St Andrews Research
  • University of St Andrews Research
  • University of St Andrews Research
  • View Item
  •   St Andrews Research Repository
  • University of St Andrews Research
  • University of St Andrews Research
  • University of St Andrews Research
  • View Item
  • Register / Login
JavaScript is disabled for your browser. Some features of this site may not work without it.

Enumeration of set-theoretic solutions to the Yang-Baxter equation

Thumbnail
View/Open
Akgun_2022_Enumeration_of_set_theoretic_MoC_AAM.pdf (368.8Kb)
Date
14/01/2022
Author
Akgün, Ö.
Mereb, M.
Vendramin, L.
Keywords
QA Mathematics
QA75 Electronic computers. Computer science
T-NDAS
NCAD
Metadata
Show full item record
Abstract
We use Constraint Satisfaction methods to enumerate and construct set-theoretic solutions to the Yang-Baxter equation of small size. We show that there are 321931 involutive solutions of size nine, 4895272 involutive solutions of size ten and 422449480 non-involutive solution of size eight. Our method is then used to enumerate non-involutive biquandles.
Citation
Akgün , Ö , Mereb , M & Vendramin , L 2022 , ' Enumeration of set-theoretic solutions to the Yang-Baxter equation ' , Mathematics of Computation , vol. Early View . https://doi.org/10.1090/mcom/3696
Publication
Mathematics of Computation
Status
Peer reviewed
DOI
https://doi.org/10.1090/mcom/3696
ISSN
0025-5718
Type
Journal article
Rights
Copyright © 2022 American Mathematical Society. This work has been made available online in accordance with publisher policies or with permission. Permission for further reuse of this content should be sought from the publisher or the rights holder. This is the author created accepted manuscript following peer review and may differ slightly from the final published version. The final published version of this work is available at https://doi.org/10.1090/mcom/3696.
Description
Funding: The second author is partially supported by PICT 2018-3511 and is also a Junior Associate of the ICTP. The third author acknowledges support of NYU-ECNU Institute of Mathematical Sciences at NYU–Shanghai and he is supported in part by PICT 2016-2481 and UBACyT 20020170100256BA.
Collections
  • University of St Andrews Research
URL
https://www.ams.org/journals/mcom/0000-000-00/S0025-5718-2022-03696-6/
https://arxiv.org/abs/2008.04483
URI
http://hdl.handle.net/10023/24851

Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.

Advanced Search

Browse

All of RepositoryCommunities & CollectionsBy Issue DateNamesTitlesSubjectsClassificationTypeFunderThis CollectionBy Issue DateNamesTitlesSubjectsClassificationTypeFunder

My Account

Login

Open Access

To find out how you can benefit from open access to research, see our library web pages and Open Access blog. For open access help contact: openaccess@st-andrews.ac.uk.

Accessibility

Read our Accessibility statement.

How to submit research papers

The full text of research papers can be submitted to the repository via Pure, the University's research information system. For help see our guide: How to deposit in Pure.

Electronic thesis deposit

Help with deposit.

Repository help

For repository help contact: Digital-Repository@st-andrews.ac.uk.

Give Feedback

Cookie policy

This site may use cookies. Please see Terms and Conditions.

Usage statistics

COUNTER-compliant statistics on downloads from the repository are available from the IRUS-UK Service. Contact us for information.

© University of St Andrews Library

University of St Andrews is a charity registered in Scotland, No SC013532.

  • Facebook
  • Twitter