Finite groups with some maximal subgroups of Sylow subgroups ℳ-supplemented

A subgroup H of a group G is said to be ?-supplemented in G if there exists a subgroup B of G such that G = HB and TB < G for every maximal subgroup T of H. In this paper, we obtain the following statement: Let ? be a saturated formation containing all supersolvable groups and H be a normal subgroup of G such that G/H ε ?. Suppose that every maximal subgroup of a noncyclic Sylow subgroup of F*(H), having no supersolvable supplement in G, is ?-supplemented in G. Then G ε ?.     

Finite groups with systems of Σ-embedded subgroups

In recent years,a series of papers about cover-avoiding property of subgroups appeared and all the studies were connected with chief factors of a finite group.However,about the cover-avoiding property of subgroups for non-chief factor,there is no study up to now.The purpose of this paper is to build the theory.Let A be a subgroup of a finite group G and Σ:G0≤G1≤…≤Gn some subgroup series of G.Suppose that for each pair(K,H) such that K is a maximal subgroup of H and G i 1 K < H G i for some i,either A ∩ H = ...     

Vertex-distinguishing E-total Coloring of Complete Bipartite Graph K_(7,n) when 7≤n≤95

Let G be a simple graph. A total coloring f of G is called an E-total coloring if no two adjacent vertices of G receive the same color, and no edge of G receives the same color as one of its endpoints. For an E-total coloring f of a graph G and any vertex x of G, let C(x) denote the set of colors of vertex x and of the edges incident with x, we call C(x) the color set of x. If C(u)≠ C(v) for any two different vertices u and v of V(G), then we say that f is a vertex-distinguishing E-total coloring of G or a VDET coloring of G for short. The minimum number of colors required for a VDET coloring of G is denoted by χ_(vt)~e(G) and is called the VDET chromatic number of G. The VDET coloring of complete bipartite graph K_(7,n)(7 ≤ n ≤ 95) is discussed in this paper and the VDET chromatic number of K_(7,n)(7 ≤ n ≤ 95) has been obtained.     

n(2≤n≤4)次方程的一种统一解法

研究普通代数方程的解法,借助矩阵理论,给出了三次代数方程的解法,把n次(2≤n≤4)方程的解的形式统一到了一起,解法思路简单,解的形式简洁.     

Intriguing Sets of Points of Q(2n, 2) \Q +(2n ? 1, 2)

Intriguing sets of vertices have been studied for several classes of strongly regular graphs. In the present paper, we study intriguing sets for the graphs Γ _n , n ≥ 2, which are defined as follows. Suppose Q(2n, 2), n?≥ 2, is a nonsingular parabolic quadric of PG(2n, 2) and Q ⁺(2n ? 1, 2) is a nonsingular hyperbolic quadric obtained by intersecting Q(2n, 2) with a suitable nontangent hyperplane. Then the collinearity relation of Q(2n, 2) defines a strongly regular graph Γ _n on the set Q(2n, 2) \ Q ⁺(2n ? 1, 2). We describe some classes of intriguing sets of Γ _n and classify all intriguing sets of Γ₂ and Γ₃.     

p~n(n≤4)阶capable群

一个群G能够充当另外一个群H的中商群,称群G是capable群.考虑的问题是:对于阶为p~n(n≤4)的p-群G,哪些群是capable群?完全决定了p~n(n≤4)阶的capable p-群G.     

K(π 1)'s for Artin Groups of Finite Type

We construct K( 1)'s for Artin groups of type C _n and D _n , using the lattice of elements preceding a Coxeter element in the partial order defined by reflection length.     

Models for CR-manifolds of type (1,K) for 3≤K≤7 and their automorphisms

Models similar to the tangent quadric are constructed for surfaces with one-dimensional complex tangent space. It is shown that these models possess the main properties of the tangent quadric. Their groups and algebras of automorphisms are found. Translated fromMatematicheskie Zametki, Vol. 67, No. 3, pp. 452–459, March, 2000.     

A Hyperplane Inequality for Measures of Convex Bodies in ? n , n≤4

Let 2≤n≤4. We show that for an arbitrary measure μ with even continuous density in ℝ ⁿ and any origin-symmetric convex body K in ℝ ⁿ ,

GLn(k)和SLn(k)的阶

本文利用矩阵行的初等变换 ,采用递推的方法 ,求出了有限域 k上 n次一般线性群 GLn(k)和 n次特殊线性群 SLn(k)的阶 .     

Chaos for Subshifts of Finite Type

This paper deals with chaos for subshifts of finite type. We show that for any subshift of finite type determined by an irreducible and aperiodic matrix, there is a finitely chaotic set with full Hausdorff dimension. Moreover, for any subshift of finite type determined by a matrix, we point out that the cases including positive topological entropy, distributional chaos, chaos and Devaney chaos are mutually equivalent.     

Overgroups of SU(n,K, f) or Ω(n,K, Q) in GL(n,K)

All the overgroups of SU(n, K, f) or (n, K, Q) in GL(n, K) are determined, for arbitrary division rings K and arbitrary forms f or Q with positive Witt indices.     

Finite Dimensional Lie Superalgebras W(m,n,t) and S(m,n,t) of Cartan Type

设Ｌ＝Ｗ或Ｓ，Ｆ是特征数大于２的域．本文证明了Ｆ上的有限维单李超代数Ｌ（ｍ，ｎ，ｔ）的自然滤过是不变的．进而得出了Ｌ（ｍ，ｎ，ｔ）与Ｌ（ｍ′，ｎ′，ｔ′）同构的充要条件是ｍ＝ｍ′，ｎ＝ｎ′和ｔｉ＝τ（ｔ′ｉ），ｉ＝１，２，…，ｍ，这里τ是｛１，２，…，ｍ｝的一个置换．     

Some Elements of Finite Order in K2Q

Let K2 be the Milnor functor and let Фn （x）∈ Q[X] be the n-th cyclotomic polynomial. Let Gn（Q） denote a subset consisting of elements of the form {a, Фn（a）}, where a ∈ Q^＊ and {, } denotes the Steinberg symbol in K2Q. J. Browkin proved that Gn（Q） is a subgroup of K2Q if n = 1,2, 3, 4 or 6 and conjectured that Gn（Q） is not a group for any other values of n. This conjecture was confirmed for n =2^T 3S or n = p^r, where p ≥ 5 is a prime number such that h（Q（ζp）） is not divisible by p. In this paper we confirm the conjecture for some n, where n is not of the above forms, more precisely, for n = 15, 21,33, 35, 60 or 105.     

Rankin-Selberg convolutions for GL(n)×GL(n) and GL(n)×GL(n-1) for principal series representations

Let k be a local field.Let Iνand I_ν′be smooth principal series representations of GL_n(k) and GL_n-1(k),respectively.The Rankin-Selberg integrals yield a continuous bilinear map I_ν×I_ν′→C with a certain invariance property.We study integrals over a certain open orbit that also yield a continuous bilinear map II_ν×I_ν′→C with the same invariance property and show that these integrals equal the Rankin-Selberg integrals up to a...     

Euclidean Subspaces of the Complex Spaces ℓp n Constructed by Orbits of Finite Subgroups of SU(m)

A group representation method is used to construct minimal isometric embeddings ₂ ² into ₈ ¹⁰ and ₁₀ ¹² over C. The second of them yields a tight 5-design in C ². The corresponding angle set contains some irrational numbers.