Related papers: Approximate Converse Theorem
We obtain an upper bound for the dimension of the cuspidal automorphic forms for $\mathrm{GL}_2$ over a number field, whose archimedean local representations are not tempered. More precisely, we prove the following result. Let $F$ be a…
We give an algorithm for computing the irreducible admissible representations of a real reductive group with regular integral infinitesimal character. This algorithm has been implemented on a computer, as part of the Atlas of Lie Groups and…
We prove an integrality result for the value at s=1 of the adjoint L-function associated to a cohomological cuspidal automorphic representation on GL(n) over any number field. We then show that primes (outside an exceptional set) dividing…
We prove that the inverse of a positive-definite matrix can be approximated by a weighted-sum of a small number of matrix exponentials. Combining this with a previous result [OSV12], we establish an equivalence between matrix inversion and…
Using lattice approximations of Euclidean space, we develop a way to approximate stable processes that are represented by stochastic integrals over Euclidean space. Via a stable version of the Lindeberg-Feller Theorem we show that the…
Loop groups G as families of mappings of the complex manifold M into another complex manifold N preserving marked points $s_0\in M$ and $y_0\in N$ are investigated. Quasi-invariant measures $\mu $ on G relative to dense subgroups $G'$ are…
We study a non local approximation of the Gaussian perimeter, proving the Gamma convergence to the local one. Surprisingly, in contrast with the local setting, the halfspace turns out to be a volume constrained stationary point if and only…
We give direct and inverse theorems for the weighted approximation of functions with inner singularities by combinations of Bernstein polynomials.
Given a pair of distinct unitary cuspidal automorphic representations for GL(n) over a number field, let S denote the set of finite places at which the automorphic representations are unramified and their associated Hecke eigenvalues…
The aim of this note is to present a self-contained proof of the fact that a function can be approximated using a linear combination of Gaussian coherent states, with a number of terms controlled in terms of the smoothness and of the decay…
This article is concerned with the approximation of unbounded convex sets by polyhedra. While there is an abundance of literature investigating this task for compact sets, results on the unbounded case are scarce. We first point out the…
We generalize Dirichlet's diophantine approximation theorem to approximating any real number $\alpha$ by a sum of two rational numbers $\frac{a_1}{q_1} + \frac{a_2}{q_2}$ with denominators $1 \leq q_1, q_2 \leq N$. This turns out to be…
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…
Final representation of all those measures $\mu$ for which algebraic polynomials are dense in $L_p(R, d\mu)$ is found. The weighted analogue of the Weierstrass polynomial approximation theorem and a new version of the M. Krein's theorem…
In this paper we develop proximal methods for statistical learning. Proximal point algorithms are useful in statistics and machine learning for obtaining optimization solutions for composite functions. Our approach exploits closed-form…
We consider the problem of recovering an unknown signal ${\mathbf x}\in {\mathbb R}^n$ from general nonlinear measurements obtained through a generalized linear model (GLM), i.e., ${\mathbf y}= f\left({\mathbf A}{\mathbf x}+{\mathbf…
The form factor of the unitary group U(N) endowed with the Haar measure characterizes the correlations within the spectrum of a typical unitary matrix. It can be decomposed into a sum over pairs of ``periodic orbits'', where by periodic…
The class of convex sets that admit approximations as Minkowski sum of a compact convex set and a closed convex cone in the Hausdorff distance is introduced. These sets are called approximately Motzkin-decomposable and generalize the notion…
The increasing deployment of machine learning as well as legal regulations such as EU's GDPR cause a need for user-friendly explanations of decisions proposed by machine learning models. Counterfactual explanations are considered as one of…
We show that badly approximable vectors are exactly those that cannot, for any inhomogeneous parameter, be inhomogeneously approximated at every monotone divergent rate. This implies in particular that Kurzweil's Theorem cannot be…