The treatment of nonhomogeneous Dirichlet boundary conditions by thep-version of the finite element method

Summary The paper addresses the problem of the implementation of nonhomogeneous essential Dirichlet type boundary conditions in thep-version of the finite element method.Partially supported by the Office of Naval Research under Grant N-00014-85-K-0169Research partially supported by the Air Force Office of Scientific Research, Air Force Systems Command, USAF, under Grant Number AFOSR 85-0322     

Hysteresis and Eddy-current Relaxation in SiFe Materials

The rate-dependent effects in metallic ferromagnetic materials with magnetization processes attributed to domain-walls motion were studied. The experimental method for eddy-current relaxation time determination was proposed. Some discrepancies between the data and theoretical predictions were observed and discussed. The origin of these discrepancies is accounted for by the decrease of viscous-type relaxation process as the rate of change of averaged magnetization is approaching zero.     

Effect of genesis on the properties and hydrogen reducibility of NiO-ZnO mixed oxides

The physico-chemical properties and reactivity tested by hydrogen reduction have been studied for two series of NiO-ZnO mixed oxides of various composition. The solid nickel oxide or zinc oxide in interaction with the solution of nitrate of the second component were used as the precursors in each series. The differences in some physico-chemical parameters of the samples in both series were correlated with their reduction behaviour, followed both in iso- and non-isothermal regime. Moreower, the influence of various factors modifying the reactivity of mixed oxides was also investigated and the results were compared with those obtained from earlier studied analogous systems of quite different origin.This revised version was published online in November 2005 with corrections to the Cover Date.     

On the vector field problem for O(n)/O(1)xO(1)xO(n-2)

We prove new results about the vector field problem on the real flag manifolds O(n)/O(1) x O(1) x O(n - 2). For some infinite families of these manifolds, we completely solve the vector field problem.     

The category of varieties and interpretations is alg-universal

A category is said to be alg-universal if every category of universal algebras can be fully embedded into it. We prove here that the category of varieties and interpretations, or in other words, the category of abstract clones and clone homomorphisms, is alg-universal.     

Division and <Emphasis Type="Italic">k</Emphasis>-th root theorems for <Emphasis Type="Italic">Q</Emphasis>-manifolds

We prove that a locally compact ANR-space X is a Q-manifold if and only if it has the Disjoint Disk Property (DDP), all points of X are homological Z _∞-points and X has the countable-dimensional approximation property (cd-AP), which means that each map f: K → X of a compact polyhedron can be approximated by a map with the countable-dimensional image. As an application we prove that a space X with DDP and cd-AP is a Q-manifold if some finite power of X is a Q-manifold. If some finite power of a space X with cd-AP is a Q-manifold, then X ² and X × [0, 1] are Q-manifolds as well. We construct a countable family χ of spaces with DDP and cd-AP such that no space X ∈ χ is homeomorphic to the Hilbert cube Q whereas the product X × Y of any different spaces X, Y ∈ χ is homeomorphic to Q. We also show that no uncountable family χ with such properties exists. This work was supported by the Slovenian-Ukrainian (Grant No. SLO-UKR 04-06/07)     

Algorithms for ham-sandwich cuts

Given disjoint setsP ₁,P ₂, ...,P _d inR ^d withn points in total, ahamsandwich cut is a hyperplane that simultaneously bisects theP _i . We present algorithms for finding ham-sandwich cuts in every dimensiond>1. Whend=2, the algorithm is optimal, having complexityO(n). For dimensiond>2, the bound on the running time is proportional to the worst-case time needed for constructing a level in an arrangement ofn hyperplanes in dimensiond−1. This, in turn, is related to the number ofk-sets inR ^d−1 . With the current estimates, we get complexity close toO(n ^3/2 ) ford=3, roughlyO(n ^8/3 ) ford=4, andO(n ^d−1−a(d) ) for somea(d)>0 (going to zero asd increases) for largerd. We also give a linear-time algorithm for ham-sandwich cuts inR ³ when the three sets are suitably separated. A preliminary version of the results of this paper appeared in [16] and [17]. Part of this research by J. Matoušek was done while he was visiting the School of Mathematics, Georgia Institute of Technology, Atlanta, and part of his work on this paper was supported by a Humboldt Research Fellowship. W. Steiger expresses gratitude to the NSF DIMACS Center at Rutgers, and his research was supported in part by NSF Grants CCR-8902522 and CCR-9111491.