共查询到20条相似文献,搜索用时 31 毫秒
1.
2.
假设群A经自同构互素地作用在G上.设χ是G的一个A-不变不可约特征标,π(G,A)表示Glauberman-Isaacs特征标对映.对于B≤A,T.R.Wolf曾猜想χπ(G,A)是χπ(G,B)a的一个不可约成份,此处C=CG(A).设G=N(X)H且(|N|,|H|)=1,假定H是A-不变的且N是一个Sylow塔群,N的Sylow-子群是交换的.在本文中,我们证明了如果这个猜想对所有H的A-不变子群成立,则猜想对G也成立. 相似文献
3.
设A是有限维Hopf C-代数,H是Hilbert空间.如果存在A在L(H)上的作用γ,在此作用下,L(H)成为具有共轭性质的模代数且H上内积是A-不变的,则A存在惟一的C-表示(θ,H),L(H)的A-不变子空间恰好是θ(A)的换位子. 相似文献
4.
5.
Let a finite group \({G = AB}\) be the product of the mutually permutable subgroups A and B. We investigate the structure of G given by conditions on conjugacy class sizes of elements in \({A \cup B}\) . Some recent results are extended. 相似文献
6.
设G是有限群,Ns(G)表示G的子群共轭类长构成的集合.本文研究Ns(G)中只有两个元素时有限群G的结构,在非幂零情形时给出了G的完全分类,在幂零情形时获得了G的一些性质. 相似文献
7.
In this paper we characterize a class of finite planar spaces whose planes have two sizes.Dedicato alla memoria dell'amico e Maestro Giuseppe TalliniWork supported by G.N.S.A.G.A. of C.N.R. and the projects M.U.R.S.T. 40 % 相似文献
8.
Mathematical Notes - A graph $$D(G)$$ is called the divisibility graph of $$G$$ if its vertex set is the set of noncentral conjugacy class sizes of $$G$$ and there is an edge between vertices $$a$$... 相似文献
9.
S. A. Vagharshakyan 《Journal of Contemporary Mathematical Analysis (Armenian Academy of Sciences)》2007,42(5):254-257
The paper proves a new result similar to the well known theorems of G. Szego and A. Kolmogorov on the best approximation by analytic polynomials in weighted L p spaces. Such results are essential in prediction theory for stationary processes. It is well known, that for one step prediction, the size of the best approximation is the same for all p. The paper proves that for two step prediction the best approximation sizes are different for p = 2 and p = ∞. 相似文献
10.
Let \(G\) be a locally compact, Hausdorff, étale groupoid whose unit space is totally disconnected. We show that the collection \(A(G)\) of locally-constant, compactly supported complex-valued functions on \(G\) is a dense \(*\) -subalgebra of \(C_c(G)\) and that it is universal for algebraic representations of the collection of compact open bisections of \(G\) . We also show that if \(G\) is the groupoid associated to a row-finite graph or \(k\) -graph with no sources, then \(A(G)\) is isomorphic to the associated Leavitt path algebra or Kumjian–Pask algebra. We prove versions of the Cuntz–Krieger and graded uniqueness theorems for \(A(G)\) . 相似文献
11.
Suppose that G is a finite group and K is a non-trivial conjugacy class of G such that KK?1 = 1 ∪ D ∪ D?1 with D a conjugacy class of G. We prove that G is not a non-abelian simple group and we give arithmetical conditions on the class sizes determining the solvability and the structure of 〈K〉 and 〈D〉. 相似文献
12.
13.
Given a finite group \(G\) which possesses a non-abelian simple normal subgroup \(N\) having exactly four \(G\) -class sizes, we prove that \(N\) is isomorphic to PSL \((2, 2^a)\) with \(a\ge 2\) . Thus, we obtain an extension for normal subgroups of the classic N. Itô’s theorem which characterizes those finite simple groups with exactly four class sizes. 相似文献
14.
Qing Zhai FAN 《数学学报(英文版)》2020,36(3):337-362
We show that the following properties of the C^*-algebras in a class Ω are inherited by simple unital C-algebras in the class TAΩ:(1)(m,n)-decomposable,(2) weakly(m,n)-divisible,(3) weak Riesz interpolation.As an application,let A be an infinite dimensional simple unital C-algebra such that A has one of the above-listed properties.Suppose that α:G→Aut(A) is an action of a finite group G on A which has the tracial Rokhlin property.Then the crossed product C^*-algebra C^*(G,A,α) also has the property under consideration. 相似文献
15.
Let G be a group. We denote by \({\nu(G)}\) an extension of the non-abelian tensor square \({G \otimes G}\) by \({G \times G}\). We prove that if G is finite-by-nilpotent, then the non-abelian tensor square \({G \otimes G}\) is finite-by-nilpotent. Moreover, \({\nu(G)}\) is nilpotent-by-finite (Theorem A). Also we characterize BFC-groups in terms of \({\nu(G)}\) among the groups G in which the derived subgroup is finitely generated (Theorem B). 相似文献
16.
Steven Givant 《Discrete Mathematics》1975,12(2):201-204
We indicate certain connections between the rank and cardinality of a finite closure structure, and the relative sizes of its irredundant bases. A class of examples is described which shows that in general our theorem can not be strengthened. 相似文献
17.
Czechoslovak Mathematical Journal - Let N be a normal subgroup of a group G. The structure of N is given when the G-conjugacy class sizes of N is a set of a special kind. In fact, we give the... 相似文献
18.
We study how the average performance of a system degrades as the load nears its peak capacity. We restrict our attention to
the performance measures of average sojourn time and the large deviation rates of buffer overflow probabilities. We first
show that for certain queueing systems, the average sojourn time of requests depends much more weakly on the load ρ than the
commonly observed 1/(1−ρ) dependence for most queueing policies. For example, we show that for an M/G/1 system under the preemptive
Shortest Job First (pSJF) policy, the average sojourn time varies as log (1/(1−ρ)) with load for a certain class of distributions.
We observe that such results hold even for more restricted policies. We give some examples of non-preemptive policies and
policies that do not use the knowledge of job sizes while scheduling, where the dependence of average sojourn time on load
is significantly better than 1/(1−ρ). Similar results hold even for very simple non-preemptive threshold based policies that
partition all the jobs into two job classes based on a fixed threshold and do FIFO within each class. Finally we study the
large deviations rate of the queue length under a simple dedicated partition-based policy. 相似文献
19.
If \(A\) is a nontrivial torsion-free, locally cyclic group with no nontrivial divisible quotients, and \(G\) is the split extension of \(A\) by a group of order 2 acting on \(A\) by means of the inverting map, then \(G\simeq {{{\mathrm{Aut}}}G} \). We prove that in no other case the full automorphism group of a group is infinite and locally dihedral. 相似文献
20.
V. P. Il’ev S. D. Il’eva A. A. Navrotskaya 《Journal of Applied and Industrial Mathematics》2016,10(3):341-348
A graph clustering problem is under study (also known as the graph approximation problem) with a constraint on cluster sizes. Some new approximation algorithm is presented for this problem, and performance guarantee of the algorithm is obtained. It is shown that the problem belongs to the class APX for every fixed p, where p is the upper bound on the cluster sizes. 相似文献