{"title":"Density of maximal nonassociativity in quadratic nearfields","authors":"Martina Lehká","doi":"10.1016/j.jaca.2026.100047","DOIUrl":"10.1016/j.jaca.2026.100047","url":null,"abstract":"<div><div>A quasigroup <span><math><mo>(</mo><mi>Q</mi><mo>,</mo><mo>⋅</mo><mo>)</mo></math></span> is called maximally nonassociative if for all <span><math><mo>(</mo><mi>x</mi><mo>,</mo><mi>y</mi><mo>,</mo><mi>z</mi><mo>)</mo><mo>∈</mo><msup><mrow><mi>Q</mi></mrow><mrow><mn>3</mn></mrow></msup></math></span>, the equality <span><math><mo>(</mo><mi>x</mi><mo>⋅</mo><mi>y</mi><mo>)</mo><mo>⋅</mo><mi>z</mi><mo>=</mo><mi>x</mi><mo>⋅</mo><mo>(</mo><mi>y</mi><mo>⋅</mo><mi>z</mi><mo>)</mo></math></span> implies that <span><math><mi>x</mi><mo>=</mo><mi>y</mi><mo>=</mo><mi>z</mi></math></span>. We follow up on the 2020 article “Maximal nonassociativity via nearfields” by Drápal and Lisoněk, in which the authors first proved the existence of maximally nonassociative quasigroups of certain orders. They studied quasigroups derived from quadratic nearfields, and based on computational results, conjectured that the asymptotic density of maximally nonassociative quasigroups among them lies between 0.288 and 0.29. Using the Weil bound as our main tool, we confirm their conjecture and show that the asymptotic density equals <span><math><mn>37</mn><mo>/</mo><mn>128</mn><mo>=</mo><mn>0.2890625</mn></math></span>.</div></div>","PeriodicalId":100767,"journal":{"name":"Journal of Computational Algebra","volume":"18 ","pages":"Article 100047"},"PeriodicalIF":0.0,"publicationDate":"2026-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148184764","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"An innovative graph polynomial numerical strategy for the time-fractional Kuramoto-Sivashinsky model based on the complete bipartite graph's independence polynomials","authors":"A.N. Nirmala, S. Kumbinarasaiah","doi":"10.1016/j.jaca.2026.100044","DOIUrl":"10.1016/j.jaca.2026.100044","url":null,"abstract":"<div><div>The time-fractional Kuramoto-Sivashinsky equation (TF-K-SE) models chaotic dynamics with memory effects, necessitating advanced computational techniques for stability and accuracy. Conventional methods frequently encounter instability, excessive computational costs, and dependence on transformation techniques, limiting their effectiveness in handling fractional derivatives. This study introduces the Independence Polynomial Collocation Method (ICCM), leveraging graph-theoretic independence polynomials to enhance spectral accuracy and computational efficiency. Constructing sparse operational matrices, ICCM optimizes spectral discretization while preserving nonlinear characteristics, ensuring a more stable numerical framework. Caputo fractional derivatives capture memory-dependent dynamics and provide smooth transitions between fractional and integer orders without sacrificing physical fidelity. Unlike conventional orthogonal polynomials, which require increasing degrees for refinement and dense matrix representations, ICCM introduces a graph-theoretic spectral basis, improving smoothness, maintaining linear independence, and enhancing stability. A key advantage of ICCM is its independence from controlling parameters, distinguishing it from conventional semi-analytical methods that rely on stabilization terms or artificial tuning. ICCM achieves intrinsic numerical stability without external adjustments, making it a computationally efficient alternative while accurately preserving the chaotic nature of TF-K-SE. Numerical validation across four test cases demonstrates robust spectral stability, with error norms confirming precision and smooth transitions across fractional orders. ICCM establishes a computationally efficient framework for fractional PDE modeling and nonlinear system analysis, offering a novel approach distinct from existing techniques.</div></div>","PeriodicalId":100767,"journal":{"name":"Journal of Computational Algebra","volume":"17 ","pages":"Article 100044"},"PeriodicalIF":0.0,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146116509","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"The dynamics of the Hesse derivative on the j-invariant","authors":"Jake Kettinger","doi":"10.1016/j.jaca.2026.100043","DOIUrl":"10.1016/j.jaca.2026.100043","url":null,"abstract":"<div><div>In this paper, we study the Hesse derivative of a cubic curve on the set of <em>j</em>-invariants, which can be viewed as a rational function on the Riemann sphere. This effect comes in the form of a rational function on the Riemann sphere. We then analyze the dynamics of this rational function, including counting the number of orbits of a given size. We proceed to investigate when a cubic curve is isomorphic to its <em>n</em>-fold Hesse derivative, showing that when an elliptic curve has a <em>j</em>-invariant that is periodic under this rational function, the curve itself must be periodic under the Hesse derivative. We finish with some data collected comparing the sizes of the orbits of elliptic curves to those of their <em>j</em>-invariants, and some further questions about this dynamical system.</div></div>","PeriodicalId":100767,"journal":{"name":"Journal of Computational Algebra","volume":"17 ","pages":"Article 100043"},"PeriodicalIF":0.0,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146116510","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Stable Andrews-Curtis trivialization of AK(3) revisited. A case study using automated deduction","authors":"Alexei Lisitsa","doi":"10.1016/j.jaca.2025.100041","DOIUrl":"10.1016/j.jaca.2025.100041","url":null,"abstract":"<div><div>Recent work by Shehper et al. (2024) <span><span>[13]</span></span> proposed that the well-known Akbulut–Kirby presentation <span><math><mrow><mi>AK</mi></mrow><mo>(</mo><mn>3</mn><mo>)</mo></math></span> is stably Andrews–Curtis (AC) equivalent to the trivial presentation, based on a reduction to a previously studied presentation <em>P</em>. In this paper, we present an independently obtained reduction of <span><math><mrow><mi>AK</mi></mrow><mo>(</mo><mn>3</mn><mo>)</mo></math></span> to <em>P</em>, using a fully automated theorem proving approach. Subsequent to our initial submission, it has emerged that the earlier theoretical claim about the stable AC-trivializability of <em>P</em>—on which the Shehper et al. result relied—was based on an incorrect theorem, and thus the status of <span><math><mrow><mi>AK</mi></mrow><mo>(</mo><mn>3</mn><mo>)</mo></math></span> remains unresolved. While this paper does not establish the stable AC-triviality of <span><math><mrow><mi>AK</mi></mrow><mo>(</mo><mn>3</mn><mo>)</mo></math></span>, it contributes a reproducible and verifiable case study in the use of automated reasoning to analyze deep problems in combinatorial group theory. We conclude by suggesting future directions for computational exploration of stable AC-transformations.</div></div>","PeriodicalId":100767,"journal":{"name":"Journal of Computational Algebra","volume":"16 ","pages":"Article 100041"},"PeriodicalIF":0.0,"publicationDate":"2025-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145327132","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Kymani T.K. Armstrong-Williams , Edward Hirst , Blake Jackson , Kyu-Hwan Lee
{"title":"Machine learning mutation-acyclicity of quivers","authors":"Kymani T.K. Armstrong-Williams , Edward Hirst , Blake Jackson , Kyu-Hwan Lee","doi":"10.1016/j.jaca.2025.100040","DOIUrl":"10.1016/j.jaca.2025.100040","url":null,"abstract":"<div><div>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.</div></div>","PeriodicalId":100767,"journal":{"name":"Journal of Computational Algebra","volume":"15 ","pages":"Article 100040"},"PeriodicalIF":0.0,"publicationDate":"2025-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145018853","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"An algorithm to compute the Hausdorff dimension of regular branch groups","authors":"Jorge Fariña-Asategui","doi":"10.1016/j.jaca.2025.100037","DOIUrl":"10.1016/j.jaca.2025.100037","url":null,"abstract":"<div><div>An explicit algorithm is given for the computation of the Hausdorff dimension of the closure of a regular branch group in terms of an arbitrary branch structure. We implement this algorithm in GAP and apply it to a family of GGS-groups acting on the 4-adic tree.</div></div>","PeriodicalId":100767,"journal":{"name":"Journal of Computational Algebra","volume":"15 ","pages":"Article 100037"},"PeriodicalIF":0.0,"publicationDate":"2025-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144337924","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Computing quadratic subfields of number fields","authors":"Andreas-Stephan Elsenhans , Jürgen Klüners","doi":"10.1016/j.jaca.2025.100039","DOIUrl":"10.1016/j.jaca.2025.100039","url":null,"abstract":"<div><div>Given a number field, it is an important question in algorithmic number theory to determine all its subfields. If the search is restricted to abelian subfields, we can try to determine them by using class field theory. For this, it is necessary to know the ramified primes. We show that the ramified primes of the subfield can be computed efficiently. Using this information, we give algorithms to determine all quadratic and cyclic cubic subfields of the initial field. The approach generalises to cyclic subfields of prime degree. In the case of quadratic subfields, our approach is much faster than other methods.</div></div>","PeriodicalId":100767,"journal":{"name":"Journal of Computational Algebra","volume":"15 ","pages":"Article 100039"},"PeriodicalIF":0.0,"publicationDate":"2025-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144714107","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A 3-skeleton for a classifying space for the symmetric group","authors":"Matthew B. Day , Trevor Nakamura","doi":"10.1016/j.jaca.2025.100038","DOIUrl":"10.1016/j.jaca.2025.100038","url":null,"abstract":"<div><div>We construct a 3-dimensional cell complex that is the 3-skeleton for an Eilenberg–MacLane classifying space for the symmetric group <span><math><msub><mrow><mi>S</mi></mrow><mrow><mi>n</mi></mrow></msub></math></span>. Our complex starts with the presentation for <span><math><msub><mrow><mi>S</mi></mrow><mrow><mi>n</mi></mrow></msub></math></span> with <span><math><mi>n</mi><mo>−</mo><mn>1</mn></math></span> adjacent transpositions with squaring, commuting, and braid relations, and adds seven classes of 3-cells that fill in certain 2-spheres bounded by these relations. We use a rewriting system and a combinatorial method of K. Brown to prove the correctness of our construction. Our main application is a computation of the second cohomology of <span><math><msub><mrow><mi>S</mi></mrow><mrow><mi>n</mi></mrow></msub></math></span> in certain twisted coefficient modules; we use this computation in a companion paper to study splitting of extensions related to braid groups. As another application, we give a concrete description of the third homology of <span><math><msub><mrow><mi>S</mi></mrow><mrow><mi>n</mi></mrow></msub></math></span> with untwisted coefficients in <span><math><mi>Z</mi></math></span>.</div></div>","PeriodicalId":100767,"journal":{"name":"Journal of Computational Algebra","volume":"15 ","pages":"Article 100038"},"PeriodicalIF":0.0,"publicationDate":"2025-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144517258","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Nested fifth root radical identities from elliptic curves","authors":"Joseph Tonien","doi":"10.1016/j.jaca.2025.100032","DOIUrl":"10.1016/j.jaca.2025.100032","url":null,"abstract":"<div><div>Ramanujan discovered the following elegant identity involving cube roots:<span><span><span><math><msqrt><mrow><mi>m</mi><mroot><mrow><mn>4</mn><mo>(</mo><mi>m</mi><mo>−</mo><mn>2</mn><mi>n</mi><mo>)</mo></mrow><mrow><mn>3</mn></mrow></mroot><mo>+</mo><mi>n</mi><mroot><mrow><mn>4</mn><mi>m</mi><mo>+</mo><mi>n</mi></mrow><mrow><mn>3</mn></mrow></mroot></mrow></msqrt><mo>=</mo><mo>±</mo><mfrac><mrow><mn>1</mn></mrow><mrow><mn>3</mn></mrow></mfrac><mo>(</mo><mroot><mrow><msup><mrow><mo>(</mo><mn>4</mn><mi>m</mi><mo>+</mo><mi>n</mi><mo>)</mo></mrow><mrow><mn>2</mn></mrow></msup></mrow><mrow><mn>3</mn></mrow></mroot><mo>+</mo><mroot><mrow><mn>4</mn><mo>(</mo><mi>m</mi><mo>−</mo><mn>2</mn><mi>n</mi><mo>)</mo><mo>(</mo><mn>4</mn><mi>m</mi><mo>+</mo><mi>n</mi><mo>)</mo></mrow><mrow><mn>3</mn></mrow></mroot><mo>−</mo><mroot><mrow><mn>2</mn><msup><mrow><mo>(</mo><mi>m</mi><mo>−</mo><mn>2</mn><mi>n</mi><mo>)</mo></mrow><mrow><mn>2</mn></mrow></msup></mrow><mrow><mn>3</mn></mrow></mroot><mo>)</mo><mo>.</mo></math></span></span></span></div><div>The goal of this paper is to derive nested fifth root radical identities in the form of<span><span><span><math><msqrt><mrow><msub><mrow><mi>P</mi></mrow><mrow><mn>1</mn></mrow></msub><mroot><mrow><msub><mrow><mi>Q</mi></mrow><mrow><mn>1</mn></mrow></msub></mrow><mrow><mn>5</mn></mrow></mroot><mo>+</mo><msub><mrow><mi>P</mi></mrow><mrow><mn>2</mn></mrow></msub><mroot><mrow><msub><mrow><mi>Q</mi></mrow><mrow><mn>2</mn></mrow></msub></mrow><mrow><mn>5</mn></mrow></mroot></mrow></msqrt><mo>=</mo><msub><mrow><mi>p</mi></mrow><mrow><mn>1</mn></mrow></msub><mroot><mrow><msub><mrow><mi>q</mi></mrow><mrow><mn>1</mn></mrow></msub></mrow><mrow><mn>5</mn></mrow></mroot><mo>+</mo><msub><mrow><mi>p</mi></mrow><mrow><mn>2</mn></mrow></msub><mroot><mrow><msub><mrow><mi>q</mi></mrow><mrow><mn>2</mn></mrow></msub></mrow><mrow><mn>5</mn></mrow></mroot><mo>+</mo><msub><mrow><mi>p</mi></mrow><mrow><mn>3</mn></mrow></msub><mroot><mrow><msub><mrow><mi>q</mi></mrow><mrow><mn>3</mn></mrow></msub></mrow><mrow><mn>5</mn></mrow></mroot><mo>+</mo><msub><mrow><mi>p</mi></mrow><mrow><mn>4</mn></mrow></msub><mroot><mrow><msub><mrow><mi>q</mi></mrow><mrow><mn>4</mn></mrow></msub></mrow><mrow><mn>5</mn></mrow></mroot><mo>+</mo><msub><mrow><mi>p</mi></mrow><mrow><mn>5</mn></mrow></msub><mroot><mrow><msub><mrow><mi>q</mi></mrow><mrow><mn>5</mn></mrow></msub></mrow><mrow><mn>5</mn></mrow></mroot><mo>.</mo></math></span></span></span> We show that these identities can be derived from a specific family of elliptic curves. Furthermore, we include the SageMath code for computing these expressions.</div></div>","PeriodicalId":100767,"journal":{"name":"Journal of Computational Algebra","volume":"13 ","pages":"Article 100032"},"PeriodicalIF":0.0,"publicationDate":"2025-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143829248","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Ideals of generic forms","authors":"Ralf Fröberg","doi":"10.1016/j.jaca.2025.100033","DOIUrl":"10.1016/j.jaca.2025.100033","url":null,"abstract":"<div><div>We determine the Hilbert series of some classes of ideals generated by generic forms of degree two and three, and investigate the difference to the Hilbert series of ideals generated by powers of linear generic forms of the corresponding degrees.</div></div>","PeriodicalId":100767,"journal":{"name":"Journal of Computational Algebra","volume":"13 ","pages":"Article 100033"},"PeriodicalIF":0.0,"publicationDate":"2025-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143844529","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}