Related papers: Epsilon-complexity of continuous functions
The separately continuity topology is considered and some its properties are investigated. With help of these properties a generalization of Sierpinski theorem on determination of real separately continuous function by its values on an…
Depth is a complexity measure for natural systems of the kind studied in statistical physics and is defined in terms of computational complexity. Depth quantifies the length of the shortest parallel computation required to construct a…
We introduce the notion of a pseudomultiplier of a Hilbert space $\mathcal H$ of functions on a set $\Omega$. Roughly, a pseudomultiplier of $\mathcal H$ is a function which multiplies a finite-codimensional subspace of $\mathcal H$ into…
The notion of slow entropy, both upper and lower slow entropy, was defined by Katok and Thouvenot as a more refined measure of complexity for dynamical systems, than the classical Kolmogorov-Sinai entropy. For any subexponential rate…
The purpose of this paper is to answer two questions left open in [B. Durand, A. Shen, and N. Vereshchagin, Descriptive Complexity of Computable Sequences, Theoretical Computer Science 171 (2001), pp. 47--58]. Namely, we consider the…
Analytic continuation problems are notoriously ill-posed without additional regularizing constraints, even though every analytic function has a rigidity property of unique continuation from every curve inside the domain of analyticity. In…
In this paper, we first study the definition and the continuity of the complex Hessian operator associated to an $m$-positive closed current $T$, for some classes of unbounded $m$-subharmonic functions as well as when we consider a…
We consider a subclass of tilings, the tilings obtained by cut and projection. Under somewhat standard assumptions, we show that the natural complexity function has polynomial growth. We compute its exponent \alpha in terms of the ranks of…
We extend the concept of Krylov complexity to include general unitary evolutions involving multiple generators. This generalization enables us to formulate a framework for generalized Krylov complexity, which serves as a measure of the…
We present a unified framework to study threshold functions for the existence of solutions to linear systems of equations in random sets which includes arithmetic progressions, sum-free sets, $B_{h}[g]$-sets and Hilbert cubes. In…
In many everyday categories (sets, spaces, modules, ...) objects can be both added and multiplied. The arithmetic of such objects is a challenge because there is usually no subtraction. We prove a family of cases of the following principle:…
Our basic concept is the set $\mathcal{E}(H)$ of effects on a finite dimensional complex Hilbert space $H$. If $a,b\in\mathcal{E}(H)$, we define the sequential product $a[\mathcal{I}]b$ of $a$ then $b$. The sequential product depends on the…
The present work is devoted to an extension of the well-known Ehrling inequalities, which quantitatively characterize compact embeddings of function spaces, to more general operators. Firstly, a modified notion of continuity for linear…
Superoscillatory functions represent a counterintuitive phenomenon in physics but also in mathematics, where a band-limited function oscillates faster than its highest Fourier component. They appear in various contexts, including quantum…
The subword complexity of a finite word $w$ of length $N$ is a function which associates to each $n\le N$ the number of all distinct subwords of $w$ having the length $n$. We define the \emph{maximal complexity} C(w) as the maximum of the…
We introduce certain linear positive operators and study some approximation properties of these operators in the space of functions, continuous on a compact set, of two variables. We also find the order of this approximation by using…
We determine a reasonable upper bound for the complexity of collection from the left to multiply two elements of a finite soluble, or polycyclic, group by restricting attention to certain polycyclic presentations of the group.
The essential variables in a finite function $f$ are defined as variables which occur in $f$ and weigh with the values of that function. The number of essential variables is an important measure of complexity for discrete functions. When…
A solution to the part and whole problem is presented in this paper by using a complex mathematical representation that permits to define the Holon concept as a Basic Unit System that remains itself in spite of complex operations such as…
This work is meant to be a step towards the formal definition of the notion of algorithm, in the sense of an equivalence class of programs working "in a similar way". But instead of defining equivalence transformations directly on programs,…