Related papers: Computing the exponent of a Lebesgue space

We provide a detailed study of two properties of spaces and pairs of spaces, the surjection property and the epsilon-surjection property, that were recently introduced to characterize the notion of computable type arising from computability…

We characterize the points that satisfy Birkhoff's ergodic theorem under certain computability conditions in terms of algorithmic randomness. First, we use the method of cutting and stacking to show that if an element x of the Cantor space…

We prove fractional Leibniz rules and related commutator estimates in the settings of weighted and variable Lebesgue spaces. Our main tools are uniform weighted estimates for sequences of square-function-type operators and a bilinear…

The Lebesgue property (order-continuity) of a monotone convex function on a solid vector space of measurable functions is characterized in terms of (1) the weak inf-compactness of the conjugate function on the order-continuous dual space,…

We prove a computable version of de Finetti's theorem on exchangeable sequences of real random variables. As a consequence, exchangeable stochastic processes expressed in probabilistic functional programming languages can be automatically…

Let $k$ be an algebraically closed field and let $b$ and $n$ be integers with $n\geq 3$ and $1\leq b \leq n-1.$ Consider the moduli space $X$ of hypersurfaces in $\mathbb{P}^n_k$ of fixed degree $l$ whose singular locus is at least…

We show that the common theory of all modules over a tubular algebra (over a recursive algebraically closed field) is decidable. This result supports a long standing conjecture of Mike Prest which says that a finite-dimensional algebra…

We initiate the effective metric structure theory of Keisler randomizations. We show that a classical countable structure $\mathcal{M}$ has a decidable presentation if and only if its Borel randomization $\mathcal{M}^{[0,1)}$ has a…

In this note, we consider a class of composition operators on Lebesgue spaces with variable exponents over metric measure spaces. Taking advantage of the compatibility between the metric-measurable structure and the regularity properties of…

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 consider the question of which nonconvex sets can be represented exactly as the feasible sets of mixed-integer convex optimization problems. We state the first complete characterization for the case when the number of possible integer…

In this work we study the space complexity of computable real numbers represented by fast convergent Cauchy sequences. We show the existence of families of trascendental numbers which are logspace computable, as opposed to algebraic…

This article is a fundamental study in computable measure theory. We use the framework of TTE, the representation approach, where computability on an abstract set X is defined by representing its elements with concrete "names", possibly…

A now classical result in the theory of variable Lebesgue spaces due to Lerner [A. K. Lerner, On modular inequalities in variable $L^p$ spaces, Archiv der Math. 85 (2005), no. 6, 538-543] is that a modular inequality for the…

In the paper two-weighted norm estimates with general weights for Hardy-type transforms, maximal functions, potentials and Calder\'on-Zygmund singular integrals in variable exponent Lebesgue spaces defined on quasimetric measure spaces $(X,…

Let n be a positive integer, and let R be a finitely presented (but not necessarily finite dimensional) associative algebra over a computable field. We examine algorithmic tests for deciding (1) if every n-dimensional representation of R is…

A basic concept of Type Two Theory of Effectivity (TTE) is the notion of an admissibly represented space. Admissibly represented spaces are closely related to qcb-spaces. The latter form a well-behaved subclass of topological spaces. We…

A set is introreducible if it can be computed by every infinite subset of itself. Such a set can be thought of as coding information very robustly. We investigate introreducible sets and related notions. Our two main results are that the…

We consider divergence form uniformly parabolic SPDEs with bounded and measurable leading coefficients and possibly growing lower-order coefficients in the deterministic part of the equations. We look for solutions which are summable to the…

The representation of any integer as the sum of two cubes to a fixed modulus is always possible if and only if the modulus is not divisible by seven or nine. For a positive non-prime integer N there is given an inductive way to find its…