Related papers: Computable Scott Sentences for Quasi-Hopfian Finit…

A Hopf Galois structure on a finite field extension $L/K$ is a pair $(H,\mu)$, where $H$ is a finite cocommutative $K$-Hopf algebra and $\mu$ a Hopf action. In this paper we present a program written in the computational algebra system…

Real physical systems with reflective and rotational symmetries such as viruses, fullerenes and quasicrystals have recently been modeled successfully in terms of three-dimensional (affine) Coxeter groups. Motivated by this progress, we…

In computable topology, a represented space is called computably discrete if its equality predicate is semidecidable. While any such space is classically isomorphic to an initial segment of the natural numbers, the computable-isomorphism…

Aiming for a revival of the theory of crystallographic complex reflection groups, we compute (minimal) Coxeter-like reflection presentations for the infinite families of those non-genuine groups which satisfy Steinberg's fixed point…

In this paper we define countable-configuration of groups and prove that two Hopfian groups with the same set of countable-configurations are isomorphic and vice versa. We also study the countable paradoxical decomposition of groups. It is…

We prove the dichotomy that every Coxeter group either has a strongly solid group von Neumann algebra or contains the product of an infinite cyclic group and a free group of rank 2. This generalizes the same dichotomy for right-angled…

A group G is (finitely) co-Hopfian if it does not contain any proper (finite-index) subgroups isomorphic to itself. We study finitely generated groups G that admit a descending chain of proper normal finite-index subgroups, each of which is…

With the long-term goal of proving local structure theorems of algebraic stacks in positive characteristic near points with reductive (but possibly non-linearly reductive) stabilizer, we conjecture that quotient stacks of the form…

We initiate the study of the effective content of $K$-theory for $\mathrm{C}^*$-algebras. We prove that there are computable functors which associate, to a computably enumerable presentation of a $\mathrm{C}^*$-algebra $\boldA$, computably…

We introduce a new class of Abelian groups which lies strictly between the classes of co-Hopfian groups and Dedekind-finite groups, calling these groups {\it Bassian-finite}. We prove the surprising fact that in the torsion case the…

We classify finite-dimensional complex Hopf algebras $A$ which are pointed, that is, all of whose irreducible comodules are one-dimensional, and whose group of group-like elements $G(A)$ is abelian such that all prime divisors of the order…

Let A be a commutative noetherian ring. Call a functor <<commutative A-algebras>> --> <<sets>> coherent if it can be built up (via iterated finite limits) from functors of the form B \mapsto M tensor_A B, where M is a f.g. A-module. When…

Stackability for finitely presented groups consists of a dynamical system that iteratively moves paths into a maximal tree in the Cayley graph. Combining with formal language theoretic restrictions yields auto- or algorithmic stackability,…

We show that, when $A$ is a separable C*-algebra, every countably generated Hilbert $A$-module is projective (with bounded module maps as morphisms). We also study the approximate extensions of bounded module maps. In the case that $A$ is a…

A rank is a notion in descriptive set theory that describes ranks such as the Cantor-Bendixson rank on the set of closed subsets of a Polish space, differentiability ranks on the set of differentiable functions in $C[0,1]$ such as the…

In this paper, we investigate connections between structures present in every generic extension of the universe $V$ and computability theory. We introduce the notion of {\em generic Muchnik reducibility} that can be used to to compare the…

Random groups of density d<\frac{1}{2} are infinite hyperbolic, and of density d>\frac{1}{2} are finite. We prove the existence of a uniform quantifier elimination procedure for formulas of minimal rank (probably the superstable part of the…

This paper is part II of a study on cardinals that are characterizable by a Scott sentence, continuing the work from http://arxiv.org/abs/1007.2426v1. A cardinal $\kappa$ is characterized by a Scott sentence $\phi_M$, if $\phi_M$ has a…

We consider the class of finitely generated groups which have a normal form computable in logspace. We prove that the class of such groups is closed under finite extensions, finite index subgroups, direct products, wreath products, and also…

A theorem of A.A. Brudno says that the Kolmogorov-Sinai entropy of a subshift X over $\mathbb{N}$ with respect to an ergodic measure $\mu$ equals the asymptotic Kolmogorov complexity of almost every word $\omega$ in X. The purpose of this…