Related papers: Computable Scott sentences and the weak Whitehead …

A word $w$ is said to be concise in a class of groups if, for every $G$ in that class such that the set of $w$-values $w\{G\}$ is finite, the verbal subgroup $w(G)$ is also finite. In the context of profinite groups, the notion of strong…

We consider dense 2-generator multiplicative subgroups in $\mathbb C$ and show that for each point $z\in \mathbb C$ the set of limit values for the arguments of the powers of each generator at the point $z$ is either finite or is…

We show that an \'etale groupoid which is strongly amenable at infinity is amenable whenever its full and reduced $C^*$-algebras coincide.

We show that any subgroup of a (virtually) nilpotent-by-polycyclic group satisfies the bounded packing property of Hruska-Wise. In particular, the same is true about metabelian groups and linear solvable groups. However, we find an example…

We study finitely generated nilpotent groups $G$ given by full rank finite presentations $\langle A \mid R\rangle$ in the variety $\mathcal{N}_c$ of nilpotent groups of class at most $c$, where $c \geq 2$. We prove that if the deficiency…

In this paper, we show that Cremona groups are sofic. We actually introduce a quantitative notion of soficity, called sofic profile, and show that the group of birational transformations of a d-dimensional variety has sofic profile at most…

We introduce a non-wellfounded proof system for intuitionistic logic extended with inductive and co-inductive definitions, based on a syntax in which fixpoint formulas are annotated with explicit variables for ordinals. We explore the…

Bialgebroids, separable bialgebroids, and weak Hopf algebras are compared from a categorical point of view. Then properties of weak Hopf algebras and their applications to finite index and finite depth inclusions of von Neumann algebras are…

Suppose that a finite group $G$ admits a Frobenius group of automorphisms FH of coprime order with cyclic kernel F and complement H such that the fixed point subgroup $C_G(H)$ of the complement is nilpotent of class $c$. It is proved that…

Solvability of the rational quantum integrable systems related to exceptional root spaces $G_2, F_4$ is re-examined and for $E_{6,7,8}$ is established in the framework of a unified approach. It is shown the Hamiltonians take algebraic form…

The well known Andrews-Curtis Conjecture [2] is still open. In this paper, we establish its finite version by describing precisely the connected components of the Andrews-Curtis graphs of finite groups. This finite version has independent…

We prove that, for a finitely generated residually finite group, having solvable word problem is not a sufficient condition to be a subgroup of a finitely presented residually finite group. The obstruction is given by a residually finite…

We show that the following problems are decidable in a rank 2 free group F_2: does a given finitely generated subgroup H contain primitive elements? and does H meet the orbit of a given word u under the action of G, the group of…

If $X$ is an orientable, strongly minimal $PD_4$-complex and $\pi_1(X)$ has one end then it has no nontrivial locally-finite normal subgroup. Hence if $\pi$ is a 2-knot group then (a) if $\pi$ is virtually solvable then either $\pi$ has two…

Thompson's theorem stated that a finite group $G$ is solvable if and only if every $2$-generated subgroup of $G$ is solvable. In this paper, we prove some new criteria for both solvability and nilpotency of a finite group using certain…

Let G be a finite group and {\sigma} = {{\sigma}_i, i \in I} be a partition of the set of all primes \mathbb{P}. A set \mathcal{H} of subgroups of G with 1 \in \mathcal{H} is said to be a complete Hall {\sigma}-set of G if every…

In the paper we characterize the class of finite solvable groups by two-variable identities in a way similar to the characterization of finite nilpotent groups by Engel identities. More precisely, a sequence of words $u_1,...,u_n,... $ is…

What is computable with limited resources? How can we verify the correctness of computations? How to measure computational power with precision? Despite the immense scientific and engineering progress in computing, we still have only…

We prove that the double covers of the alternating and symmetric groups are determined by their complex group algebras. To be more precise, let $n\geq 5$ be an integer, $G$ a finite group, and let $\AAA$ and $\SSS^\pm$ denote the double…

We calculate the possible Scott ranks of countable models of Peano arithmetic. We show that no non-standard model can have Scott rank less than $\omega$ and that non-standard models of true arithmetic must have Scott rank greater than…