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

Computability on uncountable sets has no standard formalization, unlike that on countable sets, which is given by Turing machines. Some of the approaches to define computability in these sets rely on order-theoretic structures to translate…

We introduce the notion of metric Lie algebras of Killing type, which are characterized by the fact that all conformal Killing symmetric tensors are sums of Killing tensors and multiples of the metric tensor. We show that if a Lie algebra…

In the first half of this paper, we study the way that sets of real numbers closed under Turing equivalence sit inside the real line from the perspective of algebra, measure and order. Afterwards, we combine the results from our study of…

We study L^2-Betti numbers for von Neumann algebras, as defined by D. Shlyakhtenko and A. Connes. We give a definition of L^2-cohomology and show how the study of the first L^2-Betti number can be related with the study of derivations with…

We show an invariance result for the L2-torsion of groups under uniform measure equivalence provided a measure-theoretic version of the determinant conjecture holds. The measure-theoretic determinant conjecture is discussed and, for…

We introduce and study a `level two' generalization of the poly-Bernoulli numbers, which may also be regarded as a generalization of the cosecant numbers. We prove a recurrence relation, two exact formulas, and a duality relation for…

We prove that the Betti numbers of simplicial complexes of bounded vertex degrees are testable in constant time.

Let G be a finitely presented group, and let p be a prime. Then G is 'large' (respectively, 'p-large') if some normal subgroup with finite index (respectively, index a power of p) admits a non-abelian free quotient. This paper provides a…

We count the number of isomorphism classes of degree $d$-twists of some polarized abelian varieties over finite fields of odd prime dimension. This can be seen as a higher dimensional analogue of the counting problem for elliptic curves…

In this article, we investigate the arithmetical hierarchy from the perspective of realizability theory. An experimental observation in classical computability theory is that the notion of degrees of unsolvability for natural arithmetical…

We study the decomposition of real numbers into sums of L\"uroth sets, which are defined by numbers whose L\"uroth expansions have prescribed digit constraints. We establish several results on the congruence modulo 1 of sums of L\"uroth…

We discuss several arithmetic aspects of Bianchi groups, especially from a computational point of view. In particular, we consider computing the homology of Bianchi groups together with the Hecke action, connections with automorphic forms,…

In this paper, we study two topics. One is the divisibility problem of class groups of quadratic number fields and its connections to algebraic geometry. The other is the construction of Selmer group and Tate-Shafarevich group for an…

The Turing degree spectrum of a countable structure $\mathcal{A}$ is the set of all Turing degrees of isomorphic copies of $\mathcal{A}$. The Turing degree of the isomorphism type of $\mathcal{A}$, if it exists, is the least Turing degree…

We study generalizations of Demuth's Theorem, which states that the image of a Martin-L\"of random real under a tt-reduction is either computable or Turing equivalent to a Martin-L\"of random real. We show that Demuth's Theorem holds for…

Recently the so-called Atiyah conjecture about l^2-Betti numbers has been disproved. The counterexamples were found using a specific method of computing the spectral measure of a matrix over a complex group ring. We show that in many…

Given a set of points in P^2, we consider the common zeros of the set of curves of a given degree passing through those points. For general sets of points, these zero sets have the expected dimension and are smooth. In fact, given graded…

In this article, we introduce a notion of reducibility for partial functions on the natural numbers, which we call subTuring reducibility. One important aspect is that the subTuring degrees correspond to the structure of the realizability…

We describe the basic theory of infinite time Turing machines and some recent developments, including the infinite time degree theory, infinite time complexity theory, and infinite time computable model theory. We focus particularly on the…

The unipotent groups are an important class of algebraic groups. We show that techniques used to compute with finitely generated nilpotent groups carry over to unipotent groups. We concentrate particularly on the maximal unipotent subgroup…