Related papers: An algorithm to compute Selmer groups via resoluti…
Let Q be an affine semigroup generating Z^d, and fix a finitely generated Z^d-graded module M over the semigroup algebra k[Q] for a field k. We provide an algorithm to compute a minimal Z^d-graded injective resolution of M up to any desired…
For a differential operator $L$ of order $n$ over $C(z)$ with a finite (differential) Galois group $G\subset {\rm GL}(C^n)$, there is an algorithm, by M. van Hoeij and J.-A.~Weil, which computes the associated evaluation of the invariants…
Let $p\geq 5$ be a prime number. In this paper, we construct Galois representations associated with modular forms for which the dimension of the $p$-torsion in the Bloch-Kato Selmer group can be made arbitrarily large. Our result extends…
Let $K$ be a $p$-adic field and $T$ a lattice in a semistable representation of $\mathrm{Gal}(\overline{K}/K)$ with Hodge-Tate weights in $[0, r]$. Assuming $0\leq r<p-1$, we prove that for a semistable extension of $\mathbb{Z}_p$ by $T$,…
Let K be a subfield of the complex numbers, and let D be the Weyl algebra of K-linear differential operators on K[x_1,...,x_n]. If M and N are holonomic left D-modules we present an algorithm that computes explicit generators for the finite…
Let $\tilde{f}(X)\in\mathbb{Z}[X]$ be a degree-$n$ polynomial such that $f(X):=\tilde{f}(X)\bmod p$ factorizes into $n$ distinct linear factors over $\mathbb{F}_p$. We study the problem of deterministically factoring $f(X)$ over…
Let $G$ be a finite abelian group $G$ with $N$ elements. In this paper we give a O(N) time algorithm for computing a basis of $G$. Furthermore, we obtain an algorithm for computing a basis from a generating system of $G$ with $M$ elements…
We consider the problem whether for a group G there exists a constant Lambda(G) > 1 such that for any (r,s)-matrix A over the integral group ring ZG the Fuglede-Kadison determinant of the G-equivariant bounded operator from L^2(G)^r to…
For a homogeneous space X of a connected algebraic group G (with connected stabilizers) over a field k of characteristic zero, we construct a canonical complex of Galois modules of length 3 and a canonical isomorphism between an…
In this paper we propose a general method for computing a minimal free right resolution of a finitely presented graded right module over a finitely presented graded noncommutative algebra. In particular, if such module is the base field of…
Let G be a reductive algebraic group associated to a self-adjoint homogeneous cone defined over Q, and let G' be an appropriate neat arithmetic subgroup of G. We present two algorithms to compute the action of the Hecke operators on the…
Given a connected reductive algebraic group $G$, we consider the class of spherical subgroups $H \subset G$ such that $H$ is regularly embedded in a parabolic subgroup $P \subset G$ and $H,P$ have a common Levi subgroup $L$. In a previous…
We investigate the complexity of deciding, given a multiplication table representing a semigroup S, a subset X of S and an element t of S, whether t can be expressed as a product of elements of X. It is well-known that this problem is…
We present two approaches that can be used to compute modular forms on noncongruence subgroups. The first approach uses Hejhal's method for which we improve the arbitrary precision solving techniques so that the algorithm becomes about up…
Originally motivated by algebraic invariant theory, we present an algorithm to enumerate integer vectors modulo the action of a permutation group. This problem generalizes the generation of unlabeled graph up to an isomorphism. In this…
We compute the first explicit polynomials with Galois groups $G=P\Gamma L_3(4)$, $PGL_3(4)$, $PSL_3(4)$ and $PSL_5(2)$ over $\mathbb{Q}(t)$. Furthermore we compute the first examples of totally real polynomials with Galois groups…
In this paper we consider the problem of computing the difference Galois groups of order three equations for a large class of difference operators including the shift operator (Case S), the $q$-difference operator (Case Q), the Mahler…
One standard approach to compute the Hilbert function of any graded module over a field is to come up with a free-resolution for the graded module and another is via a Hilbert power series which serves as a generating function. The proposed…
We present a family of algorithms for computing the Galois group of a polynomial defined over a $p$-adic field. Apart from the "naive" algorithm, these are the first general algorithms for this task. As an application, we compute the Galois…
In this paper, we describe an algorithm for computing algebraic modular forms on compact inner forms of $\mathrm{GSp}_4$ over totally real number fields. By analogues of the Jacquet-Langlands correspondence for $\mathrm{GL}_2$, this…