On the minimum genus problem on bordered Klein surfaces for automorphisms of even order

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.

A compact bordered Klein surface of genus g > 2 is said to have maximal symmetry if its automorphism group is of order 12(g -1), the largest possible.We show that for each value of k there are only finitely many topological types of bordered Klein surfaces with maximal symmetry that have exactly k boundary components.We also prove that there are no bordered Klein surfaces with maximal symmetry that have exactly p boundary components for any prime p > 5.These results are established using the concept of a fully wound covering, that is, a full covering <p: X -* Y of the bordered surface Y with the maximum possible boundary degree.

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.

We study the finite solvable groups 𝐺 in which every real element has prime power order. We divide our examination into two parts: the case O 2 ⁢ ( G ) &gt; 1 \mathbf{O}_{2}(G)&gt;1 and the case O 2 ⁢ ( G ) = 1 \mathbf{O}_{2}(G)=1 . Specifically we prove that if O 2 ⁢ ( G ) &gt; 1 \mathbf{O}_{2}(G)&gt;1 , then 𝐺 is a { 2 , p } \{2,p\} -group. Finally, by taking into consideration the examples presented in the analysis of the O 2 ⁢ ( G ) = 1 \mathbf{O}_{2}(G)=1 case, we deduce some interesting and unexpected results about the connectedness of the real prime graph Γ R ⁢ ( G ) \Gamma_{\mathbb{R}}(G) . In particular, we find that there are groups such that Γ R ⁢ ( G ) \Gamma_{\mathbb{R}}(G) has 3 or 4 connected components.

In this note, we classify the finite groups of prime power order for which all nonlinear irreducible character kernels constitute a chain with respect to inclusion.

Nilpotency in automorphic loops of prime power order

Recently, graphs have started to be used to represent a finite ring. Nikmehr and Khojasteh in the article defined the nilpotent graph of a ring . Denoted , is a graph with the set of vertices being all the elements in the ring Two vertices and are adjacent if and only if is nilpotent elements in the ring . Topological index is a field that discusses graph structure based on the degree of each vertex of a graph and the distance between vertices. In this study, the author will gives the general formula of the Szeged index and Padmakar-Ivan index of the nilpotent graph graph of the modulo ring with prime power order. The result of this research is a general formula for the topological indices of nilpotent graphs of the integer modulo ring, called the Szeged index and the Padmakar-Ivan index.

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).

On the computational complexity of the theory of Abelian groups

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.

We can now determine the structure of finite abelian groups. In particular, every such group is isomorphic to a direct product of cyclic groups, each having prime power order. The proof of this result is our main goal in the present chapter.

Polynomial representations of complete sets of frequency hyperrectangles with prime power dimensions

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$.

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

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