English
Related papers

Related papers: Polish group actions and computability

200 papers

We show that locally solvable subgroups of PLo(I) are countable. Then for each countable ordered set, we construct a locally solvable subgroup of Thompson's Group F. We develop machinery for understanding embeddings from solvable subgroups…

Group Theory · Mathematics 2018-05-23 Amanda Taylor

We prove that every clone of operations on a finite set A, if it contains a Malcev operation, is finitely related -- i.e., identical with the clone of all operations respecting R for some finitary relation R over A. It follows that for a…

Rings and Algebras · Mathematics 2011-05-31 Erhard Aichinger , Peter Mayr , Ralph McKenzie

For any class of operators which transform unary total functions in the set of natural numbers into functions of the same kind, we define what it means for a real function to be uniformly computable or conditionally computable with respect…

Logic · Mathematics 2013-10-23 Ivan Georgiev , Dimiter Skordev

We show that every essentially countable orbit equivalence relation induced by a continuous action of a Polish group on a Polish space is $\sigma$-lacunary. In combination with [Invent. Math.201 (1), 309-383, 2015] we obtain a…

Logic · Mathematics 2020-07-21 Jan Grebik

Let $\Aut(G)$ denote the group of (bi-)continuous automorphisms %and $\Out(G)$ the outer automorphism group of a non-Archimedean Polish group~$G$. We show that for any such $G$ with an invariant countable basis of open subgroups, the group…

Logic · Mathematics 2025-12-16 Andre Nies , Philipp Schlicht

Guralnick, Kunyavskii, Plotkin and Shalev have shown that the solvable radical of a finite group $G$ can be characterized as the set of all $x\in G$ such that $<x,y>$ is solvable for all $y\in G$. We prove two generalizations of this…

Group Theory · Mathematics 2013-02-25 Simon Guest , Dan Levy

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

We define a class of functions termed "Computable in the Limit", based on the Machine Learning paradigm of "Identification in the Limit". A function is Computable in the Limit if it defines a property P_p of a recursively enumerable class A…

Computational Complexity · Computer Science 2017-02-21 Antony Van der Mude

We investigate conditions under which a co-computably enumerable closed set in a computable metric space is computable and prove that in each locally computable computable metric space each co-computably enumerable compact manifold with…

Logic in Computer Science · Computer Science 2015-07-01 Zvonko Iljazovic

We make further observations on the features of Galois cohomology in the general model theoretic context. We make explicit the connection between forms of definable groups and first cohomology sets with coefficients in a suitable…

Logic · Mathematics 2021-05-28 Omar Leon Sanchez , David Meretzky , Anand Pillay

Let $M=I$ or $M=\mathbb{S}^1$ and let $k\geq 1$. We exhibit a new infinite class of Polish groups by showing that each group $\mathop{\rm Diff}_+^{k+AC}(M)$, consisting of those $C^k$ diffeomorphisms whose $k$-th derivative is absolutely…

Group Theory · Mathematics 2017-10-31 Michael P. Cohen

We investigate the behavior of functional countability and exponential separability in products and subspaces of topological spaces. We solve a problem of Tkachuk by showing that the product of functionally countable pseudocompact spaces is…

General Topology · Mathematics 2026-03-03 Rodrigo Hernández-Gutiérrez , Santi Spadaro

In this paper we develop a technique of constructing uni- formly continuous maps between function spaces Cp(X) endowed with the pointwise topology. We prove that if a space X is compact metrizable and strongly countable-dimensional, then…

General Topology · Mathematics 2017-10-31 Rafal Gorak , Mikolaj Krupski , Witold Marciszewski

We give new characterizations of sofic groups: -- A group $G$ is sofic if and only if it is a subgroup of a quotient of a direct product of alternating or symmetric groups. -- A group $G$ is sofic if and only if any system of equations…

Group Theory · Mathematics 2017-01-19 Lev Glebsky

We establish a computable version of Gelfand Duality. Under this computable duality, computably compact presentations of metrizable spaces uniformly effectively correspond to computable presentations of unital commutative $C^*$ algebras.

We define and study Poissonian actions of Polish groups as a framework to Poisson suspensions, characterize them spectrally, and provide a complete characterization of their ergodicity. We further construct 'spatial' Poissonian actions,…

Dynamical Systems · Mathematics 2024-09-23 Nachi Avraham-Re'em , Emmanuel Roy

We embed a countably categorical group G into a locally compact group c(G) with a non-trivial topology and study how topological properties of c(G) are connected with the structure of definable subgroups of G.

Logic · Mathematics 2008-11-04 Al. A. Ivanov

We study presentations of $C^*(X)$ that are evaluative over a presentation of $X$ in that $(f,p) \mapsto f(p)$ is computable. We prove existence-uniqueness theorems for such presentations. We use our methods to prove an effective…

Logic · Mathematics 2024-03-21 Timothy H. McNicholl

It is known that a group G definable in the field of p-adic numbers is definably locally isomorphic to the group of Q_p-points of a connected algebraic group H defined over Q_p. We show that if H is commutative then G is…

Logic · Mathematics 2018-07-25 Anand Pillay , Ningyuan Yao

We study systematically groups whose marked finite quotients form a recursive set. We give several definitions, and prove basic properties of this class of groups, and in particular emphasize the link between the growth of the depth…

Group Theory · Mathematics 2021-10-27 Emmanuel Rauzy