Related papers: Computable Folner sequences of amenable groups
A block in a linear order is an equivalence class when factored by the block relation B(x,y), satisfied by elements that are finitely far apart. We show that every computable linear order with dense condensation-type (i.e. a dense…
This book describes some computational methods to deal with modular characters of finite groups. It is the theoretical background of the MOC system of the same authors. This system was, and is still used, to compute the modular character…
We show that only a rather small proportion of linear equations are solvable in elements of a fixed finitely generated subgroup of a multiplicative group of a number field. The argument is based on modular techniques combined with a…
In this paper we study unimodular amenable groups. The first part is devoted to results on the existence of uniform families of epsilon-quasi tilings for these groups. In this context, constructions of Ornstein and Weiss are extended by…
Let $G$ be a finite solvable group. Then $G$ always has a useful presentation, which we call a "long presentation". Using a "long presentation" of $G$, we present an inductive method of constructing the irreducible representations of $G$…
We show that every probability-measure-preserving action of a countable amenable group G can be tiled, modulo a null set, using finitely many finite subsets of G ("shapes") with prescribed approximate invariance so that the collection of…
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…
We study growth of 1-cocycles of locally compact groups, with values in unitary representations. Discussing the existence of 1-cocycles with linear growth, we obtain the following alternative for a class of amenable groups G containing…
In the context of Higman embeddings of recursive groups into finitely presented groups we suggest an algorithm which uses Higman operations to explicitly constructs the specific recursively enumerable sets of integer sequences arising…
Recent advances in Bayesian models for random partitions have led to the formulation and exploration of Exchangeable Sequences of Clusters (ESC) models. Under ESC models, it is the cluster sizes that are exchangeable, rather than the…
An integer sequence $(a_n)_{n \in \mathbb{N}}$ is \emph{MC-finite} if for all $m$, the sequence $a_n \bmod m$ is eventually periodic. There are MC-finite sequences $(a_n)_{n \in \mathbb{N}}$ such that the function $F: (m,n) \mapsto a_n…
Recently, Glasner, Lin and Meyerovitch gave a first example of a partial invariant order on a certain group that cannot be invariantly extended to an invariant random total order. Using their result as a starting point we prove that any…
We present a generalization of standard Turing machines based on allowing unusual tapes. We present a set of reasonable constraints on tape geometry and classify all tapes conforming to these constraints. Surprisingly, this generalization…
Sequential hypothesis testing asks for decision rules that update as data arrive. A natural goal is \emph{eventual correctness}: the rule may change its mind early on, but it should make only finitely many wrong decisions almost surely.…
We provide a new characterization of amenability for countable groups, based on frame representations admitting almost invariant vectors. By relaxing the frame inequalities, thereby weakening amenability, we obtain a large class of…
The set of finitely generated subgroups of the group $PL_+(I)$ of orientation-preserving piecewise-linear homeomorphisms of the unit interval includes many important groups, most notably R.~Thompson's group $F$. In this paper we show that…
It has been a longstanding problem whether every amenable operator algebra is isomorphic to a (necessarily nuclear) C*-algebra. In this note, we give a nonseparable counterexample. The existence of a separable counterexample remains an open…
This survey paper examines the effective model theory obtained with the BSS model of real number computation. It treats the following topics: computable ordinals, satisfaction of computable infinitary formulas, forcing as a construction…
We formalize an existing computability-theoretic method of presenting first-order structures whose domains have the cardinality of the continuum. Work using these methods until now has emphasized their topological properties. We shift the…
We show that the topology of pointwise convergence on scattered spaces is compatible with the group structure of their homeomorphism group. We then establish a few topological properties of the homeomorphism group of the first uncountable…