A finiteness result for Heegaard splittings

In this paper we show that for a given 3-manifold and a given Heegaard splitting there are finitely many preferred decomposing systems of 3g−3 disjoint essential disks. These are characterized by a combinatorial criterion which is a slight strengthening of Casson-Gordon's rectangle condition. This is in contrast to fact that in general there can exist infinitely many such systems of disks which satisfy just the Casson-Gordon rectangle condition.     

Universal WCG banach spaces and universal Eberlein Compacts

We prove that for cardinalsτ satisfying τ^ω=τ and forτ=ω ₁, there do not exist universal Eberlein Compacts of weightτ, or universal WCG spaces of density characterτ. Ifτ is a strong limit cardinal of countable cofinality such universal spaces do exist. Thus under GCH universal spaces exist forτ iff cof(τ)=ω. The research of the second author was supported by a grant from the United States-Israel Binational Science Foundation and the Fund for the Promotion of Research at the Technion.     

Approximating the Pathway Axis and the Persistence Diagrams for a Collection of Balls in 3-Space

Given a collection ℬ of balls in a three-dimensional space, we wish to explore the cavities, voids, and tunnels in the complement space of ∪ℬ. We introduce the pathway axis of ℬ as a useful subset of the medial axis of the complement of ∪ℬ and prove that it satisfies several desirable geometric properties. We present an algorithm that constructs the pathway graph of ∪ℬ, a piecewise-linear approximation of the pathway axis. At the heart of our approach is an approximation scheme that constructs a collection K{\mathcal{K}} of same-size balls that approximate ℬ so that the Hausdorff distance between ∪ℬ and èK\bigcup{\mathcal{K}} is bounded by a prescribed parameter. We prove a bound on the ratio between the number of balls in K{\mathcal{K}} and the number of balls in ℬ. We employ this bound and the approximation scheme to show how to approximate the persistence diagrams for ∪ℬ, which can be used to extract major topological features such as the large voids and tunnels in the complement of ∪ℬ. We show that our approach is superior in terms of complexity to the standard point-sample approaches for the two problems that we address in this paper: approximating the pathway axis of ℬ and approximating the persistence diagrams for ∪ℬ. In a companion paper we introduce MolAxis, a tool for the identification of channels in macromolecules that demonstrates how the pathway graph and the persistence diagrams are used to identify plausible pathways in the complement of molecules.     

Finite quotients of the multiplicative group of a finite dimensional division algebra are solvable

We prove that finite quotients of the multiplicative group of a finite dimensional division algebra are solvable. Let be a finite dimensional division algebra having center , and let be a normal subgroup of finite index. Suppose is not solvable. Then we may assume that is a minimal nonsolvable group (MNS group for short), i.e. a nonsolvable group all of whose proper quotients are solvable. Our proof now has two main ingredients. One ingredient is to show that the commuting graph of a finite MNS group satisfies a certain property which we denote Property . This property includes the requirement that the diameter of the commuting graph should be , but is, in fact, stronger. Another ingredient is to show that if the commuting graph of has Property , then is open with respect to a nontrivial height one valuation of (assuming without loss of generality, as we may, that is finitely generated). After establishing the openness of (when is an MNS group) we apply the Nonexistence Theorem whose proof uses induction on the transcendence degree of over its prime subfield to eliminate as a possible quotient of , thereby obtaining a contradiction and proving our main result.