Some Results on Hypercentral Units in Integral Group Rings

Abstract

In this note we investigate the hypercentral units in integral group rings ?G,where G is not necessarily torsion. One of the main results obtained is the following (Theorem 3.5): if the set of torsion elements of G is a subgroup T of G and if Z ₂(𝒰) is not contained in C _𝒰(T),then T is either an Abelian group of exponent 4 or a Q* group. This extends our earlier result on torsion group rings.     

On intersections of conjugacy classes and bruhat cells

For a connected semisimple algebraic group G over an algebraically closed field k and a fixed pair (B, B ^– ) of opposite Borel subgroups of G, we determine when the intersection of a conjugacy class C in G and a double coset BwB ^– is nonempty, where w is in the Weyl group W of G. The question comes from Poisson geometry, and our answer is in terms of the Bruhat order on W and an involution m _C ∈ 2 W associated to C. We prove that the element m _C is the unique maximal length element in its conjugacy class in W, and we classify all such elements in W. For G = SL(n + 1; k), we describe m _C explicitly for every conjugacy class C, and when w ∈ W ≌ S_n+1 is an involution, we give an explicit answer to when C ∩ (BwB) is nonempty.     

On the point-stabiliser in a transitive permutation group

If V is a (possibly infinite) set, G a permutation group on V, v ? V{V, v\in V}, and Ω is an orbit of the stabiliser G _v , let G_v^W{G_v^{\Omega}} denote the permutation group induced by the action of G _v on Ω, and let N be the normaliser of G in Sym(V). In this article, we discuss a relationship between the structures of G _v and G_v^W{G_v^\Omega}. If G is primitive and G _v is finite, then by a theorem of Betten et al. (J Group Theory 6:415–420, 2003) we can conclude that every composition factor of the group G _v is also a composition factor of the group G_v^W(v){G_v^{\Omega(v)}}. In this paper we generalize this result to possibly imprimitive permutation groups G with infinite vertex-stabilisers, subject to certain restrictions that can be expressed in terms of the natural permutation topology on Sym(V). In particular, we show the following: If W = u^G_v{\Omega=u^{G_v}} is a suborbit of a transitive closed subgroup G of Sym(V) with a normalizing overgroup N ≤ N _Sym(V)(G) such that the N-orbital {(v^g,u^g) | u ? W, g ? N}{\{(v^g,u^g) \mid u\in \Omega, g\in N\}} is locally finite and strongly connected (when viewed as a digraph on V), then every closed simple section of G _v is also a section of G_v^W{G_v^\Omega}. To demonstrate that the topological assumptions on G and the simple sections of G _v cannot be omitted in this statement, we give an example of a group G acting arc-transitively on an infinite cubic tree, such that the vertex-stabiliser G _v is isomorphic to the modular group PSL(2,\mathbbZ) @ C₂*C₃{{\rm PSL}(2,\mathbb{Z}) \cong C_2*C_3}, which is known to have infinitely many finite simple groups among its sections.     

The finite simple groups with at most two fusion classes of every order

Elements a,b of a group G are said to be fused if a = b^σ and to be inverse-fused if a =(b^-1)^σ for some σ ? Aut(G). The fusion class of a ? G is the set {a^σ | σ ? Aut(G)}, and it is called a fusion class of order i if a has order iThis paper gives a complete classification of the finite nonabelian simple groups G for which either (i) or (ii) holds, where:

(i) G has at most two fusion classes of order i for every i (23 examples); and

(ii) any two elements of G of the same order are fused or inversenfused.

The examples in case (ii) are: A₅, A₆,L₂(7),L₂(8), L₃(4), Sz(8), M₁₁ and M₂₃An application is given concerning isomorphisms of Cay ley graphs.     

The Ramsey numbers for cycles versus wheels of even order

For two given graphs G₁ and G₂, the Ramsey number R(G₁,G₂) is the smallest integer n such that for any graph G of order n, either G contains G₁ or the complement of G contains G₂. Let C_n denote a cycle of order n and W_m a wheel of order m+1. Surahmat, Baskoro and Tomescu conjectured that R(C_n,W_m)=3n−2 for m odd, n≥m≥3 and (n,m)≠(3,3). In this paper, we confirm the conjecture for n≥20.     

Unique factorization of compositive hereditary graph properties

A graph property is any class of graphs that is closed under isomorphisms. A graph property P is hereditary if it is closed under taking subgraphs; it is compositive if for any graphs G1, G2 ∈ P there exists a graph G ∈ P containing both G1 and G2 as subgraphs. Let H be any given graph on vertices v1, . . . , vn, n ≥ 2. A graph property P is H-factorizable over the class of graph properties P if there exist P 1 , . . . , P n ∈ P such that P consists of all graphs whose vertex sets can be partitioned into n parts, possibly empty, satisfying: 1. for each i, the graph induced by the i-th non-empty partition part is in P i , and 2. for each i and j with i = j, there is no edge between the i-th and j-th parts if vi and vj are non-adjacent vertices in H. If a graph property P is H-factorizable over P and we know the graph properties P 1 , . . . , P n , then we write P = H [ P 1 , . . . , P n ]. In such a case, the presentation H[ P 1 , . . . , P n ] is called a factorization of P over P. This concept generalizes graph homomorphisms and (P 1 , . . . , P n )-colorings. In this paper, we investigate all H-factorizations of a graph property P over the class of all hered- itary compositive graph properties for finite graphs H. It is shown that in many cases there is exactly one such factorization.     

Symmetry groups of vertex-transitive polytopes

Groups which are not isomorphic to the symmetry group of any vertextransitive polytope (of any dimension) are characterized as generalized dicyclic, or abelian groups but not elementary 2-groups. The same class of groupsG is also characterized by the existence of a permutation groupP acting onG, containingG* (the regular representation ofG) as a proper subgroup, such that the members of the stabilizerP _u of the unitu ε G take everyg ε G tog ^±1.     

Weak Cayley Table Groups II: Alternating Groups and Finite Coxeter Groups

A weak Cayley table isomorphism is a bijection φ: G → H of groups such that φ(xy) ～ φ(x)φ(y) for all x, y ∈ G. Here ～denotes conjugacy. When G = H the set of all weak Cayley table isomorphisms φ: G → G forms a group 𝒲(G) that contains the automorphism group Aut(G) and the inverse map I: G → G, x → x ^?1. Let 𝒲₀(G) = ?Aut(G), I? ≤ 𝒲(G) and say that G has trivial weak Cayley table group if 𝒲(G) = 𝒲₀(G). We show that all finite irreducible Coxeter groups (except possibly E ₈) have trivial weak Cayley table group, as well as most alternating groups. We also consider some sporadic simple groups.     

Homomorphisms between the chevalley groups over any fields of characteristic zero

Given an irreducible root system ∑, let G(F,L) denote the Cheval- ley group over a field F corresponding to a lattice L between the root lattice and the weight lattice of ∑,. We will determine all nontnvial homomorphisms from G(k,L ₁) to G(K,L ₂when k and K are any fields of characteristic zero, and we will verify that any nontrivial homomorphism from G(k,L ₁) to G(K,L ₂are induced by a field homomorphism from k to K by multiplying an automorphism of G(K,L ₂.     

On the Marginal Automorphisms of a Group

Let W be a nonempty subset of a free group. We call an automorphism α of a group G a marginal automorphism if x ^?1α(x) ∈ W*(G) for each x ∈ G, where W*(G) is the marginal subgroup of G. In this article, we give some results on marginal automorphisms of a group.     

Weinberg bounds over nonspherical graphs

Let Aut(G) and E(G) denote the automorphism group and the edge set of a graph G, respectively. Weinberg's Theorem states that 4 is a constant sharp upper bound on the ratio |Aut(G)|/|E(G)| over planar (or spherical) 3‐connected graphs G. We have obtained various analogues of this theorem for nonspherical graphs, introducing two Weinberg‐type bounds for an arbitrary closed surface Σ, namely: where supremum is taken over the polyhedral graphs G with respect to Σ for W_P(Σ) and over the graphs G triangulating Σ for W_T(Σ). We have proved that Weinberg bounds are finite for any surface; in particular: W_P = W_T = 48 for the projective plane, and W_T = 240 for the torus. We have also proved that the original Weinberg bound of 4 holds over the graphs G triangulating the projective plane with at least 8 vertices and, in general, for the graphs of sufficiently large order triangulating a fixed closed surface Σ. © 2000 John Wiley & Sons, Inc. J Graph Theory 33: 220–236, 2000     

Writing Commutators of Commutators as Products of Cubes in Groups

We study the cube length of certain elements of the derived subgroup of a group G. By the cube length Cu(γ) of an element γ of a group G, we mean the least natural number k such that γ is a products of k cubes. We find an upper bound for the cube length of a commutator of commutators. If W = F?C _∞ is the wreath product of a free group F by the infinite cyclic group, we show that every element of W″ is a product of at most three cubes in W.     

局部连通图的群Z_3-连通性

本文研究了局部连通图的群连通性的问题.利用不断收缩非平凡Z_3-连通子图的方法,在G是3-边连通且局部连通的无爪无沙漏图的情况下,获得了G不是群Z_3-连通的当且仅当G是K_4或W_5.推广了当G是2-边连通且局部3-边连通时,G是群Z_3-连通的这个结果.     

P3-isomorphisms for graphs

The P₃-graph of a finite simple graph G is the graph whose vertices are the 3-vertex paths of G, with adjacency between two such paths whenever their union is a 4-vertex path or a 3-cycle. In this paper we show that connected fnite simple graphs G and H with isomorphic P₃-graphs are either isomorphic or part of three exceptional families. We also characterize all isomorphisms between P₃-graphs in terms of the original graphs. © 1997 John Wiley & Sons, Inc. J Graph Theory 26:35–51, 1997     

Unramified cohomology of degree 3 and Noether’s problem

Let G be a finite group and W be a faithful representation of G over C. The group G acts on the field of rational functions C(W). The question whether the field of invariant functions C(W) ^G is purely transcendental over C goes back to Emmy Noether. Using the unramified cohomology group of degree 2 of this field as an invariant, Saltman gave the first examples for which C(W) ^G is not rational over C. Around 1986, Bogomolov gave a formula which expresses this cohomology group in terms of the cohomology of the group G. In this paper, we prove a formula for the prime to 2 part of the unramified cohomology group of degree 3 of C(W) ^G . Specializing to the case where G is a central extension of an F _p -vector space by another, we get a method to construct nontrivial elements in this unramified cohomology group. In this way we get an example of a group G for which the field C(W) ^G is not rational although its unramified cohomology group of degree 2 is trivial. Dedicated to Jean-Louis Colliot-Thélène.     

Orders in regular rings with minimal condition for principal right ideals

ABSTRACT

A ring R is called an n-clean (resp. Σ-clean) ring if every element in R is n-clean (resp. Σ-clean). Clean rings are 1-clean and hence are Σ-clean. An example shows that there exists a 2-clean ring that is not clean. This shows that Σ-clean rings are a proper generalization of clean rings. The group ring ?_(p) G with G a cyclic group of order 3 is proved to be Σ-clean. The m× m matrix ring M _m (R) over an n-clean ring is n-clean, and the m×m (m>1) matrix ring M _m (R) over any ring is Σ-clean. Additionally, rings satisfying a weakly unit 1-stable range were introduced. Rings satisfying weakly unit 1-stable range are left-right symmetric and are generalizations of abelian π-regular rings, abelian clean rings, and rings satisfying unit 1-stable range. A ring R satisfies a weakly unit 1-stable range if and only if whenever a ₁ R + ˙˙˙ a _m R = dR, with m ≥ 2, a ₁,…, a _m, d ∈ R, there exist u ₁ ∈ U(R) and u ₂,…, u _m ∈ W(R) such that a ₁ u ₁ + ? a _m u _m = Rd.     

Disjoint homotopic paths and trees in a planar graph

In this paper we describe a polynomial-time algorithm for the following problem:given: a planar graphG embedded in ℝ², a subset {I ₁, …,I _p} of the faces ofG, and pathsC ₁, …,C _k inG, with endpoints on the boundary ofI ₁ ∪ … ∪I _p; find: pairwise disjoint simple pathsP ₁, …,P _k inG so that, for eachi=1, …,k, P _i is homotopic toC _i in the space ℝ²\(I ₁ ∪ … ∪I _p). Moreover, we prove a theorem characterizing the existence of a solution to this problem. Finally, we extend the algorithm to disjoint homotopic trees. As a corollary we derive that, for each fixedp, there exists a polynormial-time algorithm for the problem:given: a planar graphG embedded in ℝ² and pairwise disjoint setsW ₁, …,W _k of vertices, which can be covered by the boundaries of at mostp faces ofG;find: pairwise vertex-disjoint subtreesT ₁, …,T _k ofG whereT _i (i=1, …, k).     

An Ascending Chain Condition on Wedderburn Radicals

In this note we study the properties of Amitsur's example for Wedderburn radicals, introducing the concept of W _n -reduced rings. The theories of commutative ring and reduced ring are generalized to W _n -reduced rings. We characterize the W _n -reduced property and study properties of W _n -reduced rings. It is shown that the classes of semi-commutative rings, W _n -reduced rings, and 2-primal rings are in a strictly increasing order. We extend the class of W _n -reduced rings, observing various kinds of extensions containing classical quotient rings, polynomial rings, and power series rings.

Communicated by M. Ferrero.     

Applications of BGP-reflection functors: isomorphisms of cluster algebras

Given a symmetrizable generalized Cartan matrix A, for any index k, one can define an automorphism associated with A, of the field Q(u1,…, un) of rational functions of n independent indeterminates u1,…,un.It is an isomorphism between two cluster algebras associated to the matrix A (see sec. 4 for the precise meaning). When A is of finite type, these isomorphisms behave nicely; they are compatible with the BGP-reflection functors of cluster categories defined in a previous work if we identify the indecomposable objects in the categories with cluster variables of the corresponding cluster algebras, and they are also compatible with the "truncated simple reflections" defined by Fomin-Zelevinsky. Using the construction of preprojective or preinjective modules of hereditary algebras by DIab-Ringel and the Coxeter automorphisms (i.e. a product of these isomorphisms), we construct infinitely many cluster variables for cluster algebras of infinite type and all cluster variables for finite types.