On extremally disconnected topological groups

We introduce the notion of a partially selective ultrafilter and prove that (a) if G is an extremally disconnected topological group and p is a converging nonprincipal ultrafilter on G containing a countable discrete subset, then p is partially selective, and (b) the existence of a nonprincipal partially selective ultrafilter on a countable set implies the existence of a P-point in ω^∗. Thus it is consistent with ZFC that there is no extremally disconnected topological group containing a countable discrete nonclosed subset.     

Syntactic characterization of closure under connected limits

Summary We give a syntactic characterization of (finitary) theories whose categories of models are closed under the formation of connected limits (respectively the formation of pullbacks and substructures) in the category of all structures. They are also those theories whose consistent extensions by new atomic facts admit in each component an initial structure (respectively an initial term structure), and also thoseT for whichM(T) is locally finitely multi-presentable in a canonical way. We also show that these two properties of theories are nonuniform.     

Rehabilitation of the Gauss-Jordan algorithm

Summary In this paper a Gauss-Jordan algorithm with column interchanges is presented and analysed. We show that, in contrast with Gaussian elimination, the Gauss-Jordan algorithm has essentially differing properties when using column interchanges instead of row interchanges for improving the numerical stability. For solutions obtained by Gauss-Jordan with column interchanges, a more satisfactory bound for the residual norm can be given. The analysis gives theoretical evidence that the algorithm yields numerical solutions as good as those obtained by Gaussian elimination and that, in most practical situations, the residuals are equally small. This is confirmed by numerical experiments. Moreover, timing experiments on a Cyber 205 vector computer show that the algorithm presented has good vectorisation properties.     

一种新型可调谐锁模光纤激光器

利用法布里-珀罗腔的激光二极管作为调制器件，实现环形腔光纤激光器的主动锁模。并利用法布里-珀罗腔的激光二极管的多纵模特性，把激光二极管当作一梳状滤波器，通过偏振控制器来调整入射到激光二极管内光的偏振态，同时均衡腔内增益，得到波长大范围可调谐的锁模激光，其脉冲宽度约为48ps，脉冲重复速率2GHz。     

EPR and XPS measurements of polymeric catalysts doped with hereopolyacids in oxygen adsorption studies

The goal of our studies was to determine the nature of interactions between catalytic active samples, such as polypyrrole (PPy) doped with: chloride anions, heteropolyacids such as H₅PMo₁₀V₂O₄₀, or H₄SiW₁₂O₄₀, and oxygen particles. In order to reveal the mechanism of the linkage between the catalysts and oxygen we provided the electron paramagnetic resonance (EPR) measurements of synthesized samples in O₂ and N₂ flow. Moreover, the X-ray photoelectron spectroscopy (XPS) measurements were performed to show the properties of doped heteropolyacids and the state of nitrogen in polypyrrole matrix. The results of EPR studies of PPy(Cl), PPy(H₄SiW₁₂O₄₀), PPy(H₅PMo₁₀V₂O₄₀) samples, show that the polypyrrole doped with chloride anions interacts much easier with oxygen than polypyrrole doped with heteropolyacids (in the above given order, of preference with the most active polypyrrole system first). It correlates with XPS results, which show that a molybdenium-vanadium anion is more reduced than a silicon-tungsten one. The redox reactions of heteropolyacids involve the oxidation-reduction of the conjugated polymer chain, leaving no or little place for interactions with oxygen. Polypyrrole doped with H₄SiW₁₂O₄₀ shows some oxygen sensitivity as observed in the EPR studies, as opposed to polypyrrole doped with H₅PMo₁₀V₂O₄₀, which is in line with the XPS results.     

Places of algebraic function fields in arbitrary characteristic

We consider the Zariski space of all places of an algebraic function field F|K of arbitrary characteristic and investigate its structure by means of its patch topology. We show that certain sets of places with nice properties (e.g., prime divisors, places of maximal rank, zero-dimensional discrete places) lie dense in this topology. Further, we give several equivalent characterizations of fields that are large, in the sense of F. Pop's Annals paper Embedding problems over large fields. We also study the question whether a field K is existentially closed in an extension field L if L admits a K-rational place. In the appendix, we prove the fact that the Zariski space with the Zariski topology is quasi-compact and that it is a spectral space.     

Attractors for 2D-Navier-Stokes models with delays

The existence of an attractor for a 2D-Navier-Stokes system with delay is proved. The theory of pullback attractors is successfully applied to obtain the results since the abstract functional framework considered turns out to be nonautonomous. However, on some occasions, the attractors may attract not only in the pullback sense but in the forward one as well. Also, this formulation allows to treat, in a unified way, terms containing various classes of delay features (constant, variable, distributed delays, etc.). As a consequence, some results for the autonomous model are deduced as particular cases of our general formulation.     

Expected Reflection Distance in G(r, 1, n) after a Fixed Number of Reflections

Extending to r > 1 a formula of the authors, we compute the expected reflection distance of a product of t random reflections in the complex reflection group G(r, 1, n). The result relies on an explicit decomposition of the reflection distance function into irreducible G(r, 1, n)-characters and on the eigenvalues of certain adjacency matrices.Received December 8, 2003