A note on character kernels in finite groups of prime power order

The homological functors of a group were first introduced in homotopy theory. Some of the homological functors including the nonabelian tensor square and the Schur multiplier of abelian groups of prime power order are determined in this paper. The nonabelian tensor square of a group G introduced by Brown and Loday in 1987 is a special case of the nonabelian tensor product. Meanwhile, the Schur multiplier of G is the second cohomology with integer coefficients is named after Issai Schur. The aims of this paper are to determine the nonabelian tensor square and the Schur multiplier of abelian groups of order p5, where p is an odd prime

This paper explores the topological indices of the coprime graph defined on the group of integers modulo a prime power. A coprime graph is constructed with vertices representing group elements, where two vertices are adjacent if and only if their orders are relatively prime. The study focuses on analyzing four topological indices: the ABC index, Forgotten index, Gourava index, and Nirmala index. This work aims to enhance the understanding of the topological properties of coprime graphs within the structure of integer modulo groups of prime power order.

On the computational complexity of the theory of Abelian groups

(2001). Quantum Error Correction: Classic Group Theory Meets a Quantum Challenge. The American Mathematical Monthly: Vol. 108, No. 10, pp. 932-962.

A classification of two-generator 3-groups of second maximal class and low order is presented. All such groups with orders up to 38 are described, and in some cases with orders up to 310. The classification is based on computer aided computations. A description of the computations and their results are presented, together with an indication of their significance.

We present a fully secure ciphertext-policy attribute-based encryption (CP-ABE) scheme in prime order group by using a tool which can convert composite order paring-based encryption scheme into prime order one. Although, a fully secure CP-ABE scheme in prime order group has been proposed recently, our scheme needs less master secret key size and can be seen as a different version of it. Besides, the sketch of our scheme's security proof is also given.

The coclass project (1980-1994) provided a new and powerful way to classify finite p-groups. This monograph gives a coherent account of the thinking from which the philosophy that lead to this classification developed. The authors provide a careful summary and explanation of the many and difficult original research papers on the coclass conjecture and the structure theorem, thus elucidating the background research for those new to the area as well as for experienced researchers. The classification philosophy has lead to many new and challenging problems. Amongst those considered are problems about pro-p-groups, the Grigorchuk group, the Nottingham group as well as linear pro-p-groups. Throughout the book the authors have used a wide range of algebraic techniques and have developed from first principles, or from basic and well known results, the cohomology of groups, spectral sequences, and representation theory. This comprehensive and long-awaited survey of the recent and current research on the structure of finite p-groups will be an important reference for all group theorists.

We present a new encoding framework for predicate encryption (PE) in prime order groups. Our framework captures a broader range of adaptively secure PE schemes by allowing PE schemes to have more flexible (i.e., non-linear) structures. The existing works dealing with adaptively secure PE schemes in prime order groups require strict structural restrictions on PE schemes. In particular, the exponents of public keys and master secret keys of the PE schemes, which are referred to as common variables, must be linear. In this paper, we introduce a modular approach which includes non-linear common variables in PE schemes. First, we formalize non-linear structures by improving Attrapadung’s pair encoding framework (Eurocrypt’14). Then, we provide a generic compiler that incorporates encodings under our framework to PE schemes in prime order groups. Notably, we prove the security of our compiler by introducing a new technique that decomposes common variables into two types and makes one of them shared between semi-functional and normal spaces on processes of the dual system encryption. As instances of our new framework, we introduce new attribute-based encryption schemes supporting non-monotone access structures, namely non-monotonic ABE. Our new schemes are adaptively secure in prime order groups and have either short ciphertexts (in the case of KP-ABE) or short keys (in the case of CP-ABE).

If a graph is cut along each edge and can be divided into many faces, the graph has been defined to be a map when each face is homomorphic to an open disk and a bipartite map called dessin. A dessin D is regular Aut (D) if action transfer on the edge set. In particular, given a finite group G, a regular dessin is uniquely regular dessin if there is only one isomorphism class of Aut (D) are isomorphic to G. In this paper, for a nilpotent automorphism group of odd prime power order and nilpotency class four, we employ group-theoretical methods to classify these uniquely regular dessins.

The minimum genus problem consists on determining the minimum algebraic genus of a surface on which a given group G acts. For cyclic groups G this problem on bordered Klein surfaces was solved in 1989. The next step is to fix the number of boundary components of the surface and to obtain the minimum algebraic genus, and so the minimum topological genus. It was achieved for cyclic groups of prime and prime-power order in the nineties. In this work the corresponding results for cyclic groups of order N = 2q, where q is an odd prime, are obtained. There appear different results depending on the orientability of the surface. Finally, using the above mentioned results and those of this paper, we state explicitly, the general values for arbitrary number of boundary components, which are valid for each N < 12, and show how to deal with N = 12.

We now deal with problems of p odd similar to those of Chapter V for p = 2. We lead off in section 43 with differentiable, orientation preserving actions of (Z p ) k , p an odd prime, on closed oriented manifolds V n . The primary aim is to give existence theorems for stationary points of such actions. Our interest in such problems has been aroused by the work of Borel [6, 9], although we attack the problem from a different point of view. An example of a corollary of our results is that if V n has one of its Pontryagin numbers not divisible by p then the action has a stationary point. We go on to note that if a toral group acts on V n without stationary points then [V n ] represents a torsion element of Ω n .

The distinguishing number of a graph $G$ is a symmetry related graph invariant whose study started two decades ago. The distinguishing number $D(G)$ is the least integer $d$ such that $G$ has a $d$-distinguishing coloring. A distinguishing $d$-coloring is a coloring $c:V(G)\rightarrow\{1,...,d\}$ invariant only under the trivial automorphism. In this paper, we introduce a game variant of the distinguishing number. The distinguishing game is a game with two players, the Gentle and the Rascal, with antagonist goals. This game is played on a graph $G$ with a set of $d\in\mathbb N^*$ colors. Alternately, the two players choose a vertex of $G$ and color it with one of the $d$ colors. The game ends when all the vertices have been colored. Then the Gentle wins if the coloring is distinguishing and the Rascal wins otherwise. This game leads to define two new invariants for a graph $G$, which are the minimum numbers of colors needed to ensure that the Gentle has a winning strategy, depending on who starts. These invariants could be infinite, thus we start by giving sufficient conditions to have infinite game distinguishing numbers. We also show that for graphs with cyclic automorphisms group of prime odd order, both game invariants are finite. After that, we define a class of graphs, the involutive graphs, for which the game distinguishing number can be quadratically bounded above by the classical distinguishing number. The definition of this class is closely related to imprimitive actions whose blocks have size $2$. Then, we apply results on involutive graphs to compute the exact value of these invariants for hypercubes and even cycles. Finally, we study odd cycles, for which we are able to compute the exact value when their order is not prime. In the prime order case, we give an upper bound of $3$.

Cryptographic operations are performed everywhere, from standard laptop to smart cards. Some devices computational resources can be very limited and it is natural to delegate costly operations to another device capable of carrying out cryptographic algorithms. In this setting, it is obviously important to ensure the limited device that the computation is carried out correctly and that the powerful device does not learn anything about what is actually computing (including the secret inputs and outputs). We briefly review the recent advances on secure outsourcing of group exponentiation (in groups of known prime order as well as in groups of unknown order) and pairing computation.

In this paper, we shall deal with periodic groups, in which each element has a prime power order. A group [Formula: see text] will be called a [Formula: see text]-group if each element of [Formula: see text] has a prime power order and for each [Formula: see text] there exists a positive integer [Formula: see text] such that each [Formula: see text]-element of [Formula: see text] is of order [Formula: see text]. A group [Formula: see text] will be called a [Formula: see text]-group if each element of [Formula: see text] has a prime power order and for each [Formula: see text] there exists a positive integer [Formula: see text] such that each finite [Formula: see text]-subgroup of [Formula: see text] is of order [Formula: see text]. Here, [Formula: see text] denotes the set of all primes dividing the order of some element of [Formula: see text]. Our main results are the following four theorems. Theorem 1: Let [Formula: see text] be a finitely generated [Formula: see text]-group. Then [Formula: see text] has only a finite number of normal subgroups of finite index. Theorem 4: Let [Formula: see text] be a locally graded [Formula: see text]-group. Then [Formula: see text] is a locally finite group. Theorem 7: Let [Formula: see text] be a locally graded [Formula: see text]-group. Then [Formula: see text] is a finite group. Theorem 8: Let [Formula: see text] be a [Formula: see text]-group satisfying [Formula: see text]. Then [Formula: see text] is a locally finite group.

Given a finite group G, we denote by $$\psi (G)$$ the sum of the element orders in G. In this article, we prove that if t is the number of nonidentity conjugacy classes in G, then $$\psi (G)=1+t|G|$$ if and only if G is either a group of prime order or a nonabelian group of the square-free order with two prime divisors. Also we find a unique group with the second maximum sum of the element orders among all finite groups of the same square-free order.