Related papers: $L^2$-Betti numbers and computability of reals

We study the enumeration of set partitions, according to their length, number of parts, cyclic type, and genus. We introduce genus-dependent Bell, Stirling numbers, and Fa\`a di Bruno coefficients. Besides attempting to summarize what is…

Computability theory is used to evaluate the complexity of classifying various kinds of Lebesgue spaces and associated isometric isomorphism problems.

We study L^2-Betti numbers for von Neumann algebras, as defined by D. Shlyakhtenko and A. Connes, in the presence of a bi-finite correspondence and prove a proportionality formula.

In this paper we study some algebraic properties of hypergraphs, in particula their Betti numbers. We define some different types of complete hypergraphs, which to the best of our knowledge, are not previously considered in the literature.…

We calculate explicitly the Betti numbers of a class of barely G2 manifolds - that is, G2 manifolds that are realised as a product of a Calabi-Yau manifold and a circle, modulo an involution. The particular class which we consider are those…

The absolute Galois group Gal$(\overline{\mathbb{Q}}/\mathbb{Q})$ of the field $\mathbb{Q}$ of rational numbers can be presented as a highly computable object, under the notion of type-2 Turing computation. We formalize such a presentation…

In [DJL07] it was shown that if A is an affine hyperplane arrangement in C^n, then at most one of the L^2-Betti numbers of its complement is non--zero. We will prove an analogous statement for complements of any algebraic curve in C^2.…

Computational problems are classified into computable and uncomputable problems. If there exists an effective procedure (algorithm) to compute a problem then the problem is computable otherwise it is uncomputable. Turing machines can…

We initiate the study of the $L^2$-Betti numbers of group-theoretic Dehn fillings. For a broad class of virtually special groups $G$, we prove that the $L^2$-Betti numbers of sufficiently deep Dehn fillings $\overline{G}$ are equal to those…

We describe and analyze a numerical algorithm for computing the homology (Betti numbers and torsion coefficients) of semialgebraic sets given by Boolean formulas. The algorithm works in weak exponential time. This means that outside a…

We study partitions of complex numbers as sums of non-negative powers of a fixed algebraic number $\beta$. We prove that if $\beta$ is real quadratic, then the number of partitions is always finite if and only if some conjugate of $\beta$…

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…

We study the complexity of deterministic and probabilistic inversions of partial computable functions on the reals.

We compute the Betti numbers of the geometric spaces associated to nonrational simple convex polytopes and find that they depend on the combinatorial type of the polytope exactly as in the rational case. This shows that the combinatorial…

We give a detailed treatment of the ``bit-model'' of computability and complexity of real functions and subsets of R^n, and argue that this is a good way to formalize many problems of scientific computation. In the introduction we also…

We describe and analyze an algorithm for computing the homology (Betti numbers and torsion coefficients) of basic semialgebraic sets which works in weak exponential time. That is, out of a set of exponentially small measure in the space of…

We apply a construction developed in a previous paper by the authors in order to obtain a formula which enables us to compute $\ell^2$-Betti numbers coming from a family of group algebras representable as crossed product algebras. As an…

We study how well a real number can be approximated by sums of two or more rational numbers with denominators up to a certain size.

Let $S$ be a polynomial ring in $n$ variables over a field $K$ of characteristic $0$. A numerical characterization of all possible extremal Betti numbers of any graded submodule of a finitely generated graded free $S$-module is given.

We define the notion of ordinal computability by generalizing standard Turing computability on tapes of length $\omega$ to computations on tapes of arbitrary ordinal length. We show that a set of ordinals is ordinal computable from a finite…