Automorphisms of Hyperbolic Groups and Graphs of Groups

Using the canonical JSJ splitting, we describe the outer automorphism group Out(G) of a one-ended word hyperbolic group G. In particular, we discuss to what extent Out(G) is virtually a direct product of mapping class groups and a free abelian group, and we determine for which groups Out(G) is infinite. We also show that there are only finitely many conjugacy classes of torsion elements in Out(G), for G any torsion-free hyperbolic group. More generally, let Γ be a finite graph of groups decomposition of an arbitrary group G such that edge groups G_e are rigid (i.e. Out(G_e) is finite). We describe the group of automorphisms of G preserving Γ, by comparing it to direct products of suitably defined mapping class groups of vertex groups.     

Upper domination and upper irredundance perfect graphs

Let β(G), Γ(G) and IR(G) be the independence number, the upper domination number and the upper irredundance number, respectively. A graph G is called Γ-perfect if β(H) = Γ(H), for every induced subgraph H of G. A graph G is called IR-perfect if Γ(H) =IR(H), for every induced subgraph H of G. In this paper, we present a characterization of Γ-perfect graphs in terms of a family of forbidden induced subgraphs, and show that the class of Γ-perfect graphs is a subclass of IR-perfect graphs and that the class of absorbantly perfect graphs is a subclass of Γ-perfect graphs. These results imply a number of known theorems on Γ-perfect graphs and IR-perfect graphs. Moreover, we prove a sufficient condition for a graph to be Γ-perfect and IR-perfect which improves a known analogous result.     

Proximality and Equidistribution on the Furstenberg Boundary

Let G be a connected semisimple Lie group with finite center and without compact factors, P a minimal parabolic subgroup of G, and Γ a lattice in G. We prove that every Γ-orbits in the Furstenberg boundary G/P is equidistributed for the averages over Riemannian balls. The proof is based on the proximality of the action of Γ on G/P.*Partially supported by NSF grant 0400631. Mathematics Subject Classification (2000). 37B05, 22E40     

Strong characterizing sequences for subgroups of compact groups

In [A. Biró, V.T. Sós, Strong characterizing sequences in simultaneous Diophantine approximation, J. Number Theory 99 (2003) 405–414] we proved that if Γ is a subgroup of the torus R/Z generated by finitely many independent irrationals, then there is an infinite subset AZ which characterizes Γ in the sense that for γR/Z we have ∑_aAaγ<∞ if and only if γΓ. Here we consider a general compact metrizable Abelian group G instead of R/Z, and we characterize its finitely generated free subgroups Γ by subsets AG^*, where G^* is the Pontriagin dual of G. For this case we prove stronger forms of the analogue of the theorem of the above mentioned work, and we find necessary and sufficient conditions for a kind of strengthening of this statement to be true.     

Limit formulas of period integrals for a certain symmetric pair

Let G be the unitary group of a non-degenerate Hermitian space and H the stabilizer of a one-dimensional positive definite subspace of the Hermitian space. For a uniform lattice Γ in G such that Γ∩H is a uniform lattice of H, we introduce the (averaged) H-period integrals of automorphic forms on Γ G; we study their behavior as Γ shrinks to the identity along a tower of lattices in G and prove a limit formula of the H-period integrals.     

Local commensurability graphs of solvable groups

The commensurability index between two subgroups A,B of a group G is [A:A∩B][B:A∩B]. This gives a notion of distance among finite index subgroups of G, which is encoded in the p-local commensurability graphs of G. We show that for any metabelian group, any component of the p-local commensurabilty graph of G has diameter bounded above by 4. However, no universal upper bound on diameters of components exists for the class of finite solvable groups. In the appendix we give a complete classification of components for upper triangular matrix groups in GL(2,𝔽_q).     

Maximal 2-Local Geometries for the Symmetric Groups

Abstract

The set 𝒩_max (G, T) consisting of all maximal 2-local subgroups of G = Sym(n) which contain T, a Sylow 2-subgroup of G, is investigated. In addition to determining the structure of the subgroups in 𝒩_max (G, T), the simplicial sets of maximal rank are classified.     

K3,3-free intersection graphs of finite groups

The intersection graph of a group G is an undirected graph without loops and multiple edges defined as follows: the vertex set is the set of all proper non-trivial subgroups of G, and there is an edge between two distinct vertices H and K if and only if H∩K≠1 where 1 denotes the trivial subgroup of G. In this paper we classify all finite groups whose intersection graphs are K_3,3-free.     

Multiplicities of the integrable discrete series: The case of a nonuniform lattice in an R-rank one semisimple group

Let G be a noncompact connected simple Lie group of split-rank 1. Assume that G possesses a compact Cartan subgroup so that the discrete series for G is not empty. Let Γ be a nonuniform lattice in G. In this paper, we give an explicit formula for the multiplicity with which an integrable discrete series representation of G occurs in the space of cusp forms in L²(G/Γ).     

Positive circuits and maximal number of fixed points in discrete dynamical systems

We consider a product X of n finite intervals of integers, a map F from X to itself, the asynchronous state transition graph Γ(F) on X that Thomas proposed as a model for the dynamics of a network of n genes, and the interaction graph G(F) that describes the topology of the system in terms of positive and negative interactions between its n components. Then, we establish an upper bound on the number of fixed points for F, and more generally on the number of attractors in Γ(F), which only depends on X and on the topology of the positive circuits of G(F). This result generalizes the following discrete version of Thomas’ conjecture recently proved by Richard and Comet: If G(F) has no positive circuit, then Γ(F) has a unique attractor. This result also generalizes a result on the maximal number of fixed points in Boolean networks obtained by Aracena, Demongeot and Goles. The interest of this work in the context of gene network modeling is briefly discussed.     

Connectivity of intersection graphs of finite groups

The intersection graph of a group G is an undirected graph without loops and multiple edges defined as follows: the vertex set is the set of all proper non-trivial subgroups of G, and there is an edge between two distinct vertices H and K if and only if H∩K≠1 where 1 denotes the trivial subgroup of G. In this paper, we classify finite solvable groups whose intersection graphs are not 2-connected and finite nilpotent groups whose intersection graphs are not 3-connected. Our methods are elementary.     

On a graph related to permutability in finite groups

For a finite group G we define the graph Γ(G) to be the graph whose vertices are the conjugacy classes of cyclic subgroups of G and two conjugacy classes ${\mathcal {A}, \mathcal {B}}For a finite group G we define the graph Γ(G) to be the graph whose vertices are the conjugacy classes of cyclic subgroups of G and two conjugacy classes A, B{\mathcal {A}, \mathcal {B}} are joined by an edge if for some A ? A, B ? B A{A \in \mathcal {A},\, B \in \mathcal {B}\, A} and B permute. We characterise those groups G for which Γ(G) is complete.     

Zero-divisor graph of C(X)

Summary In this article the zero-divisor graph Γ(C(X)) of the ring C(X) is studied. We associate the ring properties of C(X), the graph properties of Γ(C(X)) and the topological properties of X. Cycles in Γ(C(X)) are investigated and an algebraic and a topological characterization is given for the graph Γ(C(X)) to be triangulated or hypertriangulated. We have shown that the clique number of Γ(C(X)), the cellularity of X and the Goldie dimension of C(X) coincide. It turns out that the dominating number of Γ(C(X)) is between the density and the weight of X. Finally we have shown that Γ(C(X)) is not triangulated and the set of centers of Γ(C(X)) is a dominating set if and only if the set of isolated points of X is dense in X if and only if the socle of C(X) is an essential ideal.     

Maximal covers of finite groups

Abstract

Let λ(G) be the maximum number of subgroups in an irredundant covering of the finite group G. We prove that if G is a group with λ(G) ≤ 6, then G is supersolvable. We also describe the structure of groups G with λ(G) = 6. Moreover, we show that if G is a group with λ(G)?<?31, then G is solvable.     

The n-cohomology of limits of discrete series

Let G be a semisimple Lie group which has a compact Cartan subgroup H, let K be a maximal compact subgroup of G containing H, and let n be the sum of the negative root spaces of G corresponding to an arbitrary choice of a positive root system of (G, H). We compute the n-cohomology of the K-finite vectors in a limit of a discrete series representation π of G. In the special case when π is a discrete series representation our result reduces to the result of W. Schmid. In the special case when π is a holomorphic limit we interpret its multiplicity in L²(ΓβG) cohomologically, where Γ is a discrete subgroup of G. In the general case we present a conjecture for this multiplicity.     

Finite groups in which permutability is a transitive relation on their frattini factor groups

Let G be a finite group. A PT-group is a group G whose subnormal subgroups are all permutable in G. A PST-group is a group G whose subnormal subgroups are all S-permutable in G. We say that G is a PT_o-group (respectively, a PST_o-group) if its Frattini quotient group G/Φ(G) is a PT-group (respectively, a PST-group). In this paper, we determine the structure of minimal non-PT_o-groups and minimal non-PST_o-groups.      

Twice Q-polynomial distance-regular graphs are thin

Let Γ be a distance-regular graph of diameter d 3. For each vertex χ of Γ, let T(χ) denote the subconstituent algebra for Γ with respect to χ. An irreducible T(χ)-module W is said to be thin if dim E_i^*(χ) W 1 for 0 i d, where E_i^*(χ) is the projection onto the ith subconstituent for Γ with respect to χ. The graph Γ is said to be thin if, for each vertex χ of Γ, very irreducible T(χ)-module is thin. Our main result is the following Theorem: If Γ has two Q-polynomial structures, then Γ is thin.     

A Generalization of Noncommuting Graph via Automorphisms of a Group

Let G be a group. By using a family 𝒜 of subsets of automorphisms of G, we introduced a simple graph Γ_𝒜(G), which is a generalization of the non-commuting graph. In this paper, we study the combinatorial properties of Γ_𝒜(G).     

JSJ-Decompositions of finitely presented groups and complexes of groups

A JSJ-splitting of a group G over a certain class of subgroups is a graph of groups decomposition of G which describes all possible decompositions of G as an amalgamated product or an HNN extension over subgroups lying in the given class. Such decompositions originated in 3-manifold topology. In this paper we generalize the JSJ-splitting constructions of Sela, Rips–Sela and Dunwoody–Sageev, and we construct a JSJ-splitting for any finitely presented group with respect to the class of all slender subgroups along which the group splits. Our approach relies on Haefliger’s theory of group actions on CAT(0) spaces. Submitted: October 2003 Revision: February 2005 Accepted: June 2005