The sum of coefficients of bounded univalent functions

We solve the maximal value problem for the functional in the class of functionsf(z)=z+a ₂z²+… that are holomorphic and univalent in the unit disk and satisfy the inequality |f(z)|<M. We prove that the Pick functions are extremal for this problem for sufficiently largeM whenever the set of indicesk ₁,…,k_m contains an even number. Translated fromMatematicheskie Zametki, Vol. 61, No. 5, pp. 728–733, May, 1997. Translated by S. S. Anisov     

Zero-Semidistributive Inverse Semigroups

An inverse semigroup S is said to be 0-semidistributive if its lattice ?F (S) of full inverse subsemigroups is 0-semidistributive. We show that it is sufficient to study simple inverse semigroups which are not groups. Our main theorem states that such a simple inverse semigroup S is 0-semidistributive if and only if (1) S is E-unitary, (2) S is aperiodic, (3) for any a,b ∈ S/σ with ab ≠ 1, there exist nonzero integers n and m such that (ab) ^m  = a ⁿ or (ab) ^m  = b ⁿ , where σ is the minimum group congruence on S.     

Two characterisations of the minimal triangulations of permutation graphs

A minimal triangulation of a graph is a chordal supergraph with an inclusion-minimal edge set. Minimal triangulations are obtained from adding edges only to minimal separators, completing minimal separators into cliques. Permutation graphs are the comparability graphs whose complements are also comparability graphs. Permutation graphs can be characterised as the intersection graphs of specially arranged line segments in the plane, which is called a permutation diagram. The minimal triangulations of permutation graphs are known to be interval graphs, and they can be obtained from permutation diagrams by applying a geometric operation, that corresponds to the completion of separators into cliques. We precisely specify this geometric completion process to obtain minimal triangulations, and we completely characterise those interval graphs that are minimal triangulations of permutation graphs.     

The affine Cauchy problem

The aim of this paper is to solve the Cauchy problem for locally strongly convex surfaces which are extremal for the equiaffine area functional. These surfaces are called affine maximal surfaces and here, we give a new complex representation which let us describe the solution to the corresponding Cauchy problem. As applications, we obtain a generalized symmetry principle, characterize when a curve in R³ can be a geodesic or pre-geodesic of a such surface and study the helicoidal affine maximal surfaces. Finally, we investigate the existence and uniqueness of affine maximal surfaces with a given analytic curve in its singular set.     

On the Lp–Lq maximal regularity for the linear thermoelastic plate equation in a bounded domain

This paper is concerned with the thermoelastic plate equations in a domain Ω: subject to the boundary condition: u|=D_νu|=θ|=0 and initial condition: (u, u_t, θ)|_t=0=(u₀, v₀, θ₀). Here, Ω is a bounded domain in ?ⁿ(n≧2). We assume that the boundary ?Ω of Ω is a C⁴ hypersurface. We obtain an L_p–L_q maximal regularity theorem. Copyright © 2008 John Wiley & Sons, Ltd.     

Thorough analysis of the Oseen system in 2D exterior domains

We construct L_p‐estimates for the inhomogeneous Oseen system studied in a two‐dimensional exterior domain Ω with inhomogeneous slip boundary conditions. The kernel of the paper is a result for the half space ?. Analysis of this model system shows us a parabolic character of the studied problem, resulting as an appearance of the wake region behind the obstacle. Main tools are given by the Fourier analysis to obtain the maximal regularity estimates. The results imply the solvability for the Navier–Stokes system for small velocity at infinity. Copyright © 2009 John Wiley & Sons, Ltd.     

Estimates for the Eigenvalues of Matrices

For matrices whose eigenvalues are real (such as Hermitian or real symmetric matrices), we derive simple explicit estimates for the maximal (λ_max) and the minimal (λ_min) eigenvalues in terms of determinants of order less than 3. For 3 × 3 matrices, we derive sharper estimates, which use det A but do not require to solve cubic equations.     

Algorithmic analysis of theMAP/PH/1 retrial queue

In this paper the distribution of the maximum number of customers in a retrial orbit for a single server queue with Markovian arrival process and phase type services is studied. Efficient algorithm for computing the probability distribution and some interesting numerical examples are presented.