{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/machine-learning-mutation-acyclicity-of","title":"Machine Learning Mutation-Acyclicity of Quivers","arxiv_id":"2411.04209","date":"2024-11-06","proceeding":null,"authors":["Kymani T. K. Armstrong-Williams","Edward Hirst","Blake Jackson","Kyu-Hwan Lee"],"abstract":"Machine learning (ML) has emerged as a powerful tool in mathematical research in recent years. This paper applies ML techniques to the study of quivers--a type of directed multigraph with significant relevance in algebra, combinatorics, computer science, and mathematical physics. Specifically, we focus on the challenging problem of determining the mutation-acyclicity of a quiver on 4 vertices, a property that is pivotal since mutation-acyclicity is often a necessary condition for theorems involving path algebras and cluster algebras. Although this classification is known for quivers with at most 3 vertices, little is known about quivers on more than 3 vertices. We give a computer-assisted proof of a theorem to prove that mutation-acyclicity is decidable for quivers on 4 vertices with edge weight at most 2. By leveraging neural networks (NNs) and support vector machines (SVMs), we then accurately classify more general 4-vertex quivers as mutation-acyclic or non-mutation-acyclic. Our results demonstrate that ML models can efficiently detect mutation-acyclicity, providing a promising computational approach to this combinatorial problem, from which the trained SVM equation provides a starting point to guide future theoretical development.","url_abs":"https://arxiv.org/abs/2411.04209v1","url_pdf":"https://arxiv.org/pdf/2411.04209v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"machine-learning-mutation-acyclicity-of","repo_url":"https://github.com/KTKAW/MACHINE_LEARNING_MUTATION_ACYCLICITY_OF_QUIVERS","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[],"methods":[{"method_slug":"focus","method_name":"Focus"},{"method_slug":"svm","method_name":"SVM"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2411.04209","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.04209"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/KTKAW/MACHINE_LEARNING_MUTATION_ACYCLICITY_OF_QUIVERS","reach":null}],"summary":{"ran_honours":1,"unverified":2},"by_repo_kind":{"official":{"samples":3,"ran":1,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":3,"samples":[{"code_sha256_prefix":"cd75a463f34e770d","entry":"create_antisymmetric_matrix","repo":"KTKAW/MACHINE_LEARNING_MUTATION_ACYCLICITY_OF_QUIVERS","repo_kind":"official","path":"Theorem_2_8/ProofFunctions.py","file_url":"https://github.com/KTKAW/MACHINE_LEARNING_MUTATION_ACYCLICITY_OF_QUIVERS/blob/HEAD/Theorem_2_8/ProofFunctions.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"cd75a463f34e770d"}},{"code_sha256_prefix":"b755a0403d768887","entry":"Mat2Quiver","repo":"KTKAW/MACHINE_LEARNING_MUTATION_ACYCLICITY_OF_QUIVERS","repo_kind":"official","path":"Theorem_2_8/ProofFunctions.py","file_url":"https://github.com/KTKAW/MACHINE_LEARNING_MUTATION_ACYCLICITY_OF_QUIVERS/blob/HEAD/Theorem_2_8/ProofFunctions.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"b755a0403d768887"}},{"code_sha256_prefix":"6ca8936a6edeb411","entry":"matrix_weakly_connected_check","repo":"KTKAW/MACHINE_LEARNING_MUTATION_ACYCLICITY_OF_QUIVERS","repo_kind":"official","path":"Theorem_2_8/ProofFunctions.py","file_url":"https://github.com/KTKAW/MACHINE_LEARNING_MUTATION_ACYCLICITY_OF_QUIVERS/blob/HEAD/Theorem_2_8/ProofFunctions.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"6ca8936a6edeb411"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}