English
Related papers

Related papers: Amenability and computability

200 papers

We propose a rigorous decomposition of predictive error, highlighting that not all 'irreducible' error is genuinely immutable. Many domains stand to benefit from iterative enhancements in measurement, construct validity, and modeling. Our…

Machine Learning · Computer Science 2025-02-12 Jiani Yan , Charles Rahal

This paper aims at developing model-theoretic tools to study interpretable fields and definably amenable groups, mainly in $\mathrm{NIP}$ or $\mathrm{NTP_2}$ settings. An abstract theorem constructing definable group homomorphisms from…

Logic · Mathematics 2025-01-07 Paul Z. Wang

We generalize Luck's Theorem to show that the L^2-Betti numbers of a residually amenable covering space are the limit of the L^2-Betti numbers of a sequence of amenable covering spaces. We show that any residually amenable covering space of…

dg-ga · Mathematics 2007-05-23 Bryan Clair

Solomonoff unified Occam's razor and Epicurus' principle of multiple explanations to one elegant, formal, universal theory of inductive inference, which initiated the field of algorithmic information theory. His central result is that the…

Machine Learning · Computer Science 2008-06-26 Marcus Hutter

Let G be an infinite discrete countable amenable group acting continuously on a Lebesgue space X. In this article, using partition and factor-space, the conditional entropy of the action G is defined. We introduction some properties of…

Dynamical Systems · Mathematics 2025-05-06 Yuan Lian , Bin Zhu

Let $K$ be a locally compact field of characteristic 0. Let $G$ be a linear algebraic group defined over $K$, acting algebraically on an algebraic variety $V$. We prove that the action of $G(K)$ (the group of $K$-rational points of $G$) on…

Dynamical Systems · Mathematics 2024-05-13 Alain J. Valette

We introduce a notion of algorithmic randomness for algebraic fields. We prove the existence of a continuum of algebraic extensions of $\mathbb{Q}$ that are random according to our definition. We show that there are noncomputable algebraic…

Logic · Mathematics 2024-07-08 Wesley Calvert , Valentina Harizanov , Alexandra Shlapentokh

Humans spend a significant part of their lives being a part of groups. In this document we propose research directions that would make it possible to computationally form productive groups. We bring to light several issues that need to be…

Computers and Society · Computer Science 2021-04-27 Nripsuta Saxena

We consider an action of a countable amenable group on a compact metric space, focusing on the set of generic points with respect to a fixed F{\o}lner sequence. For a given characteristic class, we prove that the set of points that are…

Dynamical Systems · Mathematics 2025-10-31 Sejal Babel , Martha Łącka , Marcel Mroczek

Assuming the obvious definitions (see paper) we show the a decidable model that is effectively prime is also effectively atomic. This implies that two effectively prime (decidable) models are computably isomorphic. This is in contrast to…

Logic · Mathematics 2017-01-31 Peter Cholak , Charlie McCoy

We introduce a notion of computable randomness for infinite sequences that generalises the classical version in two important ways. First, our definition of computable randomness is associated with imprecise probability models, in the sense…

Probability · Mathematics 2020-09-23 Floris Persiau , Jasper De Bock , Gert de Cooman

We prove some technical results on definable types in $p$-adically closed fields, with consequences for definable groups and definable topological spaces. First, the code of a definable $n$-type (in the field sort) can be taken to be a real…

Logic · Mathematics 2024-07-18 Pablo Andujar Guerrero , Will Johnson

We describe elementary examples of finitely presented sofic groups which are not residually amenable (and thus not initially subamenable or LEA, for short). We ask if an amalgam of two amenable groups over a finite subgroup is residually…

Group Theory · Mathematics 2015-09-03 Aditi Kar , Nikolay Nikolov

For a discrete group $G$, we consider certain ideals $\mathcal{I}\subset c_0(G)$ of sequences with prescribed rate of convergence to zero. We show that the equality between the full group C$^\ast$-algebra of $G$ and the C$^\ast$-completion…

Functional Analysis · Mathematics 2024-03-12 Tomasz Kochanek

Symbolic dynamical theory plays an important role in the research of amenability with a countable group. Motivated by the deep results of Dougall and Sharp, we study the group extensions for topologically mixing random shifts of finite…

Dynamical Systems · Mathematics 2024-03-21 Kexiang Yang , Ercai Chen , Zijie Lin , Xiaoyao Zhou

It is proved that a discrete group G is exact if and only if its left translation action on the Stone-Cech compactification is amenable. Combining this with an unpublished result of Gromov, we have the existence of non exact discrete…

Operator Algebras · Mathematics 2009-10-31 Narutaka Ozawa

We investigate (2,1):1 structures, which consist of a countable set $A$ together with a function $f: A \to A$ such that for every element $x$ in $A$, $f$ maps either exactly one element or exactly two elements of $A$ to $x$. These…

Logic · Mathematics 2017-01-06 Hakim J. Walker

We prove that every amenable group of cohomological dimension two whose integral group ring is a domain is solvable and investigate certain homological finiteness properties of groups that satisfy the analytic zero divisor conjecture and…

Group Theory · Mathematics 2016-09-27 Dieter Degrijse

We prove that amenability of a discrete group is equivalent to dimension flatness of certain ring inclusions naturally associated with measure preserving actions of the group. This provides a group-measure space theoretic solution to a…

Group Theory · Mathematics 2013-05-16 David Kyed , Henrik Densing Petersen

We propose a simple abstract version of Calderon--Zygmund theory, which is applicable to spaces with exponential volume growth, and then show that amenable Lie groups can be treated within this framework.

Functional Analysis · Mathematics 2018-10-09 Waldemar Hebisch