Type factors generated by purely infinite simple C*-algebras associated with free groups

Let be a free product of at least two but at most countably many cyclic groups. With each such group we associate a family of C*-algebras, denoted and generated by the reduced group C*-algebra and a collection of projections onto the -spaces over certain subsets of . We determine , the weak closure of in , and use this result to show that many of the C*-algebras in question are non-nuclear.

     

Global existence to a three‐dimensional non‐linear thermoelasticity system arising in shape memory materials

This paper is concerned with the unique global solvability of a three‐dimensional (3‐D) non‐linear thermoelasticity system arising from the study of shape memory materials. The system consists of the coupled evolutionary problems of viscoelasticity with non‐convex elastic energy and non‐linear heat conduction with mechanical dissipation. The present paper extends the previous 2‐D existence result of the authors Reference [1] to 3‐D case. This goal is achieved by means of the Leray–Schauder fixed point theorem using technique based on energy arguments and DeGiorgi method. Copyright © 2004 John Wiley & Sons, Ltd.     

Influence of velocity distribution in the multiphase flow on the building of aerobic granules in a Sequencing Batch Reactor (SBR)

In present contribution a study is presented, where fluid dynamic measurements are used to observe multiphase flow pattern in a bioreactor. It can be shown that hydrodynamic effects have a major influence on the formation, shape and size of Granular Activated Sludge (GAS) in a Sequencing Batch Reactor (SBR) under aerobic condition. In order to analyse multiphase flow pattern (water, air, granules) in the bioreactor in-situ techniques with optical measurements are applied. LASER IIIB and video lamp are used as a light source. Due to a transient spatial velocity distribution in the bioreactor our experiments are carried out in different levels of SBR. Tracer particles are employed to visualise the fluid flow pattern. Velocity field of the liquid phase in the bioreactor is determined by use of PIV method (Particle Image Velocimetry). PTV (Particle Tracking Velocimetry) is implemented to observe velocity field of individual granules (solid phase). (© 2005 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Extracting the resolution algorithm from a completeness proof for the propositional calculus

We prove constructively that for any propositional formula in Conjunctive Normal Form, we can either find a satisfying assignment of true and false to its variables, or a refutation of showing that it is unsatisfiable. This refutation is a resolution proof of ¬. From the formalization of our proof in Coq, we extract Robinson’s famous resolution algorithm as a Haskell program correct by construction. The account is an example of the genre of highly readable formalized mathematics.     

Infinite-dimensional homology and multibump solutions

We start by introducing a Čech homology with compact supports which we then use in order to construct an infinite-dimensional homology theory. Next we show that under appropriate conditions on the nonlinearity there exists a ground state solution for a semilinear Schr?dinger equation with strongly indefinite linear part. To this solution there corresponds a nontrivial critical group, defined in terms of the infinite-dimensional homology mentioned above. Finally, we employ this fact in order to construct solutions of multibump type. Although our main purpose is to survey certain homological methods in critical point theory, we also include some new results. Dedicated to Felix Browder on the occasion of his 80th birthday     

Systems of Inclusions Involving Fredholm Operators of Nonnegative Index and Nonconvex-Valued Maps

We study the existence of solutions to a system of two inclusions involving Fredholm operators of nonnegative (Fredholm) index and the so-called c-admissible maps: upper semicontinuous maps with values being continuous images of cell-like sets. The presented approach resembles the substitution technique, i.e. applies the so-called solution map. The appearance of the ‘dimension defect’ reflecting the nonnegativity of Fredholm indices requires the use of algebraic tools based on the cohomotopy theory, different from the usual homological ones present in the fixed point theory. An application to boundary value problems is provided as well as the brief exposition of basic facts from the cohomotopy theory. Mathematics Subject Classifications (2000) 47H04, 47A53, 55M20, 55Q55, 34A60.     

On the number of full levels in tries

We study the asymptotic distribution of the fill‐up level in a binary trie built over n independent strings generated by a biased memoryless source. The fill‐up level is the number of full levels in a tree. A level is full if it contains the maximum allowable number of nodes (e.g., in a binary tree level k can have up to 2^k nodes). The fill‐up level finds many interesting applications, e.g., in the internet IP lookup problem and in the analysis of level compressed tries (LC tries). In this paper, we present a complete asymptotic characterization of the fill‐up distribution. In particular, we prove that this distribution concentrates on one or two points around the most probably value k = ?log_1/qn ? log log log n + 1 + log log(p/q)?, where p > q = 1 ? p is the probability of generating the more likely symbol (while q = 1 ? p is the probability of the less likely symbol). We derive our results by analytic methods such as generating functions, Mellin transform, the saddle point method, and analytic depoissonization. We also present some numerical verification of our results. © 2004 Wiley Periodicals, Inc. Random Struct. Alg., 2004     

Tower techniques for cosimplicial resolutions

Let be a simplicial model category and J : a simplicial coaugmented functor. Given an object X, the assignment nJⁿ⁺¹X defines a cofacial resolution (an augmented cosimplicial space without its codegeneracy maps). Following Bousfield and Kan we define J^sX = tot^s([n] Jⁿ⁺¹X). An object X is called J-injective if it is a retract of JX in Ho() via the natural map. We show that certain homotopy limits of J-injective objects are J_s-injective. Our method is to use the notion of pro-weak equivalences which was first introduced in a different language and context by David Edwards and Harold Hastings. The key observation is that a cofacial resolution X (-1) X which admits a left contraction gives rise to a pro-weak equivalence of towers {X(-1)}_s0{tot^SX}_{s 0}.The first author was supported in part by National Science Foundation grant DMS-0296117     

Graph algorithms for DNA sequencing – origins,current models and the future

With the ubiquitous presence of next-generation sequencing in modern biological, genetic, pharmaceutical and medical research, not everyone pays attention to the underlying computational methods. Even fewer researchers know what were the origins of the current models for DNA assembly. We present original graph models used in DNA sequencing by hybridization, discuss their properties and connections between them. We also explain how these graph models evolved to adapt to the characteristics of next-generation sequencing. Moreover, we present a practical comparison of state-of-the-art DNA de novo assembly tools representing these transformed models, i.e. overlap and decomposition-based graphs. Even though the competition is tough, some assemblers perform better and certainly large differences may be observed in hardware resources utilization. Finally, we outline the most important trends in the sequencing field, and try to predict their impact on the computational models in the future.     

Limit theorems for random walks

We consider a random walk $S_{\tau }$ which is obtained from the simple random walk $S$ by a discrete time version of Bochner’s subordination. We prove that under certain conditions on the subordinator $\tau$ appropriately scaled random walk $S_{\tau }$ converges in the Skorohod space to the symmetric $\alpha$-stable process $B^{\alpha }$. We also prove asymptotic formula for the transition function of $S_{\tau }$ similar to the Pólya’s asymptotic formula for $B^{\alpha }$.