Related papers: Smoothed Analysis of Interior-Point Algorithms: Co…
In this paper, we study the partial data inverse boundary value problem for the Schrodinger operator at a high frequency k>=1 in a bounded domain with smooth boundary in Rn, n>=3. Assuming that the potential is known in a neighborhood of…
We investigate dynamic algorithms for the interval scheduling problem. Our algorithm runs in amortised time $O(\log n)$ for query operation and $O(d\log^2 n)$ for insertion and removal operations, where $n$ and $d$ are the maximal numbers…
We consider the sensitivity of real roots of polynomial systems with respect to perturbations of the coefficients. In particular - for a version of the condition number defined by Cucker, Krick, Malajovich, and Wschebor - we establish new…
We deal with Calder\'on's problem in a layered anisotropic medium $\Omega\subset\mathbb{R}^n$, $n\geq 3$, with complex anisotropic admittivity $\sigma=\gamma A$, where $A$ is a known Lipschitz matrix-valued function. We assume that the…
On a smooth discretely ringed adic space $\mathcal{X}$ over a field $k$ we define a subsheaf $\Omega_{\mathcal{X}}^+$ of the sheaf of differentials $\Omega_{\mathcal{X}}$. It is defined in a similar way as the subsheaf…
We investigate the presence of localized analytical solutions of the Schr\"odinger equation with logarithm nonlinearity. After including inhomogeneities in the linear and nonlinear coefficients, we use similarity transformation to convert…
We study the regularity of Fourier integral operators, by allowing their symbols to satisfy certain multi-parameter characteristics. As a result, we give an extension of Seeger-Sogge-Stein theorem on product spaces.
The logarithmic Schr\"odinger equation (LogSE) has a logarithmic nonlinearity $f(u)=u\ln |u|^2$ that is not differentiable at $u=0.$ Compared with its counterpart with a regular nonlinear term, it possesses richer and unusual dynamics,…
We study the computational complexity of deciding whether a given set of term equalities and inequalities has a solution in an $\omega$-categorical algebra $\mathfrak{A}$. There are $\omega$-categorical groups where this problem is…
We prove that the equational complexity function for the variety of representable relation algebras is bounded below by a log-log function.
We address the problem of minimizing a smooth function $f^0(x)$ over a compact set $D$ defined by smooth functional constraints $f^i(x)\leq 0,~ i = 1,\ldots, m$ given noisy value measurements of $f^i(x)$. This problem arises in…
In this note we prove that a smooth order satisfying the reverse geometric engineering of singularities conditions in stringtheory (in any compactifying dimension) is Auslander regular. Moreover, we classify the etale local structure of…
Smoothed analysis is a framework for analyzing the complexity of an algorithm, acting as a bridge between average and worst-case behaviour. For example, Quicksort and the Simplex algorithm are widely used in practical applications, despite…
It is well known that the optimal convergence rate for stochastic optimization of smooth functions is $O(1/\sqrt{T})$, which is same as stochastic optimization of Lipschitz continuous convex functions. This is in contrast to optimizing…
We prove a local smoothing result for the Schr\"odinger equation on a class of surfaces of revolution which have infinitely many trapped geodesics. Our main result is a local smoothing estimate with loss (compared to \cite{ChMe-lsm})…
For fields that vary slowly on the scale of the lightest mass the logarithm of the vacuum functional of a massive quantum field theory can be expanded in terms of local functionals satisfying a form of the Schr\"odinger equation, the…
We analyse the complexity of solving the discrete logarithm problem and of testing the principality of ideals in a certain class of number fields. We achieve the subexponential complexity in $O(L(1/3,O(1)))$ when both the discriminant and…
This work is motivated by a question whether it is possible to calculate a chaotic sequence efficiently, e.g., is it possible to get the $n$-th bit of a bit sequence generated by a chaotic map, such as $\beta$-expansion, tent map and…
The evaluation of iterated primitives of powers of logarithms is expressed in closed form. The expressions contain polynomials with coefficients given in terms of the harmonic numbers and their generalizations. The logconcavity of these…
Successive quadratic approximations (SQA) are numerically efficient for minimizing the sum of a smooth function and a convex function. The iteration complexity of inexact SQA methods has been analyzed recently. In this paper, we present an…