强相互作用味道无关性的检验

通过比较不同味道初始夸克碎裂的带电粒子多重数可以对强相互作用味道无关性进行检验.计算了e+e–湮没成轻味夸克u,d,s碎裂的粒子多重数,发现不同味道夸克事例中,平均粒子产率,同位旋对称性,由奇异与非奇异粒子多重数比值确定的奇异抑制因子等都与初始夸克味道有关,而且这种依赖性在低能时更加明显.但3种轻味夸克事例的平均带电粒子多重数近似相等,这与QCD强相互作用与味道无关的预言一致.     

Quadratic forms for a 1-form on an isolated complete intersection singularity

We consider a holomorphic 1-form ω with an isolated zero on an isolated complete intersection singularity (V,0). We construct quadratic forms on an algebra of functions and on a module of differential forms associated to the pair (V,ω). They generalize the Eisenbud–Levine–Khimshiashvili quadratic form defined for a smooth V. Partially supported by the DFG-programme 'Global methods in complex geometry' (Eb 102/4–3) grants RFBR–04–01–00762, NSh–1972.2003.1.     

Witt Groups of Derived Categories

We define the notion of cobordism of two objects in a trianulated category, and the Witt group of such category is defined as the Grothendieck group of cobordism classes of self-dual objects. We prove that the Witt group of a t-category is a free Abelian group generated by the classes of irreducible self-dual objects of its heart. In case of derived category of of complexes of sheaves on a stratified space with the middle-perversity t-structure, these irreducibles are local systems on the strata.     

Crashing a maximum-weight complementary basis

We consider the problem of finding a maximum-weight complementary basis of anm × 2m matrix. The problem arises naturally, for example, when a complementary set of columns is proposed as an initial basis for a warm start of Lemke's algorithm, but the set of columns is rank-deficient. We show that the problem is a special case of the problem of finding a maximum-weight common base of two matroids. Furthermore, we show how to efficiently implement an algorithm for the general problem in the present context. Finally, we give computational results demonstrating the practicality of our algorithm in a typical application.Supported by the Canadian Natural Science and Engineering Research Council.     

An intersection property of the simple random walks inZ d

Let {S _d (n)} _n0 be the simple random walk inZ ^d , and ^(d)(a,b)={S _d (n)Z ^d :anb}. Supposef(n) is an integer-valued function and increases to infinity asn tends to infinity, andE _n ^(d) ={^(d)(0,n)^(d)(n+f(n),)}. In this paper, a necessary and sufficient condition to ensureP(E _n ^d) ,i.o.)=0, or 1 is derived ford=3, 4. This problem was first studied by P. Erdös and S.J. Taylor.This work is partly supported by the National Natural Sciences Foundation of China.     

Solving the linear matroid parity problem as a sequence of matroid intersection problems

In this paper, we present an O(r ⁴ n) algorithm for the linear matroid parity problem. Our solution technique is to introduce a modest generalization, the non-simple parity problem, and identify an important subclass of non-simple parity problems called easy parity problems which can be solved as matroid intersection problems. We then show how to solve any linear matroid parity problem parametrically as a sequence of easy parity problems.In contrast to other algorithmic work on this problem, we focus on general structural properties of dual solutions rather than on local primal structures. In a companion paper, we develop these ideas into a duality theory for the parity problem.     

ON THE ZEROS OF POLYNOMIALS OVER QUATERNIONS

ABSTRACT

We review and expand some results on the number of zeros of polynomials over Hamilton's quaternions, with particular emphasis on those polynomials with coefficients in a degree two subfield.     

Generic Banach spaces and generic simplexes

We give a systematic study of certain class of generic Banach spaces. We show that they distinguish between an array of different properties related to smoothness of equivalent norms such as for example the Mazur intersection property or the existence of convex sets supported by all of their points. We also examine the dual constructions of generic Choquet simplexes with extra requirements such as for example those of Poulsen and Bauer asking that the set of extremal points is dense or closed, respectively.     

On Kelley's intersection numbers

We introduce a notion of weak intersection number of a collection of sets, modifying the notion of intersection number due to J.L. Kelley, and obtain an analogue of Kelley's characterization of Boolean algebras which support a finitely additive strictly positive measure. We also consider graph-theoretic reformulations of the notions of intersection number and weak intersection number.