强极大TAF代数的交不可约D-模

本文研究了强极大TAF代数的交不可约D-模的有关性质.利用矩阵单元链的方法,证明了全上三角矩阵代数中任一D-模等于包含它的所有交不可约D-模的交,建立了强极大TAF代数的交不可约D-模与矩阵单元链之间的对应关系,推广了强极大TAF代数中关于理想的若干性质.     

Homological approximations for profinite and pro-p limit groups

Abstract

We study homological approximations of the profinite completion of a limit group (see Thm. A) and obtain the analogous of Bridson and Howie’s Theorem for the profinite completion of a non-abelian limit group (see Thm. B).     

Continuous Cohomology of Permutation Groups on Profinite Modules

ABSTRACT

Model theorists have made use of low-dimensional continuous cohomology of infinite permutation groups on profinite modules, see Ahlbrandt and Ziegler (1991 Ahlbrandt , G. , Ziegler , M. ( 1991 ). What's so special about (?/4?)^ω? Archive for Math. Logic 31 : 115 – 132 . [CSA] [Crossref] , [Google Scholar]), Evans (1997b Evans , D. M. ( 1997b ). Computation of first cohomology groups of finite covers . J. Algebra 193 : 214 – 238 . [CSA] [CROSSREF] [Crossref], [Web of Science ®] , [Google Scholar]), Evans et al. (1997 Evans , D. M. , Ivanov , A. A. , Macpherson , H. D. ( 1997 ). Finite covers . In: Evans , D. M. , ed. Model Theory of Groups and Automorphism Groups . London Mathematical Society Lecture Notes 244 . Cambridge : Cambridge Univ Press , pp. 1 – 72 .[Crossref] , [Google Scholar]), and Hodges and Pillay (1994 Hodges , W. , Pillay , A. ( 1994 ). Cohomology of structures and some problems of Ahlbrandt and Ziegler . J. London Math. Soc. 50 ( 2 ): 1 – 16 . [CSA] [Crossref] , [Google Scholar]), for example. We expand the module category in order to widen the cohomological toolkit. For an important class of groups we use these tools to establish criteria for finiteness of cohomology.     

Zeta function of representations of compact -adic analytic groups

Let be an FAb compact -adic analytic group and suppose that 2$"> or and is uniform. We prove that there are natural numbers and functions rational in such that

     

Embedding Problems of Division Algebras

A finite group G is called admissible over a given field if there exists a central division algebra that contains a G-Galois field extension as a maximal subfield. We give a definition of embedding problems of division algebras that extends both the notion of embedding problems of fields as in classical Galois theory, and the question which finite groups are admissible over a field. In a recent work by Harbater, Hartmann, and Krashen, all admissible groups over function fields of curves over complete discretely valued fields with algebraically closed residue field of characteristic zero have been characterized. We show that also certain embedding problems of division algebras over such a field can be solved for admissible groups.     

The Generalised Pro-Fitting Subgroup of a Profinite Group

The generalised Fitting subgroup of a finite group is the group generated by all subnormal subgroups that are either nilpotent or quasisimple. The importance of this subgroup in finite group theory stems from the fact that it always contains its own centraliser, so that any finite group is an abelian extension of a group of automorphisms of its generalised Fitting subgroup. We define a class of profinite groups which generalises this phenomenon, and explore some consequences for the structure of profinite groups.     

Finiteness of Profinite Groups with a Rational Probabilistic Zeta Function

We prove that every profinite group in a certain class with a rational probabilistic zeta function has only finitely many maximal subgroups.     

BOOLEAN ALGEBRAS IN AST

In this paper we investigate Boolean algebras and their subalgebras in Alternative Set Theory (AST). We show that any two countable atomless Boolean algebras are isomorphic and we give an example of such a Boolean algebra. One other main result is, that there is an infinite Boolean algebra freely generated by a set. At the end of the paper we show that the sentence “There is no non-trivial free group which is a set” is consistent with AST.     

MAPS PRESERVING STRONG SKEW LIE PRODUCT ON FACTOR VON NEUMANN ALGEBRAS

Let A be a factor von Neumann algebra and Φ be a nonlinear surjective map from A onto itself.We prove that,if Φ satisfies that Φ(A)Φ(B) - Φ(B)Φ(A)* =AB - BA* for all A,B ∈ A,then there exist a linear b...     

The true prosoluble completion of a group: Examples and open problems

The true prosoluble completion of a group Γ is the inverse limit of the projective system of soluble quotients of Γ. Our purpose is to describe examples and to point out some natural open problems. We discuss a question of Grothendieck for profinite completions and its analogue for true prosoluble and true pronilpotent completions. Goulnara Arzhantseva and Zoran Šunić were the authors of the Appendix.     

Reducibility of Joins Involving Some Locally Trivial Pseudovarieties

Abstract

In this paper, we show that σ-reducibility is preserved under joins with K, where K is the pseudovariety of semigroups in which idempotents are left zeros. Reducibility of joins with D, the pseudovariety of semigroups in which idempotents are right zeros, is also considered. In this case, we were able to prove that σ- reducibility is preserved for joins with pseudovarieties verifying a certain property of cancellation. As an example involving the semidirect product, we prove that Sl*K is κ-tame, where Sl stands for the pseudovariety of semilattices.     

Sofic equivalence relations

We introduce the notion of sofic measurable equivalence relations. Using them we prove that Connes' Embedding Conjecture as well as the Measurable Determinant Conjecture of Lück, Sauer and Wegner hold for treeable equivalence relations.     

Axisymmetric melting of a long cylinder due to an infinite flux

By employing a new embedding technique, a short-time analytical solution for the axisymmetric melting of a long cylinder due to an infinite flux is presented in this paper. The sufficient condition for starting the instantaneous melting of the cylinder has been derived. The melt is removed as soon as it is formed. The method of solution is simple and straightforward and consists of assuming fictitious initial temperature for some fictitious extension of the actual region.     

Binary group facets with complete support and non-binary coefficients

We identify binary group facets with complete support and non-binary coefficients. These inequalities can be used to obtain new facets for larger problems using Gomory’s homomorphic lifting.     

Group Embeddings with Algorithmic Properties

We show that every countable group H with solvable word problem can be subnormally embedded into a 2-generated group G which also has solvable word problem. Moreover, the membership problem for H < G is also solvable. We also give estimates of time and space complexity of the word problem in G and of the membership problem for H < G.     

Seperating the intrinsic complexity and the derivational complexity of the word problem for finitely presented groups

A pseudo-natural algorithm for the word problem of a finitely presented group is an algorithm which not only tells us whether or not a word w equals 1 in the group but also gives a derivation of 1 from w when w equals 1. In [13], [14] Madlener and Otto show that, if we measure complexity of a primitive recursive algorithm by its level in the Grzegorczyk hierarchy, there are groups in which a pseudo-natural algorithm is arbitrarily more complicated than an algorithm which simply solves the word problem. In a given group the lowest degree of complexity that can be realised by a pseudo-natural algorithm is essentially the derivational complexity of that group. Thus the result separates the derivational complexity of the word problem of a finitely presented group from its intrinsic complexity. The proof given in [13] involves the construction of a finitely presented group G from a Turing machine T such that the intrinsic complexity of the word problem for G reflects the complexity of the halting problem of T, while the derivational complexity of the word problem for G reflects the runtime complexity of T. The proof of one of the crucial lemmas in [13] is only sketched, and part of the purpose of this paper is to give the full details of this proof. We will also obtain a variant of their proof, using modular machines rather than Turing machines. As for several other results, this simplifies the proofs considerably. MSC: 03D40, 20F10.     

Fibre products, non-positive curvature, and decision problems

We give a criterion for fibre products to be finitely presented and use it as the basis of a construction that encodes the pathologies of finite group presentations into pairs of groups where G is a product of hyperbolic groups and P is a finitely presented subgroup. This enables us to prove that there is a finitely presented subgroup P in a biautomatic group G such that the generalized word problem for is unsolvable and P has an unsolvable conjugacy problem. An additional construction shows that there exists a compact non-positively curved polyhedron X such that is biautomatic and there is no algorithm to decide isomorphism among the finitely presented subgroups of . Received: October 7, 1999.     

Phase retrieval for probability measures on abelian groups

IfX is a locally compact abelian group, a probability measure onX and its Fourier transform, the mapping | | is obviously not injective. The aim of this article is to find conditions under which the identification of given | | is possible up to a shift and a central symmetry.Research partially supported by the Swiss National Science Foundation.