An accessibility theorem for infinite graph minors

We prove the following recent conjecture of Halin. Let Γ₀ be the class of all graphs, and for every ordinal μ > 0 let Γ_μ be the class of all graphs containing infinitely many disjoint connected graphs from Γ_λ, for every λ < μ. Then a graph lies in all these classes Γ_μ if and only if it contains a subdivision of the infinite binary tree. Published by John Wiley & Sons, Inc., 2000 J Graph Theory 35: 273–277, 2000     

Bounding Ext for modules for algebraic groups, finite groups and quantum groups

Given a finite root system Φ, we show that there is an integer c=c(Φ) such that , for any reductive algebraic group G with root system Φ and any irreducible rational G-modules L, L^′. There also is such a bound in the case of finite groups of Lie type, depending only on the root system and not on the underlying field. For quantum groups, a similar result holds for Extn, for any integer n?0, using a constant depending only on n and the root system. When L is the trivial module, the same result is proved in the algebraic group case, thus giving similar bounded properties, independent of characteristic, for algebraic and generic cohomology. (A similar result holds for any choice of L=L(λ), even allowing λ to vary, provided the p-adic expansion of lambda is limited to a fixed number of terms.) In particular, because of the interpretation of generic cohomology as a limit for underlying families of finite groups, the same boundedness properties hold asymptotically for finite groups of Lie type. The results both use, and have consequences for, Kazhdan–Lusztig polynomials. Appendix A proves a stable version, needed for small prime arguments, of Donkin's tilting module conjecture.     

A remark on accessibility

This note obtains some characteristics of accessibility and Kato’s chaos. Applying these results, an accessible dynamical system whose product system is not accessible is constructed, giving a negative answer to a question in [Li R, Wang H, Zhao Y. Kato’s chaos in duopoly games. Chaos Solit Fract 2016;84:69–72]. Besides, it is proved that every transitive interval self-map is accessible.     

Geometry for palindromic automorphism groups of free groups

We examine the palindromic automorphism group , of a free group F _n , a group first defined by Collins in [5] which is related to hyperelliptic involutions of mapping class groups, congruence subgroups of , and symmetric automorphism groups of free groups. Cohomological properties of the group are explored by looking at a contractible space on which acts properly with finite quotient. Our results answer some conjectures of Collins and provide a few striking results about the cohomology of , such as that its rational cohomology is zero at the vcd. Received: January 17, 2000.     

JSJ-splittings for finitely presented groups over slender groups

We generalize the JSJ-splitting of Rips and Sela to give decompositions of finitely presented groups which capture splittings over certain classes of small subgroups. Such classes include the class of all 2-ended groups and the class of all virtually Z⊕Z groups. The approach, called “track zipping”, is relatively elementary, and differs from the Rips-Sela approach in that it does not rely on the theory of R-trees but rather on an understanding of certain embedded 1-complexes (called patterns) in a presentation 2-complex for the ambient group. Oblatum 18-IV-1997 & 30-I-1998 / Published online: 18 September 1998     

The accessibility arc upgrading problem

The accessibility arc upgrading problem (AAUP) is a network upgrading problem that arises in real-life decision processes such as rural network planning. In this paper, we propose a linear integer programming formulation and two solution approaches for this problem. The first approach is based on the knapsack problem and uses the knowledge gathered from an analytical study of some special cases of the AAUP. The second approach is a variable neighbourhood search with strategic oscillation. The excellent performance of both approaches is demonstrated using a large set of randomly generated instances. Finally, we stress the importance of a proper allocation of scarce resources in accessibility improvement.     

On Cartan matrices and lower defect groups for covering groups of symmetric groups

We determine the elementary divisors of the Cartan matrices of spin -blocks of the covering groups of the symmetric groups when is an odd prime. As a consequence, we also compute the determinants of these Cartan matrices, and in particular we confirm a conjecture by Brundan and Kleshchev that these determinants depend only on the weight but not on the sign of the block.

     

Compactness conditions for groups of automorphisms of topological groups

It is proved that if G is a compact, totally disconnected Abelian group and Aut G is its group of topological automorphisms (with the natural topology), then the following conditions are equivalent: (a) Aut G is compact; (b) Aut G is locally compact; (c) Aut G has small invariant neighborhoods of the identity; (d) Aut G is an -group; (e) the factor group of Aut G by its center is compact; (f) the closure of the commutator subgroup of Aut G is compact; (g) , where F_p is a finite p-group, Z_p is the additive group of p-adic integers, and n_p < .Translated from Matematicheskie Zametki, Vol. 19, No. 5, pp. 735–743, May, 1976.In conclusion, the author thanks V. P. Platonov for his constant attention to this paper.     

The Connes-Kasparov conjecture for almost connected groups and for linear p-adic groups

Let G be a locally compact group with cocompact connected component. We prove that the assembly map from the topological K-theory of G to the K-theory of the reduced C^*-algebra of G is an isomorphism. The same is shown for the groups of k-rational points of any linear algebraic group over a local field k of characteristic zero. Dedicated to the memory of Peter Slodowy