Related papers: Computational details on the disproof of modularit…
The efficient computation of Jacobians represents a fundamental challenge in computational science and engineering. Large-scale modular numerical simulation programs can be regarded as sequences of evaluations of in our case differentiable…
The present text surveys some relevant situations and results where basic Module Theory interacts with computational aspects of operator algebras. We tried to keep a balance between constructive and algebraic aspects.
Computational reflection allows us to turn verified decision procedures into efficient automated reasoning tools in proof assistants. The typical applications of such methodology include mathematical structures that have decidable theory…
In this survey paper we present recent results obtained by Khare, Wintenberger and the author that have led to a proof of Serre's conjecture, such as existence of compatible families, modular upper bounds for universal deformation rings and…
The moduli space of generalized deformations of a Calabi-Yau hypersurface is computed in terms of the Jacobian ring of the defining polynomial. The fibers of the tangent bundle to this moduli space carry algebra structures, which are…
We illustrate the use of the computer algebra system Macaulay2 for simplifications of classical unirationality proofs. We explicitly treat the moduli spaces of curves of genus g=10, 12 and 14.
An accurate method to compute enclosures of Abelian integrals is developed. This allows for an accurate description of the phase portraits of planar polynomial systems that are perturbations of Hamiltonian systems. As an example, it is…
The theory of modular deformations is generalized for the category of complex analytic polyhedra which includes germs of complex space as well as any compact complex analytic space. The objective of the theory is a construction of fine…
Quantum computation has suggested, among others, the consideration of "non-quantum" systems which in certain respects may behave "quantum-like". Here, what algebraically appears to be the most general possible known setup, namely, of {\it…
These notes survey some basic results in toric varieties over a field with examples and applications. A computer algebra package (written by the second author) is described which deals with both affine and projective toric varieties in any…
We present a computer algebra package based on Magma for performing computations in rational Cherednik algebras at arbitrary parameters and in Verma modules for restricted rational Cherednik algebras. Part of this package is a new general…
We present a complete reimplementation of the LinearSystem package of Magma, with substantial improvements in design and performance. The resulting efficiency enables computations that were previously out of reach. We briefly describe the…
A construction of the magic square, and hence of exceptional Lie algebras, is carried out using trialities rather than division algebras. By way of preparation, a comprehensive discussion of trialities is given, incorporating a number of…
Given a compact Riemann surface X with an action of a finite group G, the group algebra Q[G] provides an isogenous decomposition of its Jacobian variety JX, known as the group algebra decomposition of JX. We obtain a method to concretely…
This paper constructs a cirquent calculus system and proves its soundness and completeness with respect to the semantics of computability logic (see http://www.cis.upenn.edu/~giorgi/cl.html). The logical vocabulary of the system consists of…
We show how the output of the algorithm to compute modular Galois representations described in our previous article can be certified. We have used this process to compute certified tables of such Galois representations obtained thanks to an…
We give explicit structure of the graded ring of modular forms with respect to Gamma(N) (N=1,2,3,4,5,6,7,8,9,10,12,16,18) and for some other congruence groups. We also study the modular forms of half-integer weight for certain groups.
A particular case of the Jacobian conjecture is considered and for small dimensional cases a computational approach is offered
In this note we give a theoretical support by means of quotient polynomial rings for the computation formulas of the dimension of abelian codes.
Given a non-negative integer $n$, we establish a formula for the number of finite magmas on a set with cardinality $n$ up to isomorphism. We then generalize the method to operations with arbitrary finite arity, which yields a corrected…