English
Related papers

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

200 papers

We investigate the set of partial partitions of a finite set, ordered by inclusion. With this ordering the set of partial partitions can be studied as an abstract simplicial complex. We use the theory of shellable nonpure complexes to find…

Combinatorics · Mathematics 2023-11-21 Michael J. Gottstein

We address the problem of the maximal finite number of real points of a real algebraic curve (of a given degree and, sometimes, genus) in the projective plane. We improve the known upper and lower bounds and construct close to optimal…

Algebraic Geometry · Mathematics 2019-09-13 Erwan Brugallé , Alex Degtyarev , Ilia Itenberg , Frédéric Mangolte

Turing computability is the standard computability paradigm which captures the computational power of digital computers. To understand whether one can create physically realistic devices which have super-Turing power, one needs to…

Logic · Mathematics 2021-10-01 Daniel S. Graça , Ning Zhong

We establish a connection between Dixmier's unitarisability problem and the expected degree of random forests on a group. As a consequence, a residually finite group is non-unitarisable if its first L2-Betti number is non-zero or if it is…

Group Theory · Mathematics 2010-01-20 Inessa Epstein , Nicolas Monod

Let $G$ be a residually poly-$\mathbb Z$ group of finite type. We prove that $G$ admits a poly-$\mathbb Z$ quotient with kernel $N$ satisfying $\mathrm{cd}_{\mathbb Q}(N) < \mathbb{cd}_{\mathbb Q}(G)$ if and only if the top-dimensional…

Group Theory · Mathematics 2026-01-27 Sam P. Fisher , Pablo Sánchez-Peralta

We give a formula to compute all the top degree graded Betti numbers of the path ideal of a cycle. Also we will find a criterion to determine when Betti numbers of this ideal are non zero and give a formula to compute its projective…

Commutative Algebra · Mathematics 2013-05-09 Ali Alilooee , Sara Faridi

Traditional computers work with finite numbers. Situations where the usage of infinite or infinitesimal quantities is required are studied mainly theoretically. In this paper, a recently introduced computational methodology (that is not…

Numerical Analysis · Mathematics 2012-03-15 Yaroslav D. Sergeyev

It has long been known that to a complex cubic surface or threefold one can canonically associate a principally polarized abelian variety. We give a construction which works for cubics over an arithmetic base. This answers, away from the…

Algebraic Geometry · Mathematics 2020-02-27 Jeff Achter

The ideals generated by fold products of linear forms are generalizations of powers of defining ideals of star configurations, or of Veronese type ideals, and in this paper we study their Betti numbers. In earlier work, the authors together…

Commutative Algebra · Mathematics 2025-07-11 Ricardo Burity , Stefan Tohaneanu

We consider metric versions of the notions of local embeddability and LEF. We pay special attention to normally finitely generated groups with word metrics.

Group Theory · Mathematics 2023-11-29 Aleksander Ivanov , Ireneusz Sobstyl

We determine (multi)graded Betti numbers of path ideals of lines and star graphs.

Commutative Algebra · Mathematics 2014-10-31 Nursel Erey

It is well known that the rational torsion of an abelian variety defined over a number field injects into the reduction modulo any sufficiently large prime, so the order of the torsion group divides the greatest common divisor of the sizes…

Number Theory · Mathematics 2026-04-29 Jessica Alessandrì , Nirvana Coppola

We provide a proof that the vanishing of $\ell^2$-Betti numbers of unimodular locally compact second countable groups is an invariant of coarse equivalence.

Algebraic Topology · Mathematics 2018-11-07 Roman Sauer , Michael Schrödl

We investigate the logarithmic bundles associated to arrangements of hypersurfaces with a fixed degree in a smooth projective variety. We then specialize to the case when the variety is a quadric hypersurface and a multiprojective space to…

Algebraic Geometry · Mathematics 2013-12-10 Edoardo Ballico , Sukmoon Huh , Francesco Malaspina

We present an extension to the $\mathtt{mathlib}$ library of the Lean theorem prover formalizing the foundations of computability theory. We use primitive recursive functions and partial recursive functions as the main objects of study, and…

Logic in Computer Science · Computer Science 2019-07-19 Mario Carneiro

Suppose X is any finite complex with vanishing L^2 Betti number. We prove upper bounds on the Betti numbers for regular coverings of X, sublinear in the order of covering. The bounds are sensitive to the Novikov-Shubin invariants of X, and…

Geometric Topology · Mathematics 2007-05-23 Bryan Clair , Kevin Whyte

Using a method of F\'elix and Thomas we compute the Betti numbers of unordered configuration spaces of the torus.

Algebraic Topology · Mathematics 2016-06-24 Christoph Schiessl

Quantum theory (QT) has been confirmed by numerous experiments, yet we still cannot fully grasp the meaning of the theory. As a consequence, the quantum world appears to us paradoxical. Here we shed new light on QT by being based on two…

Quantum Physics · Physics 2019-05-21 Alessio Benavoli , Alessandro Facchini , Marco Zaffalon

We recall from previous work a model-independent framework of computational complexity theory. Notably for the present paper, the framework allows formalization of the issues of precision that present themselves when one considers physical,…

Computational Complexity · Computer Science 2014-04-02 Ed Blakey

We study the sets that are computable from both halves of some (Martin-L\"of) random sequence, which we call \emph{$1/2$-bases}. We show that the collection of such sets forms an ideal in the Turing degrees that is generated by its c.e.\…

Logic · Mathematics 2020-05-14 Noam Greenberg , Joseph S. Miller , Andre Nies