Related papers: Complexity theory for spaces of integrable functio…
A central topic in mathematical logic is the classification of theorems from mathematics in hierarchies according to their logical strength. Ideally, the place of a theorem in a hierarchy does not depend on the representation (aka coding)…
Represented spaces form the general setting for the study of computability derived from Turing machines. As such, they are the basic entities for endeavors such as computable analysis or computable measure theory. The theory of represented…
We study function spaces that are related to square-integrable, irreducible, unitary representations of several low-dimensional nilpotent Lie groups. These are new examples of coorbit theory and yield new families of function spaces on…
We investigate different notions of "computable topological base" for represented spaces. We show that several non-equivalent notions of bases become equivalent when we consider computably enumerable bases. This indicates the existence of a…
We reconsider some classical natural semantics of integers (namely iterators of functions, cardinals of sets, index of equivalence relations), in the perspective of Kolmogorov complexity. To each such semantics one can attach a simple…
We study integration and $L_2$-approximation on countable tensor products of function spaces of increasing smoothness. We obtain upper and lower bounds for the minimal errors, which are sharp in many cases including, e.g., Korobov, Walsh,…
We prove an intrinsic Taylor-like formula for a class of Lie groups arising in the study of some sub-elliptic differential operators, namely the Kolmogorov operators. The estimate of the remainder is in terms of the intrinsic norm induced…
We exhibit a sound and complete implicit-complexity formalism for functions feasibly computable by structural recursions over inductively defined data structures. Feasibly computable here means that the structural-recursive definition runs…
Kolmogorov Complexity constitutes an integral part of computability theory, information theory, and computational complexity theory -- in the discrete setting of bits and Turing machines. Over real numbers, on the other hand, the…
For fixed compact connected Lie groups H \subseteq G, we provide a polynomial time algorithm to compute the multiplicity of a given irreducible representation of H in the restriction of an irreducible representation of G. Our algorithm is…
We present a general method for introducing finitely axiomatizable "minimal" two-sorted theories for various subclasses of P (problems solvable in polynomial time). The two sorts are natural numbers and finite sets of natural numbers. The…
The main purpose of this article is to provide a common generalization of the notions of a topological and Kolmogorov-Sinai entropy for arbitrary representations of discrete amenable groups on objects of (abstract) categories. This is…
We study connections between the ring of symmetric functions and the characters of irreducible finite-dimensional representations of quantum affine algebras. We study two families of representations of the symplectic and orthogonal Lie…
The incompressibility method is a counting argument in the framework of algorithmic complexity that permits discovering properties that are satisfied by most objects of a class. This paper gives a preliminary insight into Kolmogorov's…
We establish a number of results which say, roughly, that interpretation functors preserve algebraic complexity. First we show that representation embeddings between categories of modules of finite-dimensional algebras induce embeddings of…
We comment on recent results in the field of information based complexity, which state (in a number of different settings), that approximation of infinitely differentiable functions is intractable and suffers from the curse of…
In a number of papers, Y. Sternfeld investigated the problems of representation of continuous and bounded functions by linear superpositions. In particular, he proved that if such representation holds for continuous functions, then it holds…
The equivariant Kazhdan-Lusztig polynomial of a braid matroid may be interpreted as the intersection cohomology of a certain partial compactification of the configuration space of n distinct labeled points in the plane, regarded as a graded…
We establish a correspondence between polynomial representations of the Temperley and Lieb algebra and certain deformations of the Quantum Hall Effect wave functions. When the deformation parameter is a third root of unity, the…
Solovay proved that there exists a computable upper bound f of the prefix-free Kolmogorov complexity function K such that f (x) = K(x) for infinitely many x. In this paper, we consider the class of computable functions f such that K(x) <= f…