Related papers: Algorithmic Proof of the Epsilon Constant Conjectu…
Motivated by Ridgway's proof of the perceptron algorithm, we study a simple subgradient method for convex inequality systems in Hilbert space. Assuming strict feasibility and bounded subgradients, we establish finite termination for several…
We consider the problem of the minimizer constancy in the fractional embedding theorem $\mathcal{H}^s(\Omega) \hookrightarrow L_q(\Omega)$ for a bounded Lipschitz domain $\Omega,$ depending on the domain size. For the family of domains…
We study local-global principles for torsors under reductive linear algebraic groups over semi-global fields; i.e., over one variable function fields over complete discretely valued fields. We provide conditions on the group and the…
For the finite element solution of Poisson's equation, a local a posteriori error estimation based on the Hypercircle method is proposed. Even for the solution of Poisson's equation without the $H^2$ regularity, this method can provide…
We prove that every bounded function $f:\{-1,1\}^n\to[-1,1]$ of degree at most $d$ can be learned with $L_2$-accuracy $\varepsilon$ and confidence $1-\delta$ from $\log(\tfrac{n}{\delta})\,\varepsilon^{-d-1} C^{d^{3/2}\sqrt{\log d}}$ random…
The long-standing problem of minimal projections is addressed from a computational point of view. Techniques to determine bounds on the projection constants of univariate polynomial spaces are presented. The upper bound, produced by a…
We show a deterministic constant-time local algorithm for constructing an approximately maximum flow and minimum fractional cut in multisource-multitarget networks with bounded degrees and bounded edge capacities. Locality means that the…
The local minimum degree of a graph is the minimum degree that can be reached by means of local complementation. For any n, there exist graphs of order n which have a local minimum degree at least 0.189n, or at least 0.110n when restricted…
Constant workspace algorithms use a constant number of words in addition to the read-only input to the algorithm. In this paper, we devise algorithms to efficiently compute relative hulls in the plane using a constant workspace.…
In this paper, we explicitly compute the standard epsilon factors on both sides of the local Langlands correspondence for simple supercuspidal representations of GL(n,F).
We generalize $\epsilon$-pseudospectra and the associated computational algorithms to the generalized eigenvalue problem. Rank one perturbations are used to determine the $\epsilon$-pseudospectra.
We give a conditional proof of the Uniform Boundedness Conjecture of Morton and Silverman in the case of polynomials over number fields, assuming a standard conjecture in arithmetic geometry. Our technique simultaneously yields a dynamical…
We consider methods for obtaining local lower bounds on characteristics of quantum (correspondingly, classical) systems, i.e. lower bounds valid in the trace norm $\epsilon$-neighborhood of a given state (correspondingly, probability…
We establish sufficient conditions for perfect simulation of chains of infinite order on a countable alphabet. The new assumption, localized continuity, is formalized with the help of the notion of context trees, and includes the…
We discuss continued fractions on real quadratic number fields of class number 1. If the field has the property of being 2-stage euclidean, a generalization of the euclidean algorithm can be used to compute these continued fractions.…
An usual problem in statistics consists in estimating the minimizer of a convex function. When we have to deal with large samples taking values in high dimensional spaces, stochastic gradient algorithms and their averaged versions are…
A low-degree test is a collection of simple, local rules for checking the proximity of an arbitrary function to a low-degree polynomial. Each rule depends on the function's values at a small number of places. If a function satisfies many…
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…
By the introduction of locally constant prefactorization algebras at a fixed scale, we show a mathematical incarnation of the fact that observables at a given scale of a topological field theory propagate to every scale over euclidean…
Quantum compiling addresses the problem of approximating an arbitrary quantum gate with a string of gates drawn from a particular finite set. It has been shown that this is possible for almost all choices of base sets and furthermore that…