scholarly journals Some Families of Designs for Multistage Experiments: Mutually Balanced Youden Designs when the Number of Treatments is Prime Power or Twin Primes. I

1972 ◽  
Vol 43 (5) ◽  
pp. 1517-1527 ◽  
Author(s):  
A. Hedayat ◽  
E. Seiden ◽  
W. T. Federer
Keyword(s):  
Prime Power ◽  
Twin Primes

scholarly journals An infinite family of Williamson matrices

1977 ◽  
Vol 24 (2) ◽  
pp. 252-256 ◽  
Author(s):  
Edward Spence
Keyword(s):  
Prime Power ◽  
Hadamard Matrix ◽  
Infinite Family ◽  
Williamson Matrices

AbstractIn this paper the following result is proved. Suppose there exists a C-matrix of order n + 1. Then if n≡1 (mod 4) there exists a Hadamard matrix of order 2nr(n + 1), while if n≡3 (mod 4) there exists a Hadamard matrix of order nr(n + 1) for all r ≧0. If n≡1 (mod 4) is a prime power, the method is adapted to prove the existence of a Hadamard matrix of the Williamson type, of order 2nr(n + 1), for all r ≧0.

scholarly journals Certain locally nilpotent varieties of groups

2003 ◽  
Vol 67 (1) ◽  
pp. 115-119
Author(s):  
Alireza Abdollahi
Keyword(s):  
Prime Power ◽  
Power Exponent ◽  
Variety Of Groups ◽  
Periodic Groups ◽  
Locally Nilpotent

Let c ≥ 0, d ≥ 2 be integers and be the variety of groups in which every d-generator subgroup is nilpotent of class at most c. N.D. Gupta asked for what values of c and d is it true that is locally nilpotent? We prove that if c ≤ 2d + 2d−1 − 3 then the variety is locally nilpotent and we reduce the question of Gupta about the periodic groups in to the prime power exponent groups in this variety.

scholarly journals The energy of integral circulant graphs with prime power order

2011 ◽  
Vol 5 (1) ◽  
pp. 22-36 ◽  
Author(s):  
J.W. Sander ◽  
T. Sander
Keyword(s):  
Adjacency Matrix ◽  
Prime Power ◽  
Prime Power Order ◽  
Circulant Graph ◽  
Closed Formula ◽  
Circulant Graphs ◽  
Vertex Set

The energy of a graph is the sum of the moduli of the eigenvalues of its adjacency matrix. We study the energy of integral circulant graphs, also called gcd graphs. Such a graph can be characterized by its vertex count n and a set D of divisors of n such that its vertex set is Zn and its edge set is {{a,b} : a, b ? Zn; gcd(a-b, n)? D}. For an integral circulant graph on ps vertices, where p is a prime, we derive a closed formula for its energy in terms of n and D. Moreover, we study minimal and maximal energies for fixed ps and varying divisor sets D.

Space groups and groups of prime-power order II

1980 ◽  
Vol 35 (1) ◽  
pp. 203-209 ◽  
Author(s):  
H. Finken ◽  
J. Neub�ser ◽  
W. Plesken
Keyword(s):  
Prime Power ◽  
Prime Power Order ◽  
Space Groups

scholarly journals PSL(2, q) as an image of the extended modular group with applications to group actions on surfaces

1987 ◽  
Vol 30 (1) ◽  
pp. 143-151 ◽  
Author(s):  
David Singerman
Keyword(s):  
Free Product ◽  
Cyclic Group ◽  
Modular Group ◽  
Prime Power ◽  
Group Actions ◽  
Index 2 ◽  
Image Position

The modular group PSL(2, ℤ), which is isomorphic to a free product of a cyclicgroupof order 2 and a cyclic group of order 3, has many important homomorphic images. Inparticular, Macbeath [7] showed that PSL(2, q) is an image of the modular group if q ≠ 9. (Here, as usual, q is a prime power.) The extended modular group PGL(2, ℤ) contains PSL{2, ℤ) with index 2. It has a presentationthe subgroup PSL(2, ℤ) being generated by UV and VW.

On S-Quasinormal and C-Normal Subgroups of Prime Power Order in Finite Groups

2011 ◽  
Vol 18 (04) ◽  
pp. 685-692
Author(s):  
Xuanli He ◽  
Shirong Li ◽  
Xiaochun Liu
Keyword(s):  
Finite Group ◽  
Finite Groups ◽  
Prime Power ◽  
Maximal Subgroups ◽  
Prime Power Order ◽  
Normal Subgroups ◽  
A Finite Group

Let G be a finite group, p the smallest prime dividing the order of G, and P a Sylow p-subgroup of G with the smallest generator number d. Consider a set [Formula: see text] of maximal subgroups of P such that [Formula: see text]. It is shown that if every member [Formula: see text] of is either S-quasinormally embedded or C-normal in G, then G is p-nilpotent. As its applications, some further results are obtained.

On some punctured codes of ℤq-Simplex codes

2021 ◽  
pp. 2250012
Author(s):  
J. Prabu ◽  
J. Mahalakshmi ◽  
C. Durairajan ◽  
S. Santhakumar
Keyword(s):  
Prime Divisor ◽  
Weight Distribution ◽  
Linear Code ◽  
Prime Power ◽  
Punctured Codes ◽  
New Codes ◽  
Simplex Codes ◽  
Simplex Code ◽  
Partial Weight ◽  
Unit Formula

In this paper, we have constructed some new codes from [Formula: see text]-Simplex code called unit [Formula: see text]-Simplex code. In particular, we find the parameters of these codes and have proved that it is a [Formula: see text] [Formula: see text]-linear code, where [Formula: see text] and [Formula: see text] is a smallest prime divisor of [Formula: see text]. When rank [Formula: see text] and [Formula: see text] is a prime power, we have given the weight distribution of unit [Formula: see text]-Simplex code. For the rank [Formula: see text] we obtain the partial weight distribution of unit [Formula: see text]-Simplex code when [Formula: see text] is a prime power. Further, we derive the weight distribution of unit [Formula: see text]-Simplex code for the rank [Formula: see text] [Formula: see text].

Sign in / Sign up

Export Citation Format

Share Document