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

Theories of classification distinguish classes with some good structure theorem from those for which none is possible. Some classes (dense linear orders, for instance) are non-classifiable in general, but are classifiable when we consider…

We determine the L^2-Betti numbers of all one-relator groups and all surface-plus-one-relation groups (surface-plus-one-relation groups were introduced by Hempel who called them one-relator surface groups). In particular we show that for…

Although the Turing-machine model of computation is widely used in computer science it is fundamentally inadequate as a foundation for the theory of modern scientific computation. The real-number model is described as an alternative.…

The total Betti numbers of the toric ideal of a simple graph are, in general, highly sensitive to any small change of the graph. In this paper we look at some combinatorial operations that cause total Betti numbers to change in predictable…

We investigate computability in the lattice of equivalence relations on the natural numbers. We mostly investigate whether the subsets of appropriately defined subrecursive equivalence relations -for example the set of all polynomial-time…

We investigate resolutions of letterplace ideals of posets. We develop topological results to compute their multigraded Betti numbers, and to give structural results on these Betti numbers. If the poset is a union of no more than $c$…

Let $A$ be an abelian variety defined over a number field $K$. For a finite extension $L/K$, the cardinality of the group $A(L)_{\operatorname{tors}}$ of torsion points in $A(L)$ can be bounded in terms of the degree $[L:K]$. We study the…

We begin the systematic study of decision problems for finitely generated groups given by a solution to their word problem. We relate this to the study of computable analysis on the space of marked groups. We point out that several distinct…

Let X be a building of uniform thickness q+1. L^2-Betti numbers of X are reinterpreted as von-Neumann dimensions of weighted L^2-cohomology of the underlying Coxeter group. The dimension is measured with the help of the Hecke algebra. The…

In this paper we study higher Deligne--Lusztig representations of reductive groups over finite quotients of discrete valuation rings. At even levels, we show that these geometrically constructed representations coincide with certain induced…

Ordering theorems, characterizing when partial orders of a group extend to total orders, are used to generate hypersequent calculi for varieties of lattice-ordered groups (l-groups). These calculi are then used to provide new proofs of…

Every finite dimensional real representation of a compact real semisimple Lie algebra determines a metric 2-step nilpotent Lie algebra and a corresponding simply connected metric 2-step nilpotent Lie group N. We study the differential…

The present paper is a note on the tensor degree of finite groups, introduced recently in literature. This numerical invariant generalizes the commutativity degree through the notion of nonabelian tensor square. We show two inequalities,…

We approach the Torelli problem of recostructing a curve from its Jacobian from a computational point of view. Following Dubrovin, we design a machinery to solve this problem effectively, which builds on methods in numerical algebraic…

When $p$ is a computable real so that $p \geq 1$, the isometry degree of a computable copy $\mathcal{B}$ of $\ell^p$ is defined to be the least powerful Turing degree that computes a linear isometry of $\ell^p$ onto $\mathcal{B}$. We show…

Computability theory is a discipline in the intersection of computer science and mathematical logic where the fundamental question is: given two mathematical objects X and Y, does X compute Y in principle? In case X and Y are real numbers,…

We asymptotically estimate from above the expected Betti numbers of random real hypersurfaces in smooth real projective manifolds. Our upper bounds grow as the square root of the degree of the hypersurfaces as the latter grows to infinity,…

We present an exposition of our ongoing project in a new area of applicable mathematics: practical computation with finitely generated linear groups over infinite fields. Methodology and algorithms available for practical computation in…

We study connections between classical asymptotic density and c.e. sets. We prove that a c.e. Turing degree d is not low if and only if d contains a c.e. set A of density 1 which has no computable subsets of density 1, giving a natural…

We prove that twisted $\ell^2$-Betti numbers of locally indicable groups are equal to the usual $\ell^2$-Betti numbers rescaled by the dimension of the twisting representation; this answers a question of L\"uck for this class of groups. It…