On p-CAP-subgroups of finite groups

Suppose that G is a finite group and H is a subgroup of G. H is said to be a p-CAP-subgroup of G if H either covers or avoids each pd-chief factor of G. We give some characterizations for a group G to be p-solvable under the assumption that some subgroups of G are p-CAP-subgroups of G.     

Regular automorphisms of order p2

Let G be a group, and let α be a regular automorphism of order p² of G, where p is a prime. If G is polycyclic-by-finite and the map ϕ : G →G defined by g^ϕ= [g,α] is surjective, then G is soluble. If G is polycyclic, then C_G(α^p) and G/[G,α^p] are both nilpotent-by-finite.     

Set to set broadcasting in communication networks

Suppose G = (V,E) is a graph whose vertices represent people and edges represent telephone lines between pairs of people. Each person knows a unique message and is ignorant of the messages of other people at the beginning. These messages are then spread by telephone calls. In each call, two people exchange all information they have so far in exactly one unit of time. Suppose A and B are two nonempty subsets of V. The main purpose of this paper is to study the minimum number b(A,B,G) of telephone calls by which A broadcasts to B; and the minimum time t(A,B,G) such that A broadcasts to B. In particular, we give an exact formula for b(A,B,K_n) and linear-time algorithms for computing b(A,B,T) and t(A,B,T) of a tree T.     

Measurable n-sensitivity and maximal pattern entropy

We introduce the notion of measurable n-sensitivity for measure preserving systems, and study the relation between measurable n-sensitivity and the maximal pattern entropy. We prove that, if (X, B, µ, T) is ergodic, then (X, B, µ, T) is measurable n-sensitive but not measurable (n+1)-sensitive if and only if h_µ^*(T) = log n, where h_µ^* (T) is the maximal pattern entropy of T.     

A new way of counting the column-convex polyominoes by perimeter

We introduce a new class of plane figures: the sequences of tailed column-convex polyominoes (for short: stapoes). Let G(x, y) and I(x, y) denote the perimeter generating functions for column-convex polyominoes and stapoes, respectively. It will be clear from the definitions that G(x, y) is a simple fraction of I(x, y). But this latter function can be DSV-computed by solving just one quadratic equation (and not a system of quadratic equations). Thus the formula for G(x, y) can be obtained with ease.     

Conjugate processes and the silumation of ruin problems

A general methods is developed for giving simulation estimates of boundary crossing probabilities for processes related to random walks in discreate or continuous time. Particular attention is given to the probability ψ(u, T of ruin before time T in cpumpound Poisson risk processes. When the provbabi;ity law P governing the given process is imbedded in an exponentaial family (P_gq), one can write ψ (u, T) + _θR_gq for certain random variables R_gq given by Wald's fundamental identity. Using this to simulate from P_gq rather than P, it is possible not only to overcome the difficulties connected with the case T =∞, but also to obtain a considerable variance reduction.It is shown that the solution of the Lundberg equation determines the asymptotically optimal value of θ in heavy traffic when T = ∞, and some results guidelining the choice of θ when T > ∞ are also given. The potential of the method in different is illustrated by two examples.     

Recurrence of Transitive Points in Dynamical Systems with the Specification Property

Let T:X → X be a continuous map of a compact metric space X. A point x ∈ X is called Banach recurrent point if for all neighborhood V of x, {n ∈ N:Tⁿ(x) ∈ V } has positive upper Banach density. Denote by Tr(T), W(T), QW(T) and BR(T) the sets of transitive points, weakly almost periodic points, quasi-weakly almost periodic points and Banach recurrent points of (X, T). If (X, T) has the specification property, then we show that every transitive point is Banach recurrent and ∅≠W(T) ∩ Tr(T) _≠^⊂W^*(T) ∩ Tr(T) _≠^⊂ QW(T) ∩ Tr(T) _≠^⊂ BR(T) ∩ Tr(T), in which W^*(T) is a recurrent points set related to an open question posed by Zhou and Feng. Specifically the set Tr(T) ∩ W^*(T)\W(T) is residual in X. Moreover, we construct a point x ∈ BR\QW in symbol dynamical system, and demonstrate that the sets W(T), QW(T) and BR(T) of a dynamical system are all Borel sets.     

Nonsolvable groups whose irreducible character degrees have special 2-parts

Let G be a nonsolvable group and Irr(G) the set of irreducible complex characters of G. We consider the nonsolvable groups whose character degrees have special 2-parts and prove that if χ(1)₂ = 1 or |G|₂ for every χ ∈ Irr(G), then there exists a minimal normal subgroup N of G such that N ≅ PSL(2, 2ⁿ) and G/N is an odd order group.     

THE SPHERICAL FUNCTIONS AND THE CENTRAL LIMIT THEOREM ON SU（2,2）/S（U（2） × U（2））

Let G = SU（2, 2）, K = S（U（2） × U（2））, and for l ∈ Z, let {Tl}l∈z be a one-dimensional K-type and let El be the line bundle over G/K associated to Tl. It is shown that the Tl-spherical function on G is given by the hypergeometric functions of several variables. By applying this result, a central limit theorem for the space G/K is obtained.     

Decomposition of a rational matrix into partial fractions

In this paper a technique is developed for the expansion of a rational matrix F(λ)=G(λ)L^-1(λ)(orF(λ)=L^-1(λ)G(λ)into block partial fractions when the denominator has multiple roots. The method consists in the construction of interpolating matrix polynomials and their properties. Moreover, the approach is extended when L(λ) has nonlinear divisors.     

Zagreb indices of graphs

The first Zagreb index M₁(G) is equal to the sum of squares of the degrees of the vertices, and the second Zagreb index M₂(G) is equal to the sum of the products of the degrees of pairs of adjacent vertices of the underlying molecular graph G. In this paper, we obtain lower and upper bounds on the first Zagreb index M₁(G) of G in terms of the number of vertices (n), number of edges (m), maximum vertex degree (Δ), and minimum vertex degree (δ). Using this result, we find lower and upper bounds on M₂(G). Also, we present lower and upper bounds on M₂(G) +M₂(G) in terms of n, m, Δ, and δ, where G denotes the complement of G. Moreover, we determine the bounds on first Zagreb coindex M₁(G) and second Zagreb coindex M₂(G). Finally, we give a relation between the first Zagreb index and the second Zagreb index of graph G.     

OD-Characterization of certain four dimensional linear groups with related results concerning degree patterns

The prime graph of a finite group G, which is denoted by GK(G), is a simple graph whose vertex set is comprised of the prime divisors of |G| and two distinct prime divisors p and q are joined by an edge if and only if there exists an element of order pq in G. Let p₁2<?<p_k be all prime divisors of |G|. Then the degree pattern of G is defined as D(G) = (degG(p₁), degG(p₂), ? , degG(p_k)), where degG(p) signifies the degree of the vertex p in GK(G). A finite group H is said to be OD-characterizable if G? H for every finite group G such that |G| = |H| and D(G) = D(H). The purpose of this article is threefold. First, it finds sharp upper and lower bounds on ?(G), the sum of degrees of all vertices in GK(G), for any finite group G (Theorem 2.1). Second, it provides the degree of vertices 2 and the characteristic p of the base field of any finite simple group of Lie type in their prime graphs (Propositions 3.1-3.7). Third, it proves the linear groups L₄(q), q = 19, 23, 27, 29, 31, 32, and 37, are OD-characterizable (Theorem 4.2).     

A Note on Asymptotic Class Number Upper Bounds in p-adic Lie Extensions

Let p be an odd prime and F_∞ a p-adic Lie extension of a number field F with Galois group G. Suppose that G is a compact pro-p p-adic Lie group with no torsion and that it contains a closed normal subgroup H such that G/H ≅Z_p. Under various assumptions, we establish asymptotic upper bounds for the growth of p-exponents of the class groups in the said p-adic Lie extension. Our results generalize a previous result of Lei, where he established such an estimate under the assumption that H ≅Z_p.     

覆盖数不超过3的图上渡河问题

1000多年前,英国著名学者Alcuin曾提出一个古老的渡河问题,即狼、羊和卷心菜的渡河问题。2006年,Prisner把该问题推广到任意的冲突图上,考虑了一类情况更一般的渡河运输问题。所谓冲突图是指一个图G=(V,E),这里V代表某些物品的集合,V中的两个点有边连结当且仅当这两个点是冲突的,即在无人监管的情况下不允许留在一起的点。图G=(V,E)的一个可行运输方案是指在保证不发生任何冲突的前提下,把V的点所代表的物品全部摆渡到河对岸的一个运输方案。图G的Alcuin数定义为它存在可行运输方案时所需船的最小容量。本文讨论了覆盖数不超过3的连通图的Alcuin数,给出了该类图Alcuin数的完全刻画。     

Nonchordal positive semidefinite stochastic matrices

Let K_nbe the convex set of n×npositive semidefinite doubly stochastic matrices. If Aε k_n, the graph of A,G(A), is the graph on n vertices with (i,j) an edge if a_ij ≠ 0i≠ j. We are concerned with the extreme points in K_n. In many cases, the rank of Aand G(A) are enough to determine whether A is extreme in K_n. This is true, in particular, if G(A)is a special kind of nonchordal graph, i.e., if no two cycles in G(A)have a common edge.     

Extensions of n-Hom Lie algebras

n-Hom Lie algebras are twisted by n-Lie algebras by means of twisting maps. n-Hom Lie algebras have close relationships with statistical mechanics and mathematical physics. The paper main concerns structures and representations of n-Hom Lie algebras. The concept of n_ρ-cocycle for an n-Hom Lie algebra (G, [,… , ], α) related to a G-module (V, ρ, β) is proposed, and a sufficient condition for the existence of the dual representation of an n-Hom Lie algebra is provided. From a G-module (V, ρ, β) and an n_ρ-cocycle θ, an n-Hom Lie algebra (T_θ(V ), [, … , ]θ, γ) is constructed on the vector space T_θ(V ) = G⊕V, which is called the T_θ-extension of an n-Hom Lie algebra (G, [, … , ], α) by the G-module (V, ρ, β).     

多扇图的Pebbling数和Graham猜想

图G的pebbling数f(G)是最小的整数n,使得不论n个pebble如何放置在G的顶点上,总可以通过一系列的pebbling移动把1个pebble移到任意一个顶点上,其中一个pebbling移动是从一个顶点处移走两个pebble而把其中的一个移到与其相邻的一个顶点上。Graham猜想对于任意的连通图G和H有f(G×H)f(G)f(H)。多扇图F_n1,n2,…,nm是指阶为n₁+n₂+…+n_m+1的联图P₁∨(P_n1∪P_n2∪…∪P_nm)。本文首先给出了多扇图的pebbling数,然后证明了多扇图F_n1,n2,…,nm具有2-pebbling性质,最后论述了对于一个多扇图和一个具有2-pebbling性质的图的乘积来说,Graham猜想是成立的。作为一个推论,当G和H都是多扇图时,Graham猜想成立。     

Explicit construction of graphs with an arbitrary large girth and of large size

Let k 3 be a positive odd integer and 1 be a power of a prime. In this paper we give an explicit construction of a q-regular bipartite graph on v = 2q^k vertices with girth g k + 5. The constructed graph is the incidence graph of a flag-transitive semiplane. For any positive integer t we also give an example of a q = 2^t-regular bipartite graph on v = 2q^{k + 1} vertices with girth g k + 5 which is both vertex-transitive and edge-transitive.     

A linear time algorithm for edge coloring of binomial trees

We consider the problem of efficient coloring of the edges of a so-called binomial tree T, i.e. acyclic graph containing two kinds of edges: those which must have a single color and those which are to be colored with L consecutive colors, where L is an arbitrary integer greater than 1. We give an O(n) time algorithm for optimal coloring of such a tree, where n is the number of vertices of T. Also, we give simple bounds on the chromatic index of T and a division of all binomial trees into two classes depending on their chromaticity.