For a $p$-group of order $p^n$, it is known that the $2$-nilpotent multiplier equal to $|\mathcal{M}^{(2)}(G)|=p^{\f12n(n-1)(n-2)+3-s_2(G)}$ for an integer $s_2(G)$. In this article, we characterize all non abelian $p$-groups satisfying in $s_2(G)\in\{1,2,3\}.

A new family of minimal spectrally arbitrary patterns is presented which allow for arbitrary spectrum by using the Nilpotent-Jacobian method introduced in [J.H. Drew, C.R. Johnson, D.D. Olesky, and P. van den Driessche. Spectrally arbitrary patterns.Lin. Alg. and Appl. 308:121137, 2000]. The novel approach here is the use of the Intermediate Value Theorem to avoid finding an explicit nilpotent ...

A new family of minimal spectrally arbitrary patterns is presented which allow for arbitrary spectrum by using the Nilpotent-Jacobian method introduced in [J.H. Drew, C.R. Johnson, D.D. Olesky, and P. van den Driessche. Spectrally arbitrary patterns.Lin. Alg. and Appl. 308:121137, 2000]. The novel approach here is the use of the Intermediate Value Theorem to avoid finding an explicit nilpotent ...

A group is called capable if it is a central factor group. We consider the capability of nilpotent products of cyclic groups, and obtain a generalization of a theorem of Baer for the small class case. The approach is also used to obtain some recent results on the capability of certain nilpotent groups of class 2. We also prove a necessary condition for the capability of an arbitrary p-group of ...

We prove that the theory of the p-adics Qp, together with a set of explicitly given sorts, admits elimination of imaginaries. Using p-adic integration, we deduce the rationality of certain formal zeta functions arising from definable equivalence relations. As an application, we prove rationality results for zeta functions obtained by counting isomorphism classes of irreducible representations o...

We give the first polynomial-time algorithm for checking whether the Galois group Gal (f) of an input polynomial f(X) ∈ Q[X] is nilpotent: the running time of our algorithm is bounded by a polynomial in the size of the coefficients of f and the degree of f . Additionally, we give a deterministic polynomial-time algorithm that, when given as input a polynomial f(X) ∈ Q[X] with nilpotent Galois g...