Related papers: Equations in virtually class 2 nilpotent groups
In this paper, we work on the pro-nilpotent group topology of a free group. First we investigate the closure of the product of finitely many subgroups of a free group in the pro-nilpotent group topology. We present an algorithm for the…
We show that any Abelian module category over the (degenerate or quantum) Heisenberg category satisfying suitable finiteness conditions may be viewed as a 2-representation over a corresponding Kac-Moody 2-category (and vice versa). This…
This paper introduces in a natural way a notion of horizontal convex envelopes of continuous functions in the Heisenberg group. We provide a convexification process to find the envelope in a constructive manner. We also apply the…
A group is called $(m,n)$-bicyclic if it can be expressed as a product of two cyclic subgroups of orders $m$ and $n$, respectively. The classification and characterization of finite bicyclic groups have long been important problems in group…
Let $G$ be a finite group. In this short note, we give a criterion of nilpotency of $G$ based on the existence of elements of certain order in each section of $G$.
We prove that if $G$ is finite 2-generated $p$-group of nilpotence class at most 2 then the group algebra of $G$ with coefficients in the field with $p$ elements determines $G$ up to isomorphisms.
The probabilistic description of finite classical systems often leads to linear kinetic equations. A set of physically motivated mathematical requirements is accordingly formulated. We show that it necessarily implies that solutions of such…
We study finitely generated groups whose word problems are accepted by counter automata. We show that a group has word problem accepted by a blind n-counter automaton in the sense of Greibach if and only if it is virtually free abelian of…
We study groups of some virtual knots with small number of crossings and prove that there is a virtual knot with long lower central series which, in particular, implies that there is a virtual knot with residually nilpotent group. This…
We show that the epimorphism problem is solvable for targets that are virtually cyclic or a product of an Abelian group and a finite group.
In this article we describe extensions of some K-theory classes of Heisenberg modules over higher-dimensional noncommutative tori to projective modules over crossed products of noncommutative tori by finite cyclic groups, aka noncommutative…
We show that every discrete subgroup of $\mathrm{GL}(n,\mathbb{R})$ admits a finite dimensional classifying space with virtually cyclic stabilizers. Applying our methods to $\mathrm{SL}(3,\mathbb{Z})$, we obtain a four dimensional…
Nearly $60$ years ago, L\'{a}szl\'{o} Fuchs posed the problem of determining which groups can be realized as the group of units of a commutative ring. To date, the question remains open, although significant progress has been made. Along…
We obtain an entire Liouville type theorem to the classical semilinear subcritical elliptic equation on Heisenberg group. A pointwise estimate near the isolated singularity was also proved. The soul of the proofs is an a priori integral…
We consider decidability problems in self-similar semigroups, and in particular in semigroups of automatic transformations of $X^*$. We describe algorithms answering the word problem, and bound its complexity under some additional…
Let $U$ be an algebraic subgroup of the group of $n\times n$ upper-triangular matrices with units on the diagonal over a finite field of large enough characteristic, and $\mathfrak{n}$ be the Lie algebra of $U$. The main tool in…
The exact degree bound for the generators of rings of polynomial invariants is determined for the finite, non-cyclic groups having a cyclic subgroup of index two. It is proved that the Noether number of these groups equals one half the…
In this paper, we provide new criteria for the solvability and supersolvability of a finite group based on its number of cyclic subgroups. A finite group G is called n-cyclic if it contains n cyclic subgroups. This paper also partially…
This contains a new version of the so-called non-commutative Gauss algorithm for polycyclic groups. Its results allow to read off the order and the index of a subgroup in an (possibly infinite) polycyclic group.
The discreteness problem for finitely generated subgroups of $PSL(2,\mathbb{R})$ and $PSL(2,\mathbb{C})$ is a long-standing open problem. In this paper we consider whether or not this problem is decidable by an algorithm. Our main result is…