Related papers: $L^2$-Betti numbers and computability of reals
A set $X \subseteq 2^\omega$ with positive measure contains a perfect subset. We study such perfect subsets from the viewpoint of computability and prove that these sets can have weak computational strength. Then we connect the existence of…
Let A be an abelian variety defined over a number field K, the number of torsion points rational over a finite extension L is bounded polynomially in terms of the degree [L : K]. When A is isogenous to a product of simple abelian varieties…
On the real numbers, the notions of a semi-decidable relation and that of an effectively enumerable relation differ. The second only seems to be adequate to express, in an algorithmic way, non deterministic physical theories, where…
We study relative precompleteness in the context of the theory of numberings, and relate this to a notion of lowness. We introduce a notion of divisibility for numberings, and use it to show that for the class of divisible numberings,…
We consider the question as to whether the exponent of a computably presentable Lebesgue space whose dimension is at least 2 must be computable. We show this very natural conjecture is true when the exponent is at least 2 or when the space…
We consider the computational problem of determining the unit group of a finite ring, by which we mean the computation of a finite presentation together with an algorithm to express units as words in the generators. We show that the problem…
Let $X\rightarrow C$ be a totally real semistable degeneration over a smooth real curve $C$ with degenerate fiber $X_0$. Assuming that the irreducible components of $X_0$ are simple from a cohomological point of view, we give a bound for…
We give some explicit bounds for the number of cobordism classes of real algebraic manifolds of real degree less than $d$, and for the size of the sum of $\mod 2$ Betti numbers for the real form of complex manifolds of complex degree less…
We show that for a countable exact group, having positive first $\ell^2$-Betti number implies proper proximality in this sense of \cite{BoIoPe21}. This is achieved by showing a cocycle superrigidty result for Bernoulli shifts of…
We compute the graded Betti numbers for the toric ideal of a family of graphs constructed by adjoining a cycle to a complete bipartite graph. The key observation is that this family admits an initial ideal which has linear quotients. As a…
The multiplicative theory of a set of numbers (which could be natural, integer, rational, real or complex numbers) is the first-order theory of the structure of that set with (solely) the multiplication operation (that set is taken to be…
We use stratified Morse theory for a manifold with corners to give a new bound for the sum of the Betti numbers of a hypersurface in R^n_> defined by a polynomial with n+l+1 terms.
We define a notion of an arithmetic set in an arbitrary countable group and study properties of these sets in the cases of Abelian groups and non-abelian free groups.
The notion of Frobenius Betti numbers generalizes the Hilbert-Kunz multiplicity theory and serves as an invariant that measures singularity. However, the explicit computation of the Frobenius Betti numbers of rings has been limited to very…
Associated to a Coxeter system $(W,S)$ there is a contractible simplicial complex $\Sigma$ called the Davis complex on which $W$ acts properly and cocompactly by reflections. Given a positive real multiparameter $\mathbf{q}$, one can define…
The coarse similarity class $[A]$ of $A$ is the set of all $B$ whose symmetric difference with $A$ has asymptotic density 0. There is a natural metric $\delta$ on the space $\mathcal{S}$ of coarse similarity classes defined by letting…
We discuss computability and computational complexity of conformal mappings and their boundary extensions. As applications, we review the state of the art regarding computability and complexity of Julia sets, their invariant measures and…
It is well known that the R, the set of real numbers, is an abstract set, where almost all its elements cannot be described in any finite language. We investigate possible approaches to what might be called an epi-constructionist approach…
The notion of computability is stable (i.e. independent of the choice of an indexing) over infinite-dimensional vector spaces provided they have a finite "tensorial dimension". Such vector spaces with a finite tensorial dimension permit to…
We discuss various universality aspects of numerical computations using standard algorithms. These aspects include empirical observations and rigorous results. We also make various speculations about computation in a broader sense.