Related papers: Second-Order Parameterizations for the Complexity …
We introduce new classes of general monotone sequences and study their properties. For functions whose Fourier coefficients belong to these classes, we establish Hardy-Littlewood-type theorems.
Dynamic Complexity studies the maintainability of queries with logical formulas in a setting where the underlying structure or database changes over time. Most often, these formulas are from first-order logic, giving rise to the dynamic…
We establish $L^p$-type universal approximation theorems for general and non-anticipative functionals on suitable rough path spaces, showing that linear functionals acting on signatures of time-extended rough paths are dense with respect to…
We give the theorem of coincidence of a class of functions defined by a generalised modulus of smoothness with a class of functions defined by the order of the best approximation by algebraic polynomials. We also prove the appropriate…
Within the framework of mappings between affine spaces, the notion of $n$-th polarization of a function will lead to an intrinsic characterization of polynomial functions. We prove that the characteristic features of derivations, such as…
We define the notion of {\em rational presentation of a complete metric space} in order to study metric spaces from the algorithmic complexity point of view. In this setting, we study some presentations of the space $\czu$ of uniformly…
We prove an extension to the classical continuity theorem in rough paths. We show that two $p$-rough paths are close in all levels of iterated integrals provided the first $\lfl p \rfl$ terms are close in a uniform sense. Applications…
The paper concerns the second-order generalized differentiation theory of variational analysis and new applications of this theory to some problems of constrained optimization in finitedimensional spaces. The main attention is paid to the…
This paper is devoted to the study of the second-order variational analysis of spectral functions. It is well-known that spectral functions can be expressed as a composite function of symmetric functions and eigenvalue functions. We…
In a previous paper, we provided some update in the treatment of the finiteness theorem for rational maps of finite degree from a fixed variety to varieties of general type. In the present paper we present another improvement, introducing…
We prove two-sided inequalities between the integral moduli of smoothness of a function on $\mathbb{R}^d/\mathbb{T}^d$ and the weighted tail-type integrals of its Fourier transform/series. Sharpness of obtained results in particular is…
Dimensional regularization of Euclidean momentum space integrals is a highly successful technique in renormalization of quantum field theories. While it yields a straightforward algorithmic method, with which to evaluate diagrams beyond…
We examine general aspects of parity functions arising in rational conformal field theories, as a result of Galois theoretic properties of modular transformations. We focus more specifically on parity functions associated with affine Lie…
On any metric space, I provide an intrinsic characterization of those complex-valued functions which are uniform limits of Lipschitz functions. There are applications to function theory on complete Riemannian manifolds and, in particular,…
A new notion of metric differentiability of set-valued functions at a point is introduced in terms of right and left limits of special set-valued metric divided differences of first order. A local metric linear approximant of a metrically…
In weighted Orlicz type spaces ${\mathcal S}_{_{\scriptstyle \mathbf p,\,\mu}}$ with a variable summation exponent, the direct and inverse approximation theorems are proved in terms of best approximations of functions and moduli of…
The synthesis of classical Computational Complexity Theory with Recursive Analysis provides a quantitative foundation to reliable numerics. Here the operators of maximization, integration, and solving ordinary differential equations are…
We introduce a notion of complexity of diagrams (and in particular of objects and morphisms) in an arbitrary category, as well as a notion of complexity of functors between categories equipped with complexity functions. We discuss several…
The parameterized complexity of a problem is considered "settled" once it has been shown to lie in FPT or to be complete for a class in the W-hierarchy or a similar parameterized hierarchy. Several natural parameterized problems have,…
This article establishes a bilinear embedding for second-order divergence-form operators with complex coefficients, characterized by the simultaneous presence of first-order terms and negative potentials. This work provides a further…