Related papers: Algebraic properties of robust Pad\'e approximants
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…
Nodal superconductors without inversion symmetry exhibit nontrivial topological properties, manifested by topologically protected flat-band edge states. Here we study the effects of breaking translational symmetry, crucial to the definition…
For all non-symmetric discrete relativistic Toda type equations we establish a relation to 3D consistent systems of quad-equations. Unlike the more simple and better understood symmetric case, here the three coordinate planes of $\mathbb…
The stability theory of compact metric spaces with positive topological dimension is a well-established area in Dynamical Systems. A central result, attributed to Walters, connects the concepts of topological stability and the shadowing…
Consider the approximation of stochastic Allen-Cahn-type equations (i.e. $1+1$-dimensional space-time white noise-driven stochastic PDEs with polynomial nonlinearities $F$ such that $F(\pm \infty)=\mp \infty$) by a fully discrete space-time…
We consider linear programs involving uncertain parameters and propose a new tractable robust counterpart which contains and generalizes several other models including the existing Affinely Adjustable Robust Counterpart and the Fully…
Unique existence of analytically strong solutions to stochastic partial differential equations (SPDE) with drift given by the subdifferential of a quasi-convex function and with general multiplicative noise is proven. The proof applies a…
We prove explicit approximation hardness results for the Graphic TSP on cubic and subcubic graphs as well as the new inapproximability bounds for the corresponding instances of the (1,2)-TSP. The proof technique uses new modular…
We consider the problem of estimating the discrete clustering structures under the Sub-Gaussian Mixture Model. Our main results establish a hidden integrality property of a semidefinite programming (SDP) relaxation for this problem: while…
For a constraint satisfaction problem (CSP), a robust satisfaction algorithm is one that outputs an assignment satisfying most of the constraints on instances that are near-satisfiable. It is known that the CSPs that admit efficient robust…
This is the main paper of a series establishing the linear stability of Schwarzschild-Anti-de Sitter (AdS) black holes to gravitational perturbations. Specifically, we prove that solutions to the linearisation of the Einstein equations…
We introduce a set of combinatorial techniques for studying the simplicial bounded cohomology of semi-simplicial sets, simplicial complexes and posets. We apply these methods to prove several new bounded acyclicity results for…
We show that the existence of a computationally efficient calibration algorithm, with a low weak calibration rate, would imply the existence of an efficient algorithm for computing approximate Nash equilibria - thus implying the unlikely…
This study is motivated by the recent development in the fractional calculus and its applications. During last few years, several different techniques are proposed to localize the nonlocal fractional diffusion operator. They are based on…
A classical approach to the Calder\'on problem is to estimate the unknown conductivity by solving a nonlinear least-squares problem. It leads to a nonconvex optimization problem which is generally believed to be riddled with bad local…
Rational approximations of functions with singularities can converge at a root-exponential rate if the poles are exponentially clustered. We begin by reviewing this effect in minimax, least-squares, and AAA approximations on intervals and…
Motivated by a question of Hansen and Li, we show that a smooth and proper rigid analytic space $X$ with projective reduction satisfies Hodge symmetry in the following situations: (1) the base non-archimedean field $K$ is of residue…
We reconsider the Euler-Lagrange equation for the Skyrme model in the hedgehog ansatz and study the analytical properties of the solitonic solution. In view of the lack of a closed form solution to the problem, we work on approximate…
The solution approximation for partial differential equations (PDEs) can be substantially improved using smooth basis functions. The recently introduced mollified basis functions are constructed through mollification, or convolution, of…
Solving sparse linear systems from discretized PDEs is challenging. Direct solvers have in many cases quadratic complexity (depending on geometry), while iterative solvers require problem dependent preconditioners to be robust and…