Let D be the unit disk. We show that for some relatively closed set F ⊂ D there is a function f that can be uniformly approximated on F by functions of H∞, but such that f cannot be written as f = h + g, with h ∈ H∞ and g ...

In this work, we study two simple yet general complexity classes, based on logspace Turing machines, which provide a unifying framework for efficient query evaluation in areas like information extraction and graph databases, ...

Given an Ap-Muckenhoupt weight on a fractal obtained as the attractor of an iterated function system, we construct a sequence of approximating weights, which are simple functions belonging uniformly to the Ap class on the ...

In this work, we study two simple yet general complexity classes, based on logspace Turing machines, that provide a unifying framework for efficient query evaluation in areas such as information extraction and graph ...