Related papers: Computable analysis on the space of marked groups
A locally checkable labeling problem (LCL) on a group $\Gamma$ asks one to find a labeling of the Cayley graph of $\Gamma$ satisfying a fixed, finite set of "local" constraints. Typical examples include proper coloring and perfect matching…
The image of a polynomial map is a constructible set. While computing its closure is standard in computer algebra systems, a procedure for computing the constructible set itself is not. We provide a new algorithm, based on algebro-geometric…
Definable topological groups whose topologies are affine have definable $\mathcal C^r$ structures in d-minimal expansions of ordered fields, where $r$ is a positive integer. We prove this fact using a new notion called partition degree of a…
We give several new examples of computable structures of high Scott rank. For earlier known computable structures of Scott rank $\omega_1^{CK}$, the computable infinitary theory is $\aleph_0$-categorical. Millar and Sacks asked whether this…
This article continues the study of computable elementary topology started by the author and T. Grubba in 2009 and extends the author's 2010 study of axioms of computable separation. Several computable T3- and Tychonoff separation axioms…
In this paper, continuous binary operations of a topological space are studied and a criterion of their invertibility is proved. The classification problem of groups of invertible continuous binary operations of locally compact and locally…
We motivate and study the class $\mathcal{C}$ of countable groups $G$ such that the conjugacy relation between minimal actions of $G$ on $\mathbb{R}$ by orientation-preserving homeomorphisms is smooth -- that is, admits a Borel transversal.…
Motivated by the study of the large-scale geometry of topological groups, we investigate particular families of subsets of topological groups named group ideals. We compare different group ideals in the realm of locally compact groups. In…
Suppose $p \geq 1$ is a computable real. We extend previous work of Clanin, Stull, and McNicholl by classifying the computable $L^p$ spaces whose underlying measure spaces are atomic but not purely atomic. In addition, we determine the…
Universality has been an important concept in computable structure theory. A class $\mathcal{C}$ of structures is universal if, informally, for any structure, of any kind, there is a structure in $\mathcal{C}$ with the same…
We are studying the degrees in which a computable structure is relatively computably categoricity, i.e., computably categorcial among all non-computable copies of the structure. Unlike the degrees of computable categoricity we can bound the…
We present a uniform methodology for computing with finitely generated matrix groups over any infinite field. As one application, we completely solve the problem of deciding finiteness in this class of groups. We also present an algorithm…
We describe an algorithm for determining the algebraic subgroup of GL(n,C) that is defined as the closure of the group generated by a finite number of elements of GL(n,C). The algorithm avoids the use of Groebner bases and can be used on…
The Grothendieck property has become important in research on the definability of pathological Banach spaces [CI], [HT], and especially [HT20]. We here answer a question of Arhangel'ski\u{\i} by proving it undecidable whether countably…
Contents of the issue: Selection Principles and special sets of reals: Open problems Winning the pressing down game but not Banach Mazur Ramsey classes of topological and metric spaces More on partitioning triples of countable ordinals…
We study automorphism groups of randomizations of separable structures, with focus on the $\aleph_0$-categorical case. We give a description of the automorphism group of the Borel randomization in terms of the group of the original…
We study the degrees of selector functions related to the degrees in which a rigid computable structure is relatively computably categorical. It is proved that for some structures such degrees can be represented as the unions of upper cones…
We examine categoricity issues for computable algebraic fields. We give a structural criterion for relative computable categoricity of these fields, and use it to construct a field that is computably categorical, but not relatively…
The purpose of this article is to extend the earliest results of A.A. Brudno, connecting topological entropy of a subshift X over $\mathbb{N}$ to the Kolmogorov complexity of words in X, to subshifts over computable groups that posses…
We prove that there exist weakly countably determined spaces of complexity higher than coanalytic. On the other hand, we also show that coanalytic sets can be characterized by the existence of a cofinal adequate family of closed sets.…