Related papers: Computability of F{\o}lner sets

In this paper, we show that each finite group $G$ containing at most $p^2$ Sylow $p$-subgroups for each odd prime number $p$, is a solvable group. In fact, we give a positive answer to the conjecture in \cite{Rob}.

Following Gluck and Wolf we complete the It\^o--Michler's Theorem for the projective representations of a $p$-solvable or $\pi$-separable group, and then we relate the projective irreducible modules of such a group with those of its Sylow…

Using an iterative tree construction we show that for simple computable subsets of the Cantor space Hausdorff, constructive and computable dimensions might be incomputable.

We establish a general criterion for the finite presentability of subdirect products of groups and use this to characterize finitely presented residually free groups. We prove that, for all $n\in\mathbb{N}$, a residually free group is of…

There exist combable groups in which the conjugacy problem is unsolvable. The isomorphism problem is unsolvable for certain recursive sequences of finite presentations of combable groups.

We study two complexity notions of groups - a computable Scott sentence and the index set of a group. Finding the exact complexity of one of them usually involves finding the complexity of the other, but this is not the case sometimes. J.…

The solvability of monomial groups is a well-known result in character theory. Certain properties of Artin L-series suggest a generalization of these groups, namely to such groups where every irreducible character has some multiple which is…

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…

We give the first examples of (non-amenable group) amenable actions on stably finite simple C*-algebras. More precisely, we give such actions for any countable group in an explicit way. The main ingredients of our construction are the full…

computable functions are defined by abstract finite deterministic algorithms on many-sorted algebras. We show that there exist finite universal algebraic specifications that specify uniquely (up to isomorphism) (i) all abstract computable…

The \emph{index set} of a computable structure $\mathcal{A}$ is the set of indices for computable copies of $\mathcal{A}$. We determine the complexity of the index sets of various mathematically interesting structures, including arbitrary…

We demonstrate the existence of a family of finitely generated subgroups of Richard Thompson's group $F$ which is strictly well-ordered by the embeddability relation in type $\epsilon_0 +1$. All except the maximum element of this family…

Let $G=NH$ be a Lie group where $N,H$ are closed connected subgroups of $G,$ and $N$ is an exponential solvable Lie group which is normal in $G.$ Suppose furthermore that $N$ admits a unitary character $\chi_{\lambda}$ corresponding to a…

We introduce the notions of u-amenability and hyper-u-amenability for countable Borel equivalence relations, strong forms of amenability that are implied by hyperfiniteness. We show that treeable, hyper-u-amenable countable Borel…

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…

In this paper we survey a new criteria for solvability of finite groups in terms of number of supersolvable (also known as polycyclic) and non-supersolvable subgroups. In particular, we present original examples of supersolvable groups such…

We generalize the classical definition of effectively closed subshift to finitely generated groups. We study classical stability properties of this class and then extend this notion by allowing the usage of an oracle to the word problem of…

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…

Let $K=Z/pZ$ and let $A$ be a subset of $\GL_r(K)$ such that $<A>$ is solvable. We reduce the study of the growth of $A$ under the group operation to the nilpotent setting. Specifically we prove that either $A$ grows rapidly (meaning…

Hard instances of natural computational problems are often elusive. In this note we present an example of a natural decision problem, the word problem for a certain finitely presented group, whose hard instances are easy to find. More…