Related papers: The strong approximation theorem and computing wit…
Let $\Ga$ be a connected, solvable linear algebraic group over a number field~$K$, let $S$ be a finite set of places of~$K$ that contains all the infinite places, and let $\theints$ be the ring of $S$-integers of~$K$. We define a certain…
Let $K$ be a number field with ring of integers $\mathcal{O}_K$. We describe and classify finite, flat, and linearly reductive subgroup schemes of $\mathrm{SL}_2$ over $\mathrm{Spec}\:\mathcal{O}_K$. We also establish finiteness results for…
In this article, we establish the arithmetic purity of strong approximation for smooth loci of weighted projective spaces. By using this result and the descent method, we also prove that the arithmetic purity of strong approximation with…
We consider the quantum complexity of estimating matrix elements of unitary irreducible representations of groups. For several finite groups including the symmetric group, quantum Fourier transforms yield efficient solutions to this…
Let $S$ be a finite set of primes. For sufficiently large $n$ and $d$, Lawrence and Venkatesh proved that in the moduli space of hypersurfaces of degree $d$ in $\mathbb{P}^n$, the locus of points with good reduction outside $S$ is not…
We construct examples of finitely generated decidable group presentations that satisfy certain combinations of solvability for the word problem, solvability for the bounded word problem, and computablity for the Dehn function. We prove that…
We establish spectral convergence results of approximations of unbounded non-selfadjoint linear operators with compact resolvents by operators that converge in generalized strong resolvent sense. The aim is to establish general assumptions…
Bayesian inference requires approximation methods to become computable, but for most of them it is impossible to quantify how close the approximation is to the true posterior. In this work, we present a theorem upper-bounding the KL…
In this paper we investigate some strong convergence theorems for partial sums with respect to Vilenkin system.
Let K be the function field of a curve over the complex field. Let X be a homogeneous space of a semisimple linear algebraic group. Strong approximation holds for X outside any finite nonempty set of places of K. Strong approximation fails…
We provide the strong approximation of empirical copula processes by a Gaussian process. In addition we establish a strong approximation of the smoothed empirical copula processes and a law of iterated logarithm.
We introduce the concept of a strongly t-logarithmic t-generating set for a Z[t,t^{-1}]-module, which enables us to prove that a large class of soluble groups are not almost convex. We also prove some results about dead-end depth.
Constraint satisfaction problems (CSPs) consist of a set of variables taking values from some finite domain and a set of local constraints on these variables. The objective is to find an assignment to the variables that maximizes the…
We discuss certain effective improvements on superrigidity for $SL_n(\mathbb{Z})$ for finite $n>2$. Using these ideas we then use superrigidity to prove a representation stability theorem about pointwise finite dimensional…
Let $K=k(C)$ be the function field of a curve over a field $k$ and let $X$ be a smooth, projective, separably rationally connected $K$-variety with $X(K)\neq\emptyset$. Under the assumption that $X$ admits a smooth projective model $\pi:…
We display four approximation theorems for manifold-valued mappings. The first one approximates holomorphic embeddings on pseudoconvex domains in $\Bbb C^n$ with holomorphic embeddings with dense images. The second theorem approximates…
For $k\geq 2$, we give a detailed exposition of the superior $k$-highly composite numbers. We then consider the function \[f_k(n)=\frac{\log d_k(n)\log\log n}{\log k\log n},\quad n\geq 3\] which has a maximum value $\lambda(k)$ at a…
Let $P$ be a subset of the primes of lower density strictly larger than $\frac12$. Then, every sufficiently large even integer is a sum of four primes from the set $P$. We establish similar results for $k$-summands, with $k\geq 4$, and for…
A conic program is the problem of optimizing a linear function over a closed convex cone intersected with an affine preimage of another cone. We analyse three constraint qualifications, namely a Closedness CQ, Slater CQ, and Boundedness CQ…
We detail an explicit construction of ordinary irreducible representations for the family of finite groups $SL_2({\mathbb Z} /p^n {\mathbb Z})$ for odd primes $p$ and $n\geq 2$. For $n=2$, the construction is a complete set of irreducible…