Related papers: Algorithms for experimenting with Zariski dense su…
The aim of this paper is twofold. First, we introduce a new method for evaluating the multiplicity of a given discrete series in the space of level $1$ automorphic forms of a split classical group $G$ over $\mathbb{Z}$, and provide…
Using currents with minimal singularities, we construct pointwise minimal multiplicities for a real pseudo-effective $(1,1)$-class $\alpha$ on a compact complex $n$-fold $X$, which are the local obstructions to the numerical effectivity of…
We study the class of 3-dimensional nonlinear 2-hessian equations mentioned in the text. We perform preliminary group classification on 2-hessian equation. In fact, we find additional equivalence transformation on the space (x,y,z,u,f),…
Generalized linear mixed models (GLMMs) are a widely used tool in statistical analysis. The main bottleneck of many computational approaches lies in the inversion of the high dimensional precision matrices associated with the random…
We give an effective version of a result reported by Serre asserting that the images of the Galois representations attached to an abelian surface with $\End(A)= \mathbb{Z}$ are as large as possible for almost every prime. Our algorithm…
We consider pairs of finitely presented, residually finite groups $P\hookrightarrow\G$ for which the induced map of profinite completions $\hat P\to \hat\G$ is an isomorphism. We prove that there is no algorithm that, given an arbitrary…
We develop a practical algorithm to decide whether a finitely generated subgroup of a solvable algebraic group $G$ is arithmetic. This incorporates a procedure to compute a generating set of an arithmetic subgroup of $G$. We also provide a…
In two previous papers [AGM1, AGM2] we computed cohomology groups H^5(\Gamma_0 (N); \C) for a range of levels N, where \Gamma_0 (N) is the congruence subgroup of SL_4 (\Z) consisting of all matrices with bottom row congruent to (0,0,0,*)…
In this paper, we prove the existence of an efficient algorithm for the computation of $q$-expansions of modular forms of weight $k$ and level $\Gamma$, where $\Gamma \subseteq SL_{2}({\mathbb{Z}})$ is an arbitrary congruence subgroup. We…
A subgradient method is presented for solving general convex optimization problems, the main requirement being that a strictly-feasible point is known. A feasible sequence of iterates is generated, which converges to within user-specified…
We show that for any finitely generated subgroup $H$ of a limit group $L$ there exists a finite-index subgroup $K$ containing $H$, such that $K$ is a subgroup of a group obtained from $H$ by a series of extensions of centralizers and free…
In this paper we present a novel algorithm for computing a congruence on an inverse semigroup from a collection of generating pairs. This algorithm uses a myriad of techniques from the theories of groups, automata, and inverse semigroups.…
We develop a probabilistic algorithm of Kronecker type for computing a Kronecker representation of a zero-dimensional linear section of an algebraic variety $V$ defined over a perfect field $k$. The variety $V$ is the Zariski closure of the…
In this paper, we describe a new hybrid algorithm for computing all singular triplets above a given threshold and provide its implementation in MATLAB/Octave and R. The high performance of our codes and ease at which they can be used,…
We use a (pre)-Kuznetsov type formula to prove a density result for the Borel-type congruence subgroup of GLn. This has some arithmetic applications to optimal lifting and counting considered earlier by A. Kamber and H. Lavner for $GL_3$.
The following refinement of the Higman embedding theorem is proved: A finitely generated group $R$ is recursively presented if and only if there exists a quasi-isometric malnormal embedding of $R$ into a finitely presented group $H$ such…
For $i=1,\ldots,k$, let $\mathbf{G}_i$ be a connected, simply connected, semisimple algebraic group over some local field $\kappa_i$ of characteristic zero. Let $G_i=\mathbf{G}_i(\kappa_i)$ be the $\kappa_i$-points of $\mathbf{G}_i$ and…
We investigate whether a finitely generated profinite group G could have a finitely generated infinite image. A result of Dan Segal shows that this is impossible if G is prosoluble. We prove that such an image does not exist if G is…
The polynomial method has been used recently to obtain many striking results in combinatorial geometry. In this paper, we use affine Hilbert functions to obtain an estimation theorem in finite field geometry. The most natural way to state…
We present an algorithm to compute the Hecke operators on the equivariant cohomology of an arithmetic subgroup $\Gamma$ of the general linear group $\mathrm{GL}_n$. This includes $\mathrm{GL}_n$ over a number field or a finite-dimensional…