共查询到20条相似文献,搜索用时 0 毫秒
1.
We prove that the essential dimension and p-dimension of a p-group G over a field F containing a primitive p-th root of unity is equal to the least dimension of a faithful representation of G over F.
Mathematics Subject Classification (2000) 20G15; 14C35 相似文献
2.
Manoj K. Yadav 《Proceedings Mathematical Sciences》2008,118(1):1-11
We give a sufficient condition on a finite p-group G of nilpotency class 2 so that Aut
c
(G) = Inn(G), where Aut
c
(G) and Inn(G) denote the group of all class preserving automorphisms and inner automorphisms of G respectively. Next we prove that if G and H are two isoclinic finite groups (in the sense of P. Hall), then Aut
c
(G) ≃ Aut
c
(H). Finally we study class preserving automorphisms of groups of order p
5, p an odd prime and prove that Aut
c
(G) = Inn(G) for all the groups G of order p
5 except two isoclinism families. 相似文献
3.
Let A be a finitely generated abelian group. We describe the automorphism group Aut(A) using the rank of A and its torsion part p-part A
p
.
For a finite abelian p-group A of type (k
1, ..., k
n
), simple necessary and sufficient conditions for an n × n-matrix over integers to be associated with an automorphism of A are presented. Then, the automorphism group Aut(A) for a finite p-group A of type (k
1, k
2) is analyzed.
This work has begin during the visit of the second author to the Faculty of Mathematics and Computer Science, Nicolaus Copernicus
University during the period July 31–August 13, 2005. This visit was supported by the Nicolaus Copernicus University and a
grant from Cnpq. 相似文献
4.
Gustavo A. Fernández-Alcober 《Israel Journal of Mathematics》2007,162(1):75-79
Let G be a powerful finite p-group. In this note, we give a short elementary proof of the following facts for all i ≥ 0: (i) exp Ωi(G) ≤ p
i for odd p, and expΩi(G) ≤ 2
i+1 for p = 2; (ii) the index |G: G
p
i| coincides with the number of elements of G of order at most p
i.
Supported by the Spanish Ministry of Science and Education, grant MTM2004-04665, partly with FEDER funds, and by the University
of the Basque Country, grant UPV05/99. 相似文献
5.
Qin-hai ZHANG Cui-juan SUN Hai-peng QU & Ming-yao XU School of Mathematics Computer Sciences Shanxi Normal University Linfen China 《中国科学A辑(英文版)》2007,50(6):814-820
Following Blackburn, Deaconescu and Mann, a group G is called an equilibrated group if for any subgroups H,K of G with HK = KH, either H≤NG(K) or K≤NG(H). Continuing their work and based on the classification of metacyclic p-groups given by Newman and Xu, we give a complete classification of 2-generator equilibrated p-groups in this note. 相似文献
6.
Lawrence E. Wilson 《Israel Journal of Mathematics》2003,138(1):1-17
We prove that if the nilpotence class of ap-group is strictly less thanp
kthen every product ofp
k-thpowers can be written as thep-th power of an element. Scoppola and Shalev have proven the same thing for groups of class strictly less thanp
k−p
k−1. They also provide an example which proves that ours is the best possible result. This is a generalization of the well
known fact that in groups of class strictly less thanp every product ofp-powers is again ap-th power. Along the way we prove results of independent interest on dimension subgroups ofp-groups. 相似文献
7.
In this paper, we introduce p-ideals in semirings. A new form of regularity, which is compatible with p-ideals, is defined. Our aim is to explore the possibilities of establishing an ideal theory in semirings, going alongside the existing literature of semiring theory.AMS Subject Classification (2000): Primary 16Y60 相似文献
8.
In [1], we defined c(G), q(G) and p(G). In this paper we will show that if G is a p-group, where p is an odd prime and |G| ≤ p
4, then c(G) = q(G) = p(G). However, the question of whether or not there is a p-group G with strict inequality c(G) = q(G) < p(G) is still open. 相似文献
9.
Olof Heden 《Designs, Codes and Cryptography》2008,46(1):45-56
Let p be a prime number and assume p ≥ 5. We will use a result of L. Redéi to prove, that every perfect 1-error correcting code C of length p + 1 over an alphabet of cardinality p, such that C has a rank equal to p and a kernel of dimension p − 2, will be equivalent to some Hamming code H. Further, C can be obtained from H, by the permutation of the symbols, in just one coordinate position.
相似文献
10.
If (N,t) ({\cal N},\tau) is a finite von Neumann algebra and if (M,n) ({\cal M},\nu) is an infinite von Neumann algebra, then Lp(M,n) L_{p}({\cal M},\nu) does not Banach embed in Lp(N,t) L_{p}({\cal N},\tau) for all p ? (0,1) p\in (0,1) . We also characterize subspaces of $ L_{p}({\cal N},\tau),\ 0< p <1 $ L_{p}({\cal N},\tau),\ 0< p <1 containing a copy of lp. 相似文献
11.
12.
13.
Let G be a finite group. We define the prime graph Γ(G) as follows. The vertices of Γ(G) are the primes dividing the order of G and two distinct vertices p, q are joined by an edge if there is an element in G of order pq. Recently M. Hagie [5] determined finite groups G satisfying Γ(G) = Γ(S), where S is a sporadic simple group. Let p > 3 be a prime number. In this paper we determine finite groups G such that Γ(G) = Γ(PSL(2, p)). As a consequence of our results we prove that if p > 11 is a prime number and p ≢ 1 (mod 12), then PSL(2, p) is uniquely determined by its prime graph and so these groups are characterizable by their prime graph.
The third author was supported in part by a grant from IPM (No. 84200024). 相似文献
14.
A. L. Kuz’mina 《Russian Mathematics (Iz VUZ)》2008,52(7):8-14
We study Besicovitch-type spaces of generalized almost periodic functions. The main result is a theorem on representation of linear continuous functionals that is similar to the classical result of F. Riesz. 相似文献
15.
16.
Igor V. Dolgachev 《Proceedings of the Steklov Institute of Mathematics》2009,264(1):48-55
We show that the plane Cremona group over a field of characteristic p > 0 does not contain elements of order of power of p larger than 2. We also describe conjugacy classes of elements of order p
2.
To the memory of Vasily Iskovskikh 相似文献
17.
Tunay Bilgin 《Czechoslovak Mathematical Journal》2005,55(3):691-697
The definition of lacunary strongly convergence is extended to the definition of lacunary strong (A
σ
, p)-convergence with respect to invariant mean when A is an infinite matrix and p = (p
i
) is a strictly positive sequence. We study some properties and inclusion relations. 相似文献
18.
Bettina Eick 《Israel Journal of Mathematics》2008,166(1):157-166
We investigate the Schur multiplicators M(G) of p-groups G using coclass theory. For p > 2 we show that there are at most finitely many p-groups G of coclass r with |M(G)| ≤ s for every r and s. We observe that this is not true for p = 2 by constructing infinite series of 2-groups G with coclass r and |M(G)| = 1. We investigate the Schur multiplicators of the 2-groups of coclass r further. 相似文献
19.
We introduce and study an analog of p-groups in general scheme theory. It is proved that a scheme C is a p-scheme if and only if so is each homogeneous component of C. Moreover, the automorphism group of a p-scheme is a p-group, and the 2-orbit scheme of a permutation group G is a p-scheme
if and only if G is a p-group. Both of these assertions follow from the fact that the class of p-schemes is closed with respect
to extensions. Bibliography: 9 titles.
__________
Translated from Zapiski Nauchnykh Seminarov POMI, Vol. 344, 2007, pp. 190–202. 相似文献
20.
In this paper, we propose approximations to compute the steady-state performance measures of the M/GI/N+GI queue receiving Poisson arrivals with N identical servers, and general service and abandonment-time distributions. The approximations are based on scaling a single
server M/GI/1+GI queue. For problems involving deterministic and exponential abandon times distributions, we suggest a practical way to compute
the waiting time distributions and their moments using the Laplace transform of the workload density function. Our first contribution
is numerically computing the workload density function in the M/GI/1+GI queue when the abandon times follow general distributions different from the deterministic and exponential distributions.
Then we compute the waiting time distributions and their moments. Next, we scale-up the M/GI/1+GI queue giving rise to our approximations to capture the behavior of the multi-server system. We conduct extensive numerical
experiments to test the speed and performance of the approximations, which prove the accuracy of their predictions.
相似文献