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

We are studying the degrees in which a computable structure is relatively computably categoricity, i.e., computably categorcial among all non-computable copies of the structure. Unlike the degrees of computable categoricity we can bound the…

For any numerical semigroup $S$, there are infinitely many numerical symmetric semigroups $T$ such that $S=\frac{T}{2}$ is their half. We are studying the Betti numbers of the numerical semigroup ring $K[T]$ when $S$ is a 3-generated…

A major part of computability theory focuses on the analysis of a few structures of central importance. As a tool, the method of coding with first-order formulas has been applied with great success. For instance, in the c.e. Turing degrees,…

This article presents a method for proving upper bounds for the first $\ell^2$-Betti number of groups using only the geometry of the Cayley graph. As an application we prove that Burnside groups of large prime exponent have vanishing first…

We study systematically groups whose marked finite quotients form a recursive set. We give several definitions, and prove basic properties of this class of groups, and in particular emphasize the link between the growth of the depth…

We show that the degree of a graded lattice ideal of dimension 1 is the order of the torsion subgroup of the quotient group of the lattice. This gives an efficient method to compute the degree of this type of lattice ideals.

In this paper, we prove that the $L^2$ Betti numbers of an amenable covering space can be approximated by the average Betti numbers of a regular exhaustion, proving a conjecture that we made in an earlier paper. We also prove that an…

We define the notion of L^2 homology and L^2 Betti numbers for a tracial von Neumann algebra, or, more generally, for any involutive algebra with a trace. The definition of these invariants is obtained from the definition of L^2 homology…

In this paper we are interested in computability aspects of subshifts and in particular Turing degrees of 2-dimensional SFTs (i.e. tilings). To be more precise, we prove that given any \pizu subset $P$ of $\{0,1\}^\NN$ there is a SFT $X$…

We provide upper bounds for logarithmic torsion homology growth and Betti number growth of groups, phrased in the language of measured group theory.

We first describe a situation in which every graded Betti number in the tail of the resolution of $\frac RJ$ may be read from the socle degrees of $\frac RJ$. Then we apply the above result to the ideals $J$ and $J^{[q]}$; and thereby…

The TTE computability notion in effective metric spaces is usually defined by using Cauchy representations. Under some weak assumptions, we characterize this notion in a way which avoids using the representations.

We give explicit formulas for the Betti numbers, both stable and unstable, of the unordered configuration spaces of an arbitrary surface of finite type.

The TTE approach to Computable Analysis is the study of so-called representations (encodings for continuous objects such as reals, functions, and sets) with respect to the notions of computability they induce. A rich variety of such…

The Betti numbers are fundamental topological quantities that describe the k-dimensional connectivity of an object: B_0 is the number of connected components and B_k effectively counts the number of k-dimensional holes. Although they are…

We examine the convergence properties of sequences of nonnegative real numbers that satisfy a particular class of recursive inequalities, from the perspective of proof theory and computability theory. We first establish a number of results…

We reconsider work of Elkalla on subnormal subgroups of 3-manifold groups, giving essentially algebraic arguments that extend to the case of $PD_3$-groups and group pairs. However the argument relies on an $L^2$-Betti number hypothesis…

We define for arbitrary modules over a finite von Neumann algebra $\cala$ a dimension taking values in $[0,\infty]$ which extends the classical notion of von Neumann dimension for finitely generated projective $\cala$-modules and inherits…

A computable structure A is x-computably categorical for some Turing degree x, if for every computable structure B isomorphic to A there is an isomorphism f:B -> A with f computable in x. A degree x is a degree of categoricity if there is a…

We present a new method to construct finitely generated, residually finite, infinite torsion groups. In contrast to known constructions, a profinite perspective enables us to control finite quotients and normal subgroups of these torsion…