Multipermutation-Based Intersection Theorem and Its Applications

In this paper, we introduce a multipermutation-based intersection theorem on the product space of several unit simplices, called the simplotope. This theorem gives a substantial generalization of an intersection result of Scarf on the unit simplex (Ref. 1). By using this new result, we also obtain a multipermutation-based generalization of the Brouwer fixed-point theorem on the simplotope. Furthermore, we apply this new result to an economic equilibrium model with indivisibilities and obtain an equilibrium existence theorem.     

A new combinatorial approach to the construction of constant composition codes

Constant composition codes(CCCs)are a new generalization of binary constant weight codes and have attracted recent interest due to their numerous applications. In this paper, a new combinatorial approach to the construction of CCCs is proposed, and used to establish new optimal CCCs.     

The combinatorial construction for a class of optimal optical orthogonal codes

Optical orthogonal code (OOC) has good correlation properties. It has many important applications in a fiber-optic code-division multiple access channel. In this paper, a combinatorial construction for optimal(15p, 5,1) optical orthogonal codes withp congruent to 1 modulo 4 and greater than 5 is given by applying Weil's Theorem. From this, whenv is a product of primes congruent to 1 modulo 4 and greater than 5, an optimal (15v, 5, 1)-OOC can be obtained by applying a known recursive construction.     

On the convergence of the LJ search method

The convergence of the Luus-Jaakola search method for unconstrained optimization problems is established.Notation E _n Euclideann-space - f Gradient off(x) - ² f Hessian matrix - (·) ^T Transpose of (·) - I Index set {1, 2, ...,n} - [x _i1 ^*(j) ] Point around which search is made in the (j + 1)th iteration, i.e., [x _1l ^*(j) ,x _2l ^*(j) ,...,x _n1 ^*(j) ] - r _i ⁽ⁱ⁾ Range ofx _il ^*(i) in the (j + 1)th iteration - l ₁ min_i {r _i ⁽⁰⁾ } - l ₂ min_i {r _i ⁽⁰⁾ } - A _j Region of search in thejth iteration, i.e., {x E _n:x _il ^*(j-1) –0.5r _i ^(j-1) x _ix _il ^*(j-1) +0.5r _i ^(j-1) ,i I} - S _j Closed sphere with center origin and radius _j - Reduction factor in each iteration - 1– - (·) Gamma function Many discussions with Dr. S. N. Iyer, Professor of Electrical Engineering, College of Engineering, Trivandrum, India, are gratefully acknowledged. The author has great pleasure to thank Dr. K. Surendran, Professor, Department of Electrical Engineering, P.S.G. College of Technology, Coimbatore, India, for suggesting this work.     

一个古老等式的组合证明

采用组合的方法,对∑nk=0n+kknk(m-1)n-k=∑nk=0nk2mk这一等式提供了一种全新的证明.此外,还提供了一种完全不用微积分的代数证明.     

Some Kurzweil-Henstock-type integrals and the wide Denjoy integral

Kurzweil-Henstock integrals related to local systems and the wide Denjoy integral are discussed in the frame of their comparability and compatibility. Dedicated to the memory of Ralph Henstock (1923–2007)     

Two Kinds of Numbers and Their Applications

C. Radoux （J. Comput. Appl. Math., 115 （2000） 471-477） obtained a computational formula of Hankel determinants on some classical combinatorial sequences such as Catalan numbers and polynomials, Bell polynomials, Hermite polynomials, Derangement polynomials etc. From a pair of matrices this paper introduces two kinds of numbers. Using the first kind of numbers we give a unified treatment of Hankel determinants on those sequences, i.e., to consider a general representation of Hankel matrices on the first kind of numbers. It is interesting that the Hankel determinant of the first kind of numbers has a close relation that of the second kind of numbers.     

The strong conical hull intersection property for convex programming

The strong conical hull intersection property (CHIP) is a geometric property of a collection of finitely many closed convex intersecting sets. This basic property, which was introduced by Deutsch et al. in 1997, is one of the central ingredients in the study of constrained interpolation and best approximation. In this paper we establish that the strong CHIP of intersecting sets of constraints is the key characterizing property for optimality and strong duality of convex programming problems. We first show that a sharpened strong CHIP is necessary and sufficient for a complete Lagrange multiplier characterization of optimality for the convex programming model problem where C is a closed convex subset of a Banach space X, S is a closed convex cone which does not necessarily have non-empty interior, Y is a Banach space, is a continuous convex function and g:X→Y is a continuous S-convex function. We also show that the strong CHIP completely characterizes the strong duality for partially finite convex programs, where Y is finite dimensional and g(x)=−Ax+b and S is a polyhedral convex cone. Global sufficient conditions which are strictly weaker than the Slater type conditions are given for the strong CHIP and for the sharpened strong CHIP. The author is grateful to the referees for their constructive comments and valuable suggestions which have contributed to the final preparation of the paper.     

New techniques for designing qualitatively independent systems

Qualitatively independent systems, a previously recognized type of combinatorial design, have been recently shown to have industrial applications involving the testing of complex systems. For these applications, even small reductions on the size of a qualitatively independent system can be significant. This article discusses some new techniques that result in reduced constructions. © 1998 John Wiley & Sons, Inc. J Combin Designs 6: 411–416, 1998     

组合分布在求解直线上n步随机游动首次通过问题上的应用

基于组合过程模型给出其轨道对目标集的首次通过概率及首中点的分布函数 ,并由此给出直线上n步随机游动的首次通过概率及首中点分布函数的一类显式 .     

The fine triangle intersections for maximum kite packings

In this paper, the fine triangle intersection problem for a pair of maximum kite packings is investigated. Let Fin(v) = {(s,t) : a pair of maximum kite packings of order v intersecting in s blocks and s+t triangles}. Let Adm(v) = {(s, t) : s + t ≤ bv , s,t are non-negative integers}, where b v = v(v 1)/8 . It is established that Fin(v) = Adm(v)\{(bv-1, 0), (bv-1,1)} for any integer v ≡ 0, 1 (mod 8) and v ≥ 8; Fin(v) = Adm(v) for any integer v ≡ 2, 3, 4, 5, 6, 7 (mod 8) and v ≥ 4.     

On Mod-p Alon-Babai-Suzuki Inequality

Alon, Babai and Suzuki proved the following theorem: Let p be a prime and let K, L be two disjoint subsets of {0, 1, ... , p – 1}. Let |K| = r, |L| = s, and assume r(s – r + 1) p – 1 and n s + k _r where k _r is the maximal element of K. Let be a family of subsets of an n-element set. Suppose that (i) |F| K (mod p) for each F ;(ii) |E F| L (mod p) for each pair of distinct sets E, F . Then

Fibrés d'intersection

Let f:XSbe a projective morphism of Noetherian schemes. We assume fpurely of relative dimension dand finite Tor-dimensional. We associate to d+1 invertible sheaves on Xa line bundle I _X/S ( ) on Sdepending additively on the , commuting to good base changes and which represents the integral along the fibres of fof the product of the first Chern classes of the . If d=0, I _X/S ( ) is the norm N _X/S ( ).     

A decision-theoretic framework for comparing heuristics

In this paper we describe a decision-theoretic framework for comparing a number of heuristics in terms of accuracy for a given combinatorial optimization problem. The procedure takes both expected accuracy and downside risk into account and is quite easy to implement.     

软可换BCI-代数

将软集合理论应用到可换BCI-代数中,给出了软可换BCI-代数的概念,讨论了软可换BCI-代数和软BCI-代数之间的关系,研究了软可换BCI-代数的扩展交、限制交、限制并以及限制差分等性质.最后,研究了软可换BCI-代数的同态性质.