L_p-mixed intersection bodies

In this paper the author first introduce a new concept of Lp-dual mixed volumes of star bodies which extends the classical dual mixed volumes. Moreover, we extend the notions of Lp- intersection body to Lp-mixed intersection body. Inequalities for Lp-dual mixed volumes of Lp-mixed intersection bodies are established and the results established here provide new estimates for these type of inequalities.     

Mazur intersection property for Asplund spaces

The main result of the present note states that it is consistent with the ZFC axioms of set theory (relying on Martin's Maximum MM axiom), that every Asplund space of density character ω₁ has a renorming with the Mazur intersection property. Combined with the previous result of Jiménez and Moreno (based upon the work of Kunen under the continuum hypothesis) we obtain that the MIP renormability of Asplund spaces of density ω₁ is undecidable in ZFC.     

On dual quermassintegrals of mixed intersection bodies

In this paper, it is shown that a family of inequalities involving mixed intersection bodies holds. The Busemann intersection inequality is the first of this family. All of the members of this family are strengthened versions of classical inequalities between pairs of dual quermassintegrals of a star body.     

The rate of convergence for the cyclic projections algorithm III: Regularity of convex sets

The cyclic projections algorithm is an important method for determining a point in the intersection of a finite number of closed convex sets in a Hilbert space. That is, for determining a solution to the “convex feasibility” problem. This is the third paper in a series on a study of the rate of convergence for the cyclic projections algorithm. In the first of these papers, we showed that the rate could be described in terms of the “angles” between the convex sets involved. In the second, we showed that these angles often had a more tractable formulation in terms of the “norm” of the product of the (nonlinear) metric projections onto related convex sets.In this paper, we show that the rate of convergence of the cyclic projections algorithm is also intimately related to the “linear regularity property” of Bauschke and Borwein, the “normal property” of Jameson (as well as Bakan, Deutsch, and Li’s generalization of Jameson’s normal property), the “strong conical hull intersection property” of Deutsch, Li, and Ward, and the rate of convergence of iterated parallel projections. Such properties have already been shown to be important in various other contexts as well.     

Moderate and Small Deviations for the Ranges of One-Dimensional Random Walks

We establish moderate and small deviations for the ranges of integer valued random walks. Our theorems apply to the limsup and the liminf laws of the iterated logarithm. We establish moderate and small deviations for the ranges of integer valued random walks. Our theorems apply to the limsup and the liminf laws of the iterated logarithm.     

A Novel Insight into the Perfect Phylogeny Problem

One of the classical problem in computational biology is the character compatibility problem or perfect phylogeny problem. A standard formulation of this problem in terms of two closely related questions is the following. Given a data set consisting of a finite set X and a set

Fan-Ha截口定理的改进及其应用

本文首先证明Ｆａｎ－Ｈａ截口定理的一个改进形式和一些相应的等价形式;其 次作为应用,我们得到一个极大极小定理、一些重合定理和一个极大元定理．     

具有相交性质的近小扭转映射的不变环面的保持性

In this paper we investigate the nearly small twist mappings with intersection property. With a certain non-degenerate condition, we proved that the most of invariant tori of the original small twist mappings will survive afer small perturtations. The persisted invariant tori are close to the unperturbed ones when the perturbation are small. The orbits reduced by those mappings are quasi-periodic in the invariant tori with the frequences closing to the original ones.     

Intersections of q-ary perfect codes

The intersections of q-ary perfect codes are under study. We prove that there exist two q-ary perfect codes C ₁ and C ₂ of length N = qn + 1 such that |C ₁ ? C ₂| = k · |P _i |/p for each k ∈ {0,..., p · K ? 2, p · K}, where q = p ^r , p is prime, r ≥ 1, $n = \tfrac{{q^{m - 1} - 1}}{{q - 1}}$ , m ≥ 2, |P _i | = p ^nr(q?2)+n , and K = p ^{n(2r?1)?r(m?1)}. We show also that there exist two q-ary perfect codes of length N which are intersected by p ^nr(q?3)+n codewords.     

Topology of complete intersections

Let X _n (d) and X _n (d') be two n-dimensional complete intersections with the same total degree d. In this paper we prove that, if n is even and d has no prime factors less than , then X _n (d) and X _n (d') are homotopy equivalent if and only if they have the same Euler characteristics and signatures. This confirms a conjecture of Libgober and Wood [16]. Furthermore, we prove that, if d has no prime factors less than , then X _n (d) and X _n (d') are homeomorphic if and only if their Pontryagin classes and Euler characteristics agree. Received: September 6, 1996