Proof of semialgebraic covering mapping cylinder conjecture with semialgebraic covering homotopy theorem

In this paper we prove the semialgebraic version of Palais' covering homotopy theorem, and use this to prove Bredon's covering mapping cylinder conjecture positively in the semialgebraic category. Bredon's conjecture was originally stated in the topological category, and a topological version of our semialgebraic proof of the conjecture answers the original topological conjecture for topological G-spaces over “simplicial” mapping cylinders.     

Mössbauer, X-ray diffraction and magnetization studies of Fe–Mn–Al–Nb alloys prepared by high energy ball milling

Fe₆₀Mn₁₀Al₂₀Nb₁₀, (Fe₆₀Mn₁₀Al₃₀)₉₅Nb₅ and (Fe₆₀Mn₁₀Al₃₀)₉₀Nb₁₀ ball milled powdered alloys were investigated using X-ray diffraction, Mössbauer spectrometry, thermomagnetic (TGM) and magnetization measurements. We studied the influence of Nb content and of different milling times on the structural and magnetic properties. Two main features can be concluded: (1) the FeAlMn induces a BCC phase whatever the Nb content is, and (2) as both increasing Nb content and milling time give rise to an highly disordered state in conjunction with a decrease of the ferromagnetic behavior.     

Differential Pulse Polarographic Determination of Nitrate in AUT Solution

A differential pulse polarographic method for the determination of nitrate ion has been developed. With 0.5 M CaCl₂ as supporting electrolyte, NO^?₃ is reduced to give a peak with E_1/2=–1.836 Volt vs. the Ag/AgCl electrode. The differential pulse polarographic peak height is proportional to the nitrate concentration from 20 to 60 ppm. The detection limit for nitrate is 2 ppm in pure aqueous solution. In the determination of 40 ppm nitrate a relative precision (relative standard deviation) of less than 2% was achieved. Nitrite interferes seriously and should be absent if accurate results are required. The method has been applied to the determination of nitrate in Ammonium Uranyl Tricarbonate (AUT) Solution, results obtained by this method are compared to those obtained by ion chromatography. The agreement between the two sets of results suggests that the DPP method can be used with a fair degree of confidence.     

Almost maximal spaces

A topological space X is called almost maximal if it is without isolated points and for every x∈X, there are only finitely many ultrafilters on X converging to x. We associate with every countable regular homogeneous almost maximal space X a finite semigroup Ult(X) so that if X and Y are homeomorphic, Ult(X) and Ult(Y) are isomorphic. Semigroups Ult(X) are projectives in the category F of finite semigroups. These are bands decomposing into a certain chain of rectangular components. Under MA, for each projective S in F, there is a countable almost maximal topological group G with Ult(G) isomorphic to S. The existence of a countable almost maximal topological group cannot be established in ZFC. However, there are in ZFC countable regular homogeneous almost maximal spaces X with Ult(X) being a chain of idempotents.     

Krichever-Novikov algebras for more than two points

Krichever-Novikov algebras of meromorphic vector fields with more than two poles on higher genus Riemann surfaces are introduced. The structure of these algebras and their induced modules of forms of weight is studied.     

Nonlinear stability and convergence of finite-difference methods for the “good” Boussinesq equation

Summary The good Boussinesq equationu _tt =–u _xxxx +u _xx +(u ²) _xx has recently been found to possess an interesting soliton-interaction mechanism. In this paper we study the nonlinear stability and the convergence of some simple finite-difference schemes for the numerical solution of problems involving the good Boussinesq equation. Numerical experimentas are also reported.     

A shape-optimization technique for the capillary surface problem

Summary The problem of the construction of an equilibrium surface taking the surface tension into account leads to Laplace-Young equation which is a nonlinear elliptic free-boundary problem. In contrast to Orr et al. where an iterative technique is used for direct solution of the equation for problems with simple geometry, we propose here an alternative approach based on shape optimization techniques. The shape of the domain of the liquid is varied to attain the optimality condition. Using optimal control theory to derive expressions for the gradient, a numerical scheme is proposed and simple model problems are solved to validate the scheme.     

Finding numerical solution of linear partial differential equations of first order with real coefficients

Applying Bittner's operational calculus we present a method to give approximate solutions of linear partial differential equations of first order

Query complexity,or why is it difficult to separateNP A ∩coNP A fromP A by random oraclesA?

By thequery-time complexity of a relativized algorithm we mean the total length of oracle queries made; thequery-space complexity is the maximum length of the queries made. With respect to these cost measures one can define polynomially time- or space-bounded deterministic, nondeterministic, alternating, etc. Turing machines and the corresponding complexity classes. It turns out that all known relativized separation results operate essentially with this cost measure. Therefore, if certain classes do not separate in the query complexity model, this can be taken as an indication that their relativized separation in the classical cost model will require entirely new principles.A notable unresolved question in relativized complexity theory is the separation of NP^A co NP^A fromP ^A under random oraclesA. We conjecture that the analogues of these classes actually coincide in the query complexity model, thus indicating an answer to the question in the title. As a first step in the direction of establishing the conjecture, we prove the following result, where polynomial bounds refer to query complexity.If two polynomially query-time-bounded nondeterministic oracle Turing machines accept precisely complementary (oracle dependent) languages L^A and {0, 1}^*L^A under every oracle A then there exists a deterministic polynomially query-time-bounded oracle Turing machine that accept L^A. The proof involves a sort of greedy strategy to selecting deterministically, from the large set of prospective queries of the two nondeterministic machines, a small subset that suffices to perform an accepting computation in one of the nondeterministic machines. We describe additional algorithmic strategies that may resolve the same problem when the condition holds for a (1–) fraction of the oracles A, a step that would bring us to a non-uniform version of the conjecture. Thereby we reduce the question to a combinatorial problem on certain pairs of sets of partial functions on finite sets.