Related papers: The strong approximation theorem and computing wit…
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…
We give a computationally effective criterion for determining whether a finite-index subgroup of SL(2, Z) is a congruence subgroup, extending earlier work of Hsu for subgroups of PSL(2, Z).
We prove three strong approximation theorems for the `supermarket' or `join the shortest queue' model -- a law of large numbers, a jump process approximation and a central limit theorem. The estimates are carried through rather explicitly.…
One of the aims of this paper is to obtain structural results showing that powerful subgroups are abundant in pro-$p$ groups admitting certain powerful quotients. In particular, we obtain an analogue of Baer's theorem for powerful pro-$p$…
The aim of this paper is to review how some approximation results in commutative algebra are being used to construct equisingular deformations of singularities. The first example of such an approximation result appeared for the first time…
We prove Schlichting's theorem for approximate subgroups: if $\mathcal{X}$ is a uniform family of commensurable approximate subgroups in some ambient group, then there exists an invariant approximate subgroup commensurable with…
We study a family of Zariski dense finitely generated discrete subgroups of $\mathrm{Isom}(\mathbb{H}^d)$, $d \geqslant 2$, defined by the following property: any group in this family contains at least one reflection in a hyperplane. As an…
We study the problem of constructing positive representations of complex measures. In this paper we consider complex densities on a direct product of $U(1)$ groups and look for representations by probability distributions on the…
We discuss a practical algorithm to compute parabolic Kazhdan-Lusztig polynomials. As an application we compute Kazhdan-Lusztig polynomials which are needed to evaluate a character formula for reductive groups due to Lusztig. Some…
We give a strong direct sum theorem for computing $xor \circ g$. Specifically, we show that for every function g and every $k\geq 2$, the randomized query complexity of computing the xor of k instances of g satisfies…
The absolute Galois group Gal$(\overline{\mathbb{Q}}/\mathbb{Q})$ of the field $\mathbb{Q}$ of rational numbers can be presented as a highly computable object, under the notion of type-2 Turing computation. We formalize such a presentation…
We begin by showing that commensurators of Zariski dense subgroups of isometry groups of symmetric spaces of non-compact type are discrete provided that the limit set on the Furstenberg boundary is not invariant under the action of a…
We prove a factorization theorem for Fuchsian groups similar to those proved by Agol and Liu for 3-manifold groups. As an application, we build Makanin-Razborov diagrams, which parametrize the collection of all discrete representations from…
We address two questions of Simon Thomas. First, we show that for any n>2 one can find a four generated free subgroup of SLn(Z) which is profinitely dense. More generally, we show that an arithmetic group \Gamma which admits the congruence…
We show that quantum query complexity satisfies a strong direct product theorem. This means that computing $k$ copies of a function with less than $k$ times the quantum queries needed to compute one copy of the function implies that the…
We classify the finitely generated prosupersolvable groups that satisfy Schreier's formula for the number of generators of open subgroups.
The universal approximation theorem asserts that a single hidden layer neural network approximates continuous functions with any desired precision on compact sets. As an existential result, the universal approximation theorem supports the…
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.…
In this paper we prove that all irrational numbers from totally real cubic number fields are well approximable by rationals (i.e. the partial quotients in the continued fraction expansion of such a number are unbounded). This settles the…
Relations and interactions between the theorems of Ash, Herwig--Lascar and Ribes--Zalesskii are discussed and it is shown that these three theorems are equivalent in the sense that each of them can be derived from each other one. Some…