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

Product formulas and convolution structure for Fourier-Bessel series

One of the most far-reaching qualities of an orthogonal system is the presence of an explicit product formula. It can be utilized to establish a convolution structure and hence is essential for the harmonic analysis of the corresponding orthogonal expansion. As yet a convolution structure for Fourier-Bessel series is unknown, maybe in view of the unpractical nature of the corresponding expanding functions called Fourier-Bessel functions. It is shown in this paper that for the half-integral values of the parameter ,n=0, 1, 2,, the Fourier-Bessel functions possess a product formula, the kernel of which splits up into two different parts. While the first part is still the well-known kernel of Sonine's product formula of Bessel functions, the second part is new and reflects the boundary constraints of the Fourier-Bessel differential equation. It is given, essentially, as a finite sum over triple products of Bessel polynomials. The representation is explicit up to coefficients which are calculated here for the first two nontrivial cases and . As a consequence, a positive convolution structure is established for . The method of proof is based on solving a hyperbolic initial boundary value problem.Communicated by Tom H. Koornwinder.     

Symmetric bi-derivations on prime and semi-prime rings

Summary LetR be a ring. A bi-additive symmetric mappingD(.,.): R × R R is called a symmetric bi-derivation if, for any fixedy R, a mappingx D(x, y) is a derivation. The purpose of this paper is to prove some results concerning symmetric bi-derivations on prime and semi-prime rings. We prove that the existence of a nonzero symmetric bi-derivationD(.,.): R × R R, whereR is a prime ring of characteristic not two, with the propertyD(x, x)x = xD(x, x), x R, forcesR to be commutative. A theorem in the spirit of a classical result first proved by E. Posner, which states that, ifR is a prime ring of characteristic not two andD ₁,D ₂ are nonzero derivations onR, then the mappingx D ₁(D ₂ (x)) cannot be a derivation, is also presented.     

On two mean value properties and functional equations associated with them

Summary Motivated by different mean value properties, the functional equationsf(x) – f(y)/x–y=[(x, y)], (i)xf(y) – yf(x)/x–y=[(x, y)] (ii) (x y) are completely solved when, are arithmetic, geometric or harmonic means andx, y elements of proper real intervals. In view of a duality between (i) and (ii), three of the results are consequences of other three.The equation (ii) is also solved when is a (strictly monotonic) quasiarithmetic mean while the real interval contains 0 and when is the arithmetic mean while the domain is a field of characteristic different from 2 and 3. (A result similar to the latter has been proved previously for (i).)     

Stability properties of collocation methods

Lower bounds for are given for which equidistant s-point collocation methods areA()-stable for arbitrarys.     

Normal subgroups and elementary theories of lattice-ordered groups

We show that any lattice-ordered group (l-group) G can be l-embedded into continuously many l-groups H _i which are pairwise elementarily inequivalent both as groups and as lattices with constant e. Our groups H _i can be distinguished by group-theoretical first-order properties which are induced by lattice-theoretically nice properties of their normal subgroup lattices. Moreover, they can be taken to be 2-transitive automorphism groups A(S _i ) of infinite linearly ordered sets (S _i , ) such that each group A(S _i ) has only inner automorphisms. We also show that any countable l-group G can be l-embedded into a countable l-group H whose normal subgroup lattice is isomorphic to the lattice of all ideals of the countable dense Boolean algebra B.     

Dual vectors and lower bounds for the nearest lattice point problem

We prove that given a point outside a given latticeL then there is a dual vector which gives a fairly good estimate for how far from the lattice the vector is. To be more precise, there is a set of translated hyperplanesH _i, such thatL _iH_i andd( _iH_i)(6n ²+1)^–1 d( ,L).Supported by an IBM fellowship.