STRICT INEQUALITIES FOR MINIMAL DEGREES OF DIRECT PRODUCTS

2009 ◽  
Vol 79 (1) ◽  
pp. 23-30 ◽  
Author(s):  
NEIL SAUNDERS

AbstractThe minimal faithful permutation degree μ(G) of a finite group G is the least non-negative integer n such that G embeds in the symmetric group Sym(n). Work of Johnson and Wright in the 1970s established conditions for when μ(H×K)=μ(H)+μ(K), for finite groups H and K. Wright asked whether this is true for all finite groups. A counter-example of degree 15 was provided by the referee and was added as an addendum in Wright’s paper. Here we provide two counter-examples; one of degree 12 and the other of degree 10.

Author(s):  
Ingrid Bauer ◽  
Christian Gleissner

AbstractIn this paper the authors study quotients of the product of elliptic curves by a rigid diagonal action of a finite group G. It is shown that only for $$G = {{\,\mathrm{He}\,}}(3), {\mathbb {Z}}_3^2$$ G = He ( 3 ) , Z 3 2 , and only for dimension $$\ge 4$$ ≥ 4 such an action can be free. A complete classification of the singular quotients in dimension 3 and the smooth quotients in dimension 4 is given. For the other finite groups a strong structure theorem for rigid quotients is proven.


Author(s):  
Xuanlong Ma

Let [Formula: see text] be a finite group. The power graph of [Formula: see text] is the undirected graph whose vertex set is [Formula: see text], and two distinct vertices are adjacent if one is a power of the other. The reduced power graph of [Formula: see text] is the subgraph of the power graph of [Formula: see text] obtained by deleting all edges [Formula: see text] with [Formula: see text], where [Formula: see text] and [Formula: see text] are two distinct elements of [Formula: see text]. In this paper, we determine the proper connection number of the reduced power graph of [Formula: see text]. As an application, we also determine the proper connection number of the power graph of [Formula: see text].


1983 ◽  
Vol 26 (3) ◽  
pp. 297-306 ◽  
Author(s):  
K. D. Magill ◽  
P. R. Misra ◽  
U. B. Tewari

In [3] we initiated our study of the automorphism groups of a certain class of near-rings. Specifically, let P be any complex polynomial and let P denote the near-ring of all continuous selfmaps of the complex plane where addition of functions is pointwise and the product fg of two functions f and g in P is defined by fg=f∘P∘g. The near-ring P is referred to as a laminated near-ring with laminating element P. In [3], we characterised those polynomials P(z)=anzn + an−1zn−1 +…+a0 for which Aut P is a finite group. We are able to show that Aut P is finite if and only if Deg P≧3 and ai ≠ 0 for some i ≠ 0, n. In addition, we were able to completely determine those infinite groups which occur as automorphism groups of the near-rings P. There are exactly three of them. One is GL(2) the full linear group of all real 2×2 nonsingular matrices and the other two are subgroups of GL(2). In this paper, we begin our study of the finite automorphism groups of the near-rings P. We get a result which, in contrast to the situation for the infinite automorphism groups, shows that infinitely many finite groups occur as automorphism groups of the near-rings under consideration. In addition to this and other results, we completely determine Aut P when the coefficients of P are real and Deg P = 3 or 4.


Author(s):  
Ramesh Prasad Panda ◽  
Kamal Lochan Patra ◽  
Binod Kumar Sahoo

The power graph [Formula: see text] of a finite group [Formula: see text] is the undirected simple graph whose vertex set is [Formula: see text], in which two distinct vertices are adjacent if one of them is an integral power of the other. For an integer [Formula: see text], let [Formula: see text] denote the cyclic group of order [Formula: see text] and let [Formula: see text] be the number of distinct prime divisors of [Formula: see text]. The minimum degree [Formula: see text] of [Formula: see text] is known for [Formula: see text], see [R. P. Panda and K. V. Krishna, On the minimum degree, edge-connectivity and connectivity of power graphs of finite groups, Comm. Algebra 46(7) (2018) 3182–3197]. For [Formula: see text], under certain conditions involving the prime divisors of [Formula: see text], we identify at most [Formula: see text] vertices such that [Formula: see text] is equal to the degree of at least one of these vertices. If [Formula: see text], or that [Formula: see text] is a product of distinct primes, we are able to identify two such vertices without any condition on the prime divisors of [Formula: see text].


2020 ◽  
Vol 27 (01) ◽  
pp. 131-136
Author(s):  
Elena V. Konstantinova ◽  
Daria Lytkina

We prove that the spectrum of a Cayley graph over a finite group with a normal generating set S containing with every its element s all generators of the cyclic group 〈s〉 is integral. In particular, a Cayley graph of a 2-group generated by a normal set of involutions is integral. We prove that a Cayley graph over the symmetric group of degree n no less than 2 generated by all transpositions is integral. We find the spectrum of a Cayley graph over the alternating group of degree n no less than 4 with a generating set of 3-cycles of the form (k i j) with fixed k, as {−n+1, 1−n+1, 22 −n+1, …, (n−1)2 −n+1}.


1999 ◽  
Vol 60 (2) ◽  
pp. 177-189 ◽  
Author(s):  
K.W. Gruenberg ◽  
L.G. Kovács

Let G be a finite group, F a free group of finite rank, R the kernel of a homomorphism φ of F onto G, and let [R, F], [R, R] denote mutual commutator subgroups. Conjugation in F yields a G-module structure on R/[R, R] let dg(R/[R, R]) be the number of elements required to generate this module. Define d(R/[R, F]) similarly. By an earlier result of the first author, for a fixed G, the difference dG(R/[R, R]) − d(R/[R, F]) is independent of the choice of F and φ; here it is called the proficiency gap of G. If this gap is 0, then G is said to be proficient. It has been more usual to consider dF(R), the number of elements required to generate R as normal subgroup of F: the group G has been called efficient if F and φ can be chosen so that dF(R) = dG(R/[R, F]). An efficient group is necessarily proficient; but (though usually expressed in different terms) the converse has been an open question for some time.


Filomat ◽  
2017 ◽  
Vol 31 (16) ◽  
pp. 5323-5334 ◽  
Author(s):  
Asma Hamzeh ◽  
Ali Ashrafi

Let G be a finite group. The power graph P(G) and its main supergraph S(G) are two simple graphs with the same vertex set G. Two elements x,y ? G are adjacent in the power graph if and only if one is a power of the other. They are joined in S(G) if and only if o(x)|o(y) or o(y)|o(x). The aim of this paper is to compute the characteristic polynomial of these graph for certain finite groups. As a consequence, the spectrum and Laplacian spectrum of these graphs for dihedral, semi-dihedral, cyclic and dicyclic groups were computed.


10.37236/683 ◽  
2011 ◽  
Vol 18 (1) ◽  
Author(s):  
Larry Cusick ◽  
Oscar Vega

Given $k\in \mathbb{N}$ and a finite group $G$, it is shown that $G$ is isomorphic to a subgroup of the group of symmetries of some $n$-cube in such a way that $G$ acts freely on the set of $k$-faces, if and only if, $\gcd(k, |G|)=2^s$ for some non-negative integer $s$. The proof of this result is existential but does give some ideas on what $n$ could be.


Author(s):  
D. R. Taunt

It is well known that a characteristically-simple finite group, that is, a group having no characteristic subgroup other than itself and the identity subgroup, must be either simple or the direct product of a number of isomorphic simple groups. It was suggested to the author by Prof. Hall that finite groups possessing exactly one proper characteristic subgroup would repay attention. We shall call a finite group having a unique proper characteristic subgroup a ‘UCS group’. In the present paper we first give some results on direct products of isomorphic UCS groups, and then we consider in more detail one of the types of UCS groups which can exist, that consisting of groups whose orders are divisible by exactly two distinct primes.


2017 ◽  
Vol 15 (1) ◽  
pp. 1440-1449 ◽  
Author(s):  
Xuanlong Ma ◽  
Ruiqin Fu ◽  
Xuefei Lu ◽  
Mengxia Guo ◽  
Zhiqin Zhao

Abstract The power graph of a finite group is the graph whose vertex set is the group, two distinct elements being adjacent if one is a power of the other. The enhanced power graph of a finite group is the graph whose vertex set consists of all elements of the group, in which two vertices are adjacent if they generate a cyclic subgroup. In this paper, we give a complete description of finite groups with enhanced power graphs admitting a perfect code. In addition, we describe all groups in the following two classes of finite groups: the class of groups with power graphs admitting a total perfect code, and the class of groups with enhanced power graphs admitting a total perfect code. Furthermore, we characterize several families of finite groups with power graphs admitting a perfect code, and several other families of finite groups with power graphs which do not admit perfect codes.


Sign in / Sign up

Export Citation Format

Share Document