Related papers: Computational details on the disproof of modularit…
We give a sufficient condition for a model theoretic structure $B$ to 'inherit' quantifier elimination from another structure $A$. This yields an alternative proof of one of the main result from \cite{kle}, namely quantifier elimination for…
The purpose of this paper is to study the cohomology rings of universal compactified Jacobians. Over the moduli space $\overline{\mathcal{M}}_{g,n}$ of Deligne-Mumford stable marked curves with $n\geq 1$, on the one hand we show that the…
We present relations between cycles with rational coefficients modulo algebraic equivalence on the Jacobian of a curve. These relations depend on the linear systems the curve admits. They are obtained in the tautological ring, the smallest…
In this paper, we consider systems of algebraic and non-linear partial differential equations and inequations. We decompose these systems into so-called simple subsystems and thereby partition the set of solutions. For algebraic systems,…
Let $\mathbb{Z}^{ab}$ be the ring of integers of $\mathbb{Q}^{ab}$, the maximal abelian extension of $\mathbb{Q}$. We show that there exists an algorithm to decide whether a system of equations and inequations, with integer coefficients,…
This article accompanies my lecture at the 2015 AMS summer institute in algebraic geometry in Salt Lake City. I survey the recent advances in the study of tautological classes on the moduli spaces of curves. After discussing the…
We prove that the theory of all modules over the ring of algebraic integers is decidable.
A $\Sigma^*$-algebra is a concrete $C^*$-algebra that is sequentially closed in the weak operator topology. We study an appropriate class of $C^*$-modules over $\Sigma^*$-algebras analogous to the class of $W^*$-modules (selfdual…
This paper presents a new refutation procedure for multimodular systems of integer constraints that commonly arise when verifying cryptographic protocols. These systems, involving polynomial equalities and disequalities modulo different…
Motivated by the need for efficient isomorphism tests for finite groups, we present a polynomial-time method for deciding isomorphism within a class of groups that is well-suited to studying local properties of general finite groups. We…
In this note, we extend modular techniques for computing Gr\"obner bases from the commutative setting to the vast class of noncommutative $G$-algebras. As in the commutative case, an effective verification test is only known to us in the…
Basic elements of integral calculus over algebras of iterated differential forms, are presented. In particular, defining complexes for modules of integral forms are described and the corresponding berezinians and complexes of integral forms…
Unlike classical modular forms, there is currently no general way to implement the computation of Siegel modular forms of arbitrary weight, level and character, even in degree two. There is however, a way to do it in a unified way. After…
The earlier paper "Introduction to clarithmetic I" constructed an axiomatic system of arithmetic based on computability logic (see http://www.cis.upenn.edu/~giorgi/cl.html), and proved its soundness and extensional completeness with respect…
We describe algorithms to compute elliptic functions and their relatives (Jacobi theta functions, modular forms, elliptic integrals, and the arithmetic-geometric mean) numerically to arbitrary precision with rigorous error bounds for…
Since the early twentieth century, it has been understood that mathematical definitions and proofs can be represented in formal systems systems with precise grammars and rules of use. Building on such foundations, computational proof…
Although the Turing-machine model of computation is widely used in computer science it is fundamentally inadequate as a foundation for the theory of modern scientific computation. The real-number model is described as an alternative.…
In this article, we list a few hypergeometric supercongruence conjectures based on two evaluation formulas of Whipple and numeric data computed using Magma and Sagemath.
These notes outline a formal method for program verification of numerical computation. It forms the basis of the software package VPC in its initial phase of development. Much of the style of presentation is in the form of notes that…
There are nontrivial dualities and parallels between polynomial algebras and the Grassmann algebras. This paper is an attempt to look at the Grassmann algebras at the angle of the Jacobian conjecture for polynomial algebras (which is the…