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.     

HPLC－化学发光法测定痕量仲胺的研究

研究了测定仲胺的ＨＰＬＣ柱后化学发光检测的高灵敏分析方法。用Ｃ＿（１８）反相３μｍ色谱柱，乙腈＋水（６３．５＋３６．５）流动相，ｐＨ为６．５，对六种仲胺丹酰化衍生物实现了良好分离。研究了２－ＮＰＯ／Ｈ＿２Ｏ＿２体系的稳定性及发光条件。首次用这一体系检测了仲胺（亚硝胺的前体）。     

An extremal problem related to probability

Summary We consider a walk from a stateA ₁ to a stateA _n+1 in which the probability of remaining atA _i isp _i , and the probability of progressing fromA _i toA _i+1 is 1 –p _i . The probabilityW _nk of reachingA _n+1 fromA ₁ in exactlyn + k steps can then be expressed as a polynomial of degreen + k in then variablesp ₁,,p _n . We determine the maximum value ofW _nk and the (unique) choice (p ₁,,p _n ) for which this extremum occurs.Dedicated to Professor Otto Haupt with best wishes on his 100th birthday     

Estimation of density functions by order statistics

The properties of the empirical density function,f _n(x) = k/n( _j ⁺ – _j-1 ⁺ ) if _j-1 ⁺ < x ⁺ where _j-1 ⁺ and _j ⁺ are sample elements and there are exactlyk – 1 sample elements between them, are studied in that practical point of view how to choose a suitablek for a good estimation. A bound is given for the expected value of the absolute value of difference between the empirical and theoretical density functions.     

Measures of inset information on the open domain — I: Inset entropies and information functions of all degrees

This is one in a series of papers studying measures of information in the so-called mixed theory of information (i.e. considering the events as well as their probabilities) on the open domain (i.e. without empty sets and zero probabilities). In this paper we find all-recursive, 3-semisymmetric inset entropies on the open domain. We do this by solving the fundamental equation of inset information of degree () on the open domain.Dedicated to Professor János Aczél on his 60th birthday.     

On the periodic points of a two-parameter family of maps of the plane

We study the dynamics of a two-parameter family of noninvertible maps of the plane, derived from a model in population dynamics. We prove that, as one parameter varies with the other held fixed, the nonwandering set changes from the empty set to an unstable Cantor set on which the map is topologically equivalent to the shift endomorphism on two symbols. With the help of some numerical work, we trace the genealogies of the periodic points of the family of period 5, and describe their stability types and bifurcations. Among our results we find that the family has a fixed point which undergoes fold, flip and Hopf bifurcations, and that certain families of period five points are interconnected through a codimension-two cusp bifurcation.