Complemented copies of c0 in spaces of operators

We study the existence of complemented copies of c ₀ in certain Banach spaces of bounded linear operators and apply our results to spaces of bounded vector valued measures. This revised version was published online in June 2006 with corrections to the Cover Date.     

Flow Compactifications of Nondiscrete Monoids, Idempotents and Hindman's Theorem

We describe the extension of the multiplication on a not-necessarily-discrete topological monoid to its flow compactification. We offer two applications. The first is a nondiscrete version of Hindman's Theorem, and the second is a characterization of the projective minimal and elementary flows in terms of idempotents of the flow compactification of the monoid.     

Iterated monoidal categories

We develop a notion of an n-fold monoidal category and show that it corresponds in a precise way to the notion of an n-fold loop space. Specifically, the group completion of the nerve of such a category is an n-fold loop space, and free n-fold monoidal categories give rise to a finite simplicial operad of the same homotopy type as the classical little cubes operad used to parametrize the higher H-space structure of an n-fold loop space. We also show directly that this operad has the same homotopy type as the n-th Smith filtration of the Barratt-Eccles operad and the n-th filtration of Berger's complete graph operad. Moreover, this operad contains an equivalent preoperad which gives rise to Milgram's small model for when n=2 and is very closely related to Milgram's model of for n>2.     

On the commutator of the Marcinkiewicz integral

boundedness is considered for the commutator of higher-dimensional Marcinkiewicz integral. Some conditions implying the and the boundedness for the commutator of the Marcinkiewicz integral are obtained.     

Persistency in quadratic 0–1 optimization

This paper is concerned with persistency properties which allow the evaluation of some variables at all maximizing points of a quadratic pseudo-Boolean function. Hammer, Hansen and Simeone (1984) have proposed to determine these variables using a procedure described by Balinski for computing a strongly complementary pair of optimal primal and dual solutions for arbitrary linear programs. We propose a linear time algorithm for determining these variables from a best roof off, i.e. from a lowest upper linear bound off.     

Fluctuation-dominated kinetics in the a+b→0 reaction between immobile particles

We consider the accumulation of immobile particles landing on a one-dimensional lattice and annihilating via the A + B 0 bimolecular reaction. Here we focus on short-range interactions with cutoff. We investigate through computer simulations both the kinetics of the particles' accumulation and also their spatial distribution. The relation between the exponents describing the growth of the particles' concentration and the correlation length of their distribution shows that the kinetics of accumulation is fluctuation-dominated.This work is dedicated to Prof. George H. Weiss.     

Multivariate Refinement Equations and Convergence of Cascade Algorithms in Lp（0〈p〈1）Spaces

We consider the solutions of refinement equations written in the form

求解P0函数互补问题的一种微分方程方法

本针对P0函数互补问题，给出了一种微方程方法，并且证明了P0函数互补问题的解是微分方程系统的渐进稳定平衡点。在适当的假设条件下，证明了所给出的算法具有二次收敛速度。几个数值例子表明了该算法的有效性。     

Matroid Shellability, β-Systems,and Affine Hyperplane Arrangements

The broken-circuit complex is fundamental to the shellability and homology of matroids, geometric lattices, and linear hyperplane arrangements. This paper introduces and studies the -system of a matroid, nbc(M), whose cardinality is Crapo's -invariant. In studying the shellability and homology of base-pointed matroids, geometric semilattices, and afflne hyperplane arrangements, it is found that the -system acts as the afflne counterpart to the broken-circuit complex. In particular, it is shown that the -system indexes the homology facets for the lexicographic shelling of the reduced broken-circuit complex , and the basic cycles are explicitly constructed. Similarly, an EL-shelling for the geometric semilattice associated with M is produced,_and it is shown that the -system labels its decreasing chains.Basic cycles can be carried over from The intersection poset of any (real or complex) afflnehyperplane arrangement is a geometric semilattice. Thus the construction yields a set of basic cycles, indexed by nbc(M), for the union of such an arrangement.     

ε-optimality criteria for convex programming problems via exact penalty functions

In this paper, we present-optimality criteria for convex programming problems associated with exact penalty functions. Several authors have given various criteria under the assumption that such convex problems and the associated dual problems can be solved. We assume the solvability of neither the convex problem nor the dual problem. To derive our criteria, we estimate the size of the penalty parameter in terms of an-solution for the dual problem.