Related papers: Computational details on the disproof of modularit…
This is a report on a joint project in experimental mathematics with Jonas Bergstr\"om and Carel Faber where we obtain information about modular forms by counting curves over finite fields.
The cohomology ring of a finite group, with coefficients in a finite field, can be computed by a machine, as Carlson has showed. Here "compute" means to find a presentation in terms of generators and relations, and involves only the…
Given a smooth curve with weighted marked points, the Abel-Jacboi map produces a line bundle on the curve. This map fails to extend to the full boundary of the moduli space of stable pointed curves. Using logarithmic and tropical geometry,…
We prove that the Kupershmidt deformation of a bi-Hamiltonian system is itself bi-Hamiltonian. Moreover, Magri hierarchies of the initial system give rise to Magri hierarchies of Kupershmidt deformations as well. Since Kupershmidt…
Motivated by the Quantum Modularity Conjecture and its arithmetic aspects related to the Habiro ring of a number field, we define a map from the Kauffman bracket skein module of an integer homology 3-sphere to the Habiro ring, and use…
In this paper we discuss applications of our earlier work in studying certain Galois groups and splitting fields of rational functions in $\mathbb Q\left(X_0(N)\right)$ using Hilbert's irreducibility theorem and modular forms. We also…
A very classical subject in Commutative Algebra is the Invariant Theory of finite groups. In our work on 3-dimensional topology (S. King, Ideal Turaev-Viro invariants. To appear in Top. Appl.), we found certain examples of group actions on…
Let K be a number field, let A be a finite dimensional semisimple K-algebra and let Lambda be an O_K-order in A. It was shown in previous work that, under certain hypotheses on A, there exists an algorithm that for a given (left)…
In certain scientific domains, there is a need for tensor operations. To facilitate tensor computations,computer algebra systems are employed. In our research, we have been using Cadabra as the main computer algebra system for several…
The aim of this paper is to introduce a method for computing Hilbert decompositions (and consequently the Hilbert depth) of a finitely generated multigraded module $M$ over the polynomial ring $K[X_1,..., X_n]$ by reducing the problem to…
This survey article is devoted to the notions of purity, algebraic and $\Sigma$-algebraic compactness, direct sum decompositions, and representation type in the category of modules over a ring. It begins with basic definitions, a brief…
Almost from the inception of Hilbert's program, foundational and structural efforts in proof theory have been directed towards the goal of clarifying the computational content of modern mathematical methods. This essay surveys various…
We survey the application of computer algebra in the context of gravitational theories. After some general remarks, we show of how to check the second Bianchi-identity by means of the Reduce package Excalc. Subsequently we list some…
The subalgebra of the tautological ring of the moduli of curves of compact type generated by the kappa classes is studied. Relations, constructed via the virtual geometry of the moduli of stable maps, are used to prove universality results…
Information technologies for studying physical-mathematical disciplines on base of mathematical modeling in the computer algebra system Maple are described.
By any account, the 1998 proof of the Kepler conjecture is complex. The thesis underlying this article is that the proof is complex because it is highly under-automated. Throughout that proof, manual procedures are used where automated ones…
A survey on algorithms for computing discrete logarithms in Jacobians of curves over finite fields.
We report about significant enhancements of the complex algebraic geometry theorem proving subsystem in GeoGebra for automated proofs in Euclidean geometry, concerning the extension of numerous GeoGebra tools with proof capabilities. As a…
We develop algorithms to turn quotients of rings of rings of integers into effective Euclidean rings by giving polynomial algorithms for all fundamental ring operations. In addition, we study normal forms for modules over such rings and…
We describe an algorithm that provably computes the rational torsion subgroup of the Jacobian of a curve without relying on height bounds. Instead, the strategy is to find upper bounds for the torsion subgroup using reduction modulo primes,…