On a co-induction question of Kechris

This note answers a question of Kechris: if H < G is a normal subgroup of a countable group G, H has property MD and G/H is amenable and residually finite, then G also has property MD. Under the same hypothesis we prove that for any action a of G, if b is a free action of G/H, and b _G is the induced action of G, then CInd _H ^G (a|H) × b _G weakly contains a. Moreover, if H < G is any subgroup of a countable group G, and the action of G on G/H is amenable, then CInd _H ^G (a|H) weakly contains a whenever a is a Gaussian action.     

On ideals in the bidual of the Fourier algebra and related algebras

Let G be a compact nonmetrizable topological group whose local weight b(G) has uncountable cofinality. Let H be an amenable locally compact group, A(G×H) the Fourier algebra of G×H, and UC₂(G×H) the space of uniformly continuous functionals in VN(G×H)=A^∗(G×H). We use weak factorization of operators in the group von Neumann algebra VN(G×H) to prove that there exist at least ²b(G)² left ideals of dimensions at least ²b(G)² in A(G×H)^∗∗ and in UC₂^∗(G×H). We show that every nontrivial right ideal in A(G×H)^∗∗ and in UC₂^∗(G×H) has dimension at least ²b(G)².     

Centralizers of coprime automorphisms of finite groups

Let A be an elementary abelian group of order p ^k with k ≥ 3 acting on a finite p′-group G. The following results are proved. If γ _k-2(C _G (a)) is nilpotent of class at most c for any ${a \in A^{\#}}$ , then γ _k-2(G) is nilpotent and has {c, k, p}-bounded nilpotency class. If, for some integer d such that 2 ^d  + 2 ≤ k, the dth derived group of C _G (a) is nilpotent of class at most c for any ${a \in A^{\#}}$ , then the dth derived group G ^(d) is nilpotent and has {c, k, p}-bounded nilpotency class.     

On the signless Laplacian spectral characterization of the line graphs of T-shape trees

A graph is determined by its signless Laplacian spectrum if no other nonisomorphic graph has the same signless Laplacian spectrum (simply G is DQS). Let T (a, b, c) denote the T-shape tree obtained by identifying the end vertices of three paths P _a+2, P _b+2 and P _c+2. We prove that its all line graphs L(T(a, b, c)) except L(T(t, t, 2t+1)) (t ? 1) are DQS, and determine the graphs which have the same signless Laplacian spectrum as L(T(t, t, 2t + 1)). Let µ₁(G) be the maximum signless Laplacian eigenvalue of the graph G. We give the limit of µ₁(L(T(a, b, c))), too.     

On the finite prime spectrum minimal groups

Let G be a finite group. The set of all prime divisors of the order of G is called the prime spectrum of G and is denoted by π(G). A group G is called prime spectrum minimal if π(G) ≠ π(H) for any proper subgroup H of G. We prove that every prime spectrum minimal group all of whose nonabelian composition factors are isomorphic to the groups from the set {PSL ₂(7), PSL ₂(11), PSL ₅(2)} is generated by two conjugate elements. Thus, we extend the corresponding result for finite groups with Hall maximal subgroups. Moreover, we study the normal structure of a finite prime spectrum minimal group with a nonabelian composition factor whose order is divisible by exactly three different primes.     

Groups Satisfying the Two-Prime Hypothesis with a Composition Factor Isomorphic to PSL<Subscript>2</Subscript>(<Emphasis Type="Italic">q</Emphasis>) for <Emphasis Type="Italic">q</Emphasis> ⩾ 7

Let G be a finite group and write cd(G) for the degree set of the complex irreducible characters of G. The group G is said to satisfy the two-prime hypothesis if for any distinct degrees a, b 2 cd(G), the total number of (not necessarily different) primes of the greatest common divisor gcd(a, b) is at most 2. We prove an upper bound on the number of irreducible character degrees of a nonsolvable group that has a composition factor isomorphic to PSL₂(q) for q ? 7.     

Two-point Taylor expansions in the asymptotic approximation of double integrals. Application to the second and fourth Appell functions

The main difficulty in Laplace's method of asymptotic expansions of double integrals is originated by a change of variables. We consider a double integral representation of the second Appell function F₂(a,b,b^′,c,c^′;x,y) and illustrate, over this example, a variant of Laplace's method which avoids that change of variables and simplifies the computations. Essentially, the method only requires a Taylor expansion of the integrand at the critical point of the phase function. We obtain in this way an asymptotic expansion of F₂(a,b,b^′,c,c^′;x,y) for large b, b^′, c and c^′. We also consider a double integral representation of the fourth Appell function F₄(a,b,c,d;x,y). We show, in this example, that this variant of Laplace's method is uniform when two or more critical points coalesce or a critical point approaches the boundary of the integration domain. We obtain in this way an asymptotic approximation of F₄(a,b,c,d;x,y) for large values of a,b,c and d. In this second example, the method requires a Taylor expansion of the integrand at two points simultaneously. For this purpose, we also investigate in this paper Taylor expansions of two-variable analytic functions with respect to two points, giving Cauchy-type formulas for the coefficients of the expansion and details about the regions of convergence.     

The forcing hull and forcing geodetic numbers of graphs

For every pair of vertices u,v in a graph, a u-v geodesic is a shortest path from u to v. For a graph G, let I_G[u,v] denote the set of all vertices lying on a u-v geodesic. Let S⊆V(G) and I_G[S] denote the union of all I_G[u,v] for all u,v∈S. A subset S⊆V(G) is a convex set of G if I_G[S]=S. A convex hull [S]_G of S is a minimum convex set containing S. A subset S of V(G) is a hull set of G if [S]_G=V(G). The hull number h(G) of a graph G is the minimum cardinality of a hull set in G. A subset S of V(G) is a geodetic set if I_G[S]=V(G). The geodetic number g(G) of a graph G is the minimum cardinality of a geodetic set in G. A subset F⊆V(G) is called a forcing hull (or geodetic) subset of G if there exists a unique minimum hull (or geodetic) set containing F. The cardinality of a minimum forcing hull subset in G is called the forcing hull number f_h(G) of G and the cardinality of a minimum forcing geodetic subset in G is called the forcing geodetic number f_g(G) of G. In the paper, we construct some 2-connected graph G with (f_h(G),f_g(G))=(0,0),(1,0), or (0,1), and prove that, for any nonnegative integers a, b, and c with a+b≥2, there exists a 2-connected graph G with (f_h(G),f_g(G),h(G),g(G))=(a,b,a+b+c,a+2b+c) or (a,2a+b,a+b+c,2a+2b+c). These results confirm a conjecture of Chartrand and Zhang proposed in [G. Chartrand, P. Zhang, The forcing hull number of a graph, J. Combin. Math. Combin. Comput. 36 (2001) 81-94].     

A note on the weakly convex and convex domination numbers of a torus

The distanced_G(u,v) between two vertices u and v in a connected graph G is the length of the shortest (u,v) path in G. A (u,v) path of length d_G(u,v) is called a (u,v)-geodesic. A set X⊆V is called weakly convex in G if for every two vertices a,b∈X, exists an (a,b)-geodesic, all of whose vertices belong to X. A set X is convex in G if for all a,b∈X all vertices from every (a,b)-geodesic belong to X. The weakly convex domination number of a graph G is the minimum cardinality of a weakly convex dominating set of G, while the convex domination number of a graph G is the minimum cardinality of a convex dominating set of G. In this paper we consider weakly convex and convex domination numbers of tori.     

Commuting and centralizing generalized derivations on lie ideals in prime rings

Let R be a noncommutative prime ring of characteristic different from 2, U the Utumi quotient ring of R, C the extended centroid of R, and L a noncentral Lie ideal of R. If F and G are generalized derivations of R and k ≥1 a fixed integer such that [F(x), x] _k x ? x[G(x), x] _k = 0 for any x ∈ L, then one of the following holds:

1. either there exists an a ∈ U and an α ∈ C such that F(x) = xa and G(x) = (a + α)x for all x ∈ R
2. or R satisfies the standard identity s ₄(x ₁, …, x ₄) and one of the following conclusions occurs

1. there exist a, b, c, q ∈ U, such that a ?b + c ?q ∈ C and F(x) = ax + xb, G(x) = cx + xq for all x ∈ R
2. there exist a, b, c ∈ U and a derivation d of U such that F(x) = ax+d(x) andG(x) = bx+xc?d(x) for all x ∈ R, with a + b ? c ∈ C.

     

On constant discrete programming problems

Let H be a subset of the set S_n of all permutations

$\text{1}\text{2}\text{???}\text{n}\text{s(1)}\text{s(2)}\text{???}\text{s(n)}$

C=6c_ij6 a real n?n matrix L_c(s)=c_1s(1)+c_2s(2)+???+c_ns(n) for s ? H. A pair (H, C) is the existencee of reals a₁,b₁,a₂,b₂,…a_n,b_n, for which c_ij=a₁+b_j if (i,j)?D(H), where D(H)={(i,j):(?h?H)(j=h(i))}.For a pair (H,C) the specifity of it is proved in the case, when H is either a special cyclic class of permutations or a special union of cyclic classes. Specific pairs with minimal sets H are in some sense described.     

Eigenvalues of a graph and its imbeddings

A graph H is imbedded in a graph G if a subset of the vertices of G determines a subgraph isomorphic to H. If λ(G) is the least eigenvalue of G and k_R(H) = lim sup_d→∞ {λ(G)| H imbedded in G; G regular and connected; diam(G) > d; deg(G) > d}, then λ(H) ? 2 ≤ k_R(H) ≤ λ(H) with these bounds being the best possible. Given a graph H, there exist arbitrarily large families of isospectral graphs such that H can be imbedded in each member of the family.     

The fundamental constituents of iteration digraphs of finite commutative rings

For a finite commutative ring R and a positive integer k ? 2, we construct an iteration digraph G(R, k) whose vertex set is R and for which there is a directed edge from a ∈ R to b ∈ R if b = a ^k . Let R = R ₁ ⊕ … ⊕ R _s , where s > 1 and R _i is a finite commutative local ring for i ∈ {1, …, s}. Let N be a subset of {R ₁, …, R _s } (it is possible that N is the empty set \(\not 0\) ). We define the fundamental constituents G _N ^* (R, k) of G(R, k) induced by the vertices which are of the form {(a ₁, …, a _s ) ∈ R: a _i ∈ D(R _i ) if R _i ∈ N, otherwise a _i ∈ U(R _i ), i = 1, …, s}, where U(R) denotes the unit group of R and D(R) denotes the zero-divisor set of R. We investigate the structure of G* _N (R, k) and state some conditions for the trees attached to cycle vertices in distinct fundamental constituents to be isomorphic.     

Spaces of maps into topological group with the Whitney topology

Let X be a locally compact Polish space and G a non-discrete Polish ANR group. By C(X,G), we denote the topological group of all continuous maps endowed with the Whitney (graph) topology and by Cc(X,G) the subgroup consisting of all maps with compact support. It is known that if X is compact and non-discrete then the space C(X,G) is an l₂-manifold. In this article we show that if X is non-compact and not end-discrete then Cc(X,G) is an (R^∞×l₂)-manifold, and moreover the pair (C(X,G),Cc(X,G)) is locally homeomorphic to the pair of the box and the small box powers of l₂.     

The Hosoya polynomial decomposition for catacondensed benzenoid graphs

For a graph G with the vertex set V(G), we denote by d(u,v) the distance between vertices u and v in G, by d(u) the degree of vertex u. The Hosoya polynomial of G is H(G)=∑_{u,v}⊆V(G)x^d(u,v). The partial Hosoya polynomials of G are for positive integer numbers m and n. It is shown that H(G₁)−H(G₂)=x²(x+1)²(H₃₃(G₁)−H₃₃(G₂)),H₂₂(G₁)−H₂₂(G₂)=(x²+x−1)²(H₃₃(G₁)−H₃₃(G₂)) and H₂₃(G₁)−H₂₃(G₂)=2(x²+x−1)(H₃₃(G₁)−H₃₃(G₂)) for arbitrary catacondensed benzenoid graphs G₁ and G₂ with equal number of hexagons. As an application, we give an affine relationship between H(G) with two other distance-based polynomials constructed by Gutman [I. Gutman, Some relations between distance-based polynomials of trees, Bulletin de l’Académie Serbe des Sciences et des Arts (Cl. Math. Natur.) 131 (2005) 1-7].     

Distance graphs with maximum chromatic number

The distance graph G(D) has the set of integers as vertices and two vertices are adjacent in G(D) if their difference is contained in the set D⊂Z. A conjecture of Zhu states that if the chromatic number of G(D) achieves its maximum value |D|+1 then the graph has a triangle. The conjecture is proven to be true if |D|?3. We prove that the chromatic number of a distance graph with D={a,b,c,d} is five only if either D={1,2,3,4k} or D={a,b,a+b,b-a}. This confirms a stronger version of Zhu's conjecture for |D|=4, namely, if the chromatic number achieves its maximum value then the graph contains K₄.     

On finite simple images of triangle groups

For a simple algebraic group G in characteristic p, a triple (a, b, c) of positive integers is said to be rigid for G if the dimensions of the subvarieties of G of elements of order dividing a, b, c sum to 2 dim G. In this paper we complete the proof of a conjecture of the third author, that for a rigid triple (a, b, c) for G with p > 0, the triangle group T_a,b,c has only finitely many simple images of the form G(p^r). We also obtain further results on the more general form of the conjecture, where the images G(p^r) can be arbitrary quasisimple groups of type G.     

Wide diameter of Cartesian graph bundles

Fault tolerance and transmission delay of networks are important concepts in network design. The notions are strongly related to connectivity and diameter of a graph, and have been studied by many authors. Wide diameter of a graph combines studying connectivity with the diameter of a graph. Diameter with width k of a graph G, k-diameter, is defined as the minimum integer d for which there exist at least k internally disjoint paths of length at most d between any two distinct vertices in G. Denote by D_c(G) the c-diameter of G and κ(G) the connectivity of G. In the context of computer networks, wide diameters of Cartesian graph products have been recently studied by many authors. Cartesian graph bundles is a class of graphs that is a generalization of the Cartesian graph products. Let G be a Cartesian graph bundle with fiber F over base B, 0<a≤κ(F), and 0<b≤κ(B). We prove that D_a+b(G)≤D_a(F)+D_b(B)+1. Moreover, if G is a graph bundle with fiber F≠K₂ over base B≠K₂, then D_a+b(G)≤D_a(F)+D_b(B). The bounds are tight.     

A characterization of the simple group PSL<Subscript>5</Subscript>(5) by the set of its element orders

Let G be a finite group and let ω(G) denote the set of the element orders of G. For the simple group PSL₅(5) we prove that if G is a finite group with ω(G) = ω(PSL₅(5)), then either G ? PSL₅(5) or G ? PSL₅(5): 〈θ〉 where θ is a graph automorphism of PSL₅(5) of order 2.     

On subgroups of the general linear group that contain a maximal nonsplit torus

The paper deals with the structure of intermediate subgroups of the general linear group GL(n, k) of degree n over a field k of odd characteristic that contain a nonsplit maximal torus related to a radical extension of degree n of the ground field k. The structure of ideal nets over a ring that determine the structure of intermediate subgroups containinga transvection is given. Let K = k( ⁿ?{d} ) K = k\left( {\sqrt[n]{d}} \right) be a radical degree-n extension of a field k of odd characteristic, and let T =(d) be a nonsplit maximal torus, which is the image of the multiplicative group of the field K under the regular embedding in G =GL(n, k). In the paper, the structure of intermediate subgroups H, T ≤ H ≤ G, that contain a transvection is studied. The elements of the matrices in the torus T = T (d) generate a subring R(d) in the field k.Let R be an intermediate subring, R(d) ⊆ R ⊆ k, d ∈ R. Let σ_R denote the net in which the ideal dR stands on the principal diagonal and above it and all entries of which beneath the principal diagonal are equal to R. Let σ^R denote the net in which all positions on the principal diagonal and beneath it are occupied by R and all entries above the principal diagonal are equal to dR. Let E(σ_R) be the subgroup generated by all transvections from the net group G(σ_R). In the paper it is proved that the product TE(σ_R) is a group (and thus an intermediate subgroup). If the net σ associated with an intermediate subgroup H coincides with σ_R,then TE(σ_R) ≤ H ≤ N(σ_R),where N(σ_R) is the normalizer of the elementary net group E(σ_R) in G. For the normalizer N(σ_R),the formula N(σ_R)= TG(σ^R) holds. In particular, this result enables one to describe the maximal intermediate subgroups. Bibliography: 13 titles.