Kupplungsreaktionen von Diazoniumbetainen mit 1,6-Methano[10]-annulenderivaten und ihre Cyclisierungsreaktionen zu Heterocyclen

Summary Coupling reactions of the diazoniumbetaines2, 4, 6a, 6b, 6c with derivatives of 1,6-methano[10]annulene1a–c and/or -naphthol7 yield the dyes3a–c, 5a, 5c, 8a–c, 9, 11. The syntheses of different triazine derivatives12a–c, 13a–c, 15, 16, and17a, 17c are described.

Herrn Kollegen Gerhard Schwenker mit den besten Wünschen zum 65. Geburtstag gewidmet     

Determination of ochratoxin A in maize bread samples by LC with fluorescence detection

Ochratoxin A (OTA) is a secondary fungal metabolite produced by several moulds, mainly by Aspergillus ochraceus, A. carbonarius, A. niger and by Penicillium verrucosum. The present work shows the results of comparative studies using different procedures for the analysis of OTA in maize bread samples. The studied analytical methods involved extraction with different volumes of PBS/methanol, different extraction apparatus, and clean-up through immunoaffinity columns. The separation and identification were carried out by high-performance liquid chromatography with fluorescence detection. The optimized method for analysis of OTA in maize bread involved extraction with PBS:methanol (50:50), and clean-up with IAC column. The limit of quantification was 0.033 ng g⁻¹. Recoveries ranged from 87% to 102% for fortifications at 2.000 and 0.500 ng g⁻¹, respectively, within-day R.S.D. of 1.4% and 4.7%. The proposed method was applied to 15 samples and the presence of OTA was found in nine samples at concentrations ranging from nd to 2.650 ng g⁻¹.     

Multiplicative posets

A functionf from the posetP to the posetQ is a strict morphism if for allx, y P withx we havef(x). If there is such a strict morphism fromP toQ we writeP Q, otherwise we writeP Q. We say a posetM is multiplicative if for any posetsP, Q withP M andQ M we haveP ×Q M. (Here (p ₁,q ₁)<(p ₂,q ₂) if and only ifp ₁<p ₂ andq ₁<q ₂.) This paper proves that well-founded trees with height are multiplicative posets.This research was supported in part by NSERC Grant #69-1325.     

Orthmodular lattices whose MacNeille completions are not orthomodular

The only known example of an orthomodular lattice (abbreviated: OML) whose MacNeille completion is not an OML has been noted independently by several authors, see Adams [1], and is based on a theorem of Ameniya and Araki [2]. This theorem states that for an inner product space V, if we consider the ortholattice ?(V,⊥) = {A \( \subseteq \) V: A = A ^⊥⊥} where A ^⊥ is the set of elements orthogonal to A, then ?(V,⊥) is an OML if and only if V is complete. Taking the orthomodular lattice L of finite or confinite dimensional subspaces of an incomplete inner product space V, the ortholattice ?(V,⊥) is a MacNeille completion of L which is not orthomodular. This does not answer the longstanding question Can every OML be embedded into a complete OML? as L can be embedded into the complete OML ?(V,⊥), where V is the completion of the inner product space V. Although the power of the Ameniya-Araki theorem makes the preceding example elegant to present, the ability to picture the situation is lost. In this paper, I present a simpler method to construct OMLs whose Macneille completions are not orthomodular. No use is made of the Ameniya-Araki theorem. Instead, this method is based on a construction introduced by Kalmbach [7] in which the Boolean algebras generated by the chains of a lattice are glued together to form an OML. A simple method to complete these OMLs is also given. The final section of this paper briefly covers some elementary properties of the Kalmbach construction. I have included this section because I feel that this construction may be quite useful for many purposes and virtually no literature has been written on it.     

Search

This paper reviews the theory of search. The main viewpoint is statistical but considerable space is spent on connections with other fields such as logic and optimisation. Three primitive ideas dominate: consistency, entropy, and Bayes' methods. The theory of screening provides one of the central examples and there is a section on nonsequential random search deriving from the work of Renyi. The game of Bulls and Cows provides a motivating example for both sequential and nonsequential algorithms.     

On the support of midconvex operators

Summary LetX be a real vector space,D a convex subset ofX and (Y, K) an order complete ordered vector space. The following sandwich theorem holds: Iff: D Y is midconvex,g: D Y {– } is midconcave andg f onD, then there exists a Jensen mappingh: D Y {– } such thatg h f onD. Using this theorem we show that a mappingf: D Y is midconvex if and only if it has Jensen support at every point ofD. Moreover, ifX is a Baire topological vector space and (Y, K) is an ordered topological vector space satisfying some additional conditions, then a mappingf: D Y is continuous whenever it has continuous Jensen support at every point ofD. As an application of these results we obtain the equality of some set-classes connected with additive and midconvex operators.Dedicated to the memory of Alexander M. Ostrowski on the occasion of the 100th anniversary of his birth     

Some identities for products and degree raising of splines

In this paper it is shown how the algebraic product of two spline functions, each represented in terms of B-splines, can again be represented as a linear combination of suitable B-splines. As a corollary to this result we obtain an explicit representation of a given B-spline function in terms of B-splines of some arbitrary higher degree. This generalizes some known results for raising the degree by one. Recurrence relations for both products and degree raising are established that may be useful for computation.Communicated by Larry L. Schumaker.     

Problems with the ζ-function method

The -function method for evaluating effective actions is applied to an operator containing a potential localized on two parallel planes. This operator is characterized by a continuous spectrum and broken translation invariance. In this case, the -method leads to a divergent volume factor independent of the physical parameters. In a suitable regularization scheme, only the next to leading order term reproduces a physically interesting result.     

On error estimates of some higher order projection and penalty-projection methods for Navier-Stokes equations

Summary This paper is a continuation of our previous work [10] on projection methods. We study first existing higher order projection schemes in the semidiscretized form for the Navier-Stokes equations. One error analysis suggests that the precision of these schemes is most likely plagued by the inconsistent Neumann boundary condition satisfied by the pressure approximations. We then propose a penalty-projection scheme for which we obtain improved error estimates.This work is partially supported by NSF grant MS-8802596.     

Functional inequality characterizing nonnegative concave functions in (0, ∞) k

Summary In the present note we prove that every functionf: (0, ) [0, ) satisfying the inequalityaf(s) + bf(t) f(as + bt), s, t > 0, for somea andb such that 0 <a < 1 <a + b must be of the formf(t) = f(1)t, (t > 0). This improves our recent result in [2], where the inequality is assumed to hold for alls, t 0, and gives a positive answer to the question raised there.An analogue for functions of several real variables of the above result characterizes concave functions. Conjugate functions and some relations to Hölder's and Minkowski's inequalities are mentioned.