Related papers: Some notes on extended equation solvability and id…
(1) There is a finitely presented group with a word problem which is a uniformly effectively inseparable equivalence relation. (2) There is a finitely generated group of computable permutations with a word problem which is a universal…
In 1968, John Thompson proved that a finite group G is solvable if and only if every 2-generator subgroup of G is solvable. In this paper, we prove that solvability of a finite group G is guaranteed by a seemingly weaker condition: G is…
Recent work of Kaplan and Levy refining a nonsolvability criterion proved by Thompson in his N-Groups paper prompts questions on whether certain conditions on groups are equivalent to nonsolvability.
It is shown that finite groups in which the order of the product of every pair of elements of co-prime order is the product of the orders, is nilpotent.
This paper investigates the computational complexity of deciding if a given finite idempotent algebra has a ternary term operation $m$ that satisfies the minority equations $m(y,x,x) \approx m(x,y,x) \approx m(x,x,y) \approx y$. We show…
The main purpose of this paper is to study the finite-dimensional solvable Lie algebras described in its title, which we call {\em minimal non-${\mathcal N}$}. To facilitate this we investigate solvable Lie algebras of nilpotent length $k$,…
In many instances in first order logic or computable algebra, classical theorems show that many problems are undecidable for general structures, but become decidable if some rigidity is imposed on the structure. For example, the set of…
We consider expressions built up from binary relation names using the operators union, composition, and set difference. We show that it is undecidable to test whether a given such expression $e$ is finitely satisfiable, i.e., whether there…
We prove new upper bounds for the length of laws that hold for all groups of size at most $n$ -- improving on previous results of Bou-Rabee and Kassabov-Matucci. The methods make use of the classification of finite simple groups. Stronger…
We consider factorizations of a finite group $G$ into conjugate subgroups, $G=A^{x_{1}}\cdots A^{x_{k}}$ for $A\leq G$ and $x_{1},\ldots ,x_{k}\in G$, where $A$ is nilpotent or solvable. First we exploit the split $BN$-pair structure of…
We prove the existence of abelian, solvable and nilpotent definable envelopes for groups definable in models of an NTP2 theory.
If $M$ is a submonoid of a finitely generated nilpotent group $G$, and $MG'$ is a finite index subgroup of $G$, then $M$ itself is a finite index subgroup of $G$. If $MG'=G$, then $M=G$. This generalizes a well-known theorem for subgroups…
In this paper we introduce the notion of pure non-characteristically nilpotent Lie algebra and under a condition we prove that a complex maximal extension of a finite-dimensional pure non-characteristically nilpotent Lie algebra is…
A group is irreducibly represented if it has a faithful irreducible unitary representation. For countable groups, a criterion for irreducible representability is given, which generalises a result obtained for finite groups by W. Gasch\"utz…
It is known that there exists a first-order sentence that holds in a finite group if and only if the group is soluble. Here it is shown that the corresponding statements with 'solubility' replaced by 'nilpotence' and 'perfectness', among…
The maximum extensions of finite-dimensional nilpotent Lie algebras are considered. In particular, it is proved that in the general case such an extension is not unique, which refutes one L. Snoble's assumption.
Motivated by the quest for a logic for PTIME and recent insights that the descriptive complexity of problems from linear algebra is a crucial aspect of this problem, we study the solvability of linear equation systems over finite groups and…
We develop methods for computing with matrix groups defined over a range of infinite domains, and apply those methods to the design of algorithms for nilpotent groups. In particular, we provide a practical algorithm to test nilpotency of…
For a fixed finite group $Q$ and semi-simple finite dimensional algebra $S$, we examine an equivalence between strongly $Q$-graded algebras (extensions) with identity component $S$ and $S^1$-gerbes on action groupoids of $Q$ on the set of…
We show that group C*-algebras of finitely generated, nilpotent groups have finite nuclear dimension. It then follows, from a string of deep results, that the C*-algebra $A$ generated by an irreducible representation of such a group has…