Probability relations involving several subsystems

We consider the question of factorizability in tensor product spaces, and argue that the correlations associated with entangled states are even more problematic in the general case involving any tensor product of Hilbert spaces, than in the Einstein, Podolsky, and Rosen case with only two [1].     

应用灰色统计进行纺织产品的抉择

本文利用灰色系统理论处理问题的特点,以一纺织厂对三种产品优化抉择为例,提出了用灰色统计综合评判的方法进行产品块择,取得了较满意的效果,为纺织产品的生产抉择提供了一个新的科学方法。     

铸件成品率微机管理系统

建立了铸件成品率的数学模型，以实现铸件成品率的微机管理．该系统具有统计、分析、判断、优化等各项功能，满足了生产现场对铸件成本的控制．     

Enumeration of perfect matchings of a type of Cartesian products of graphs

Let G be a graph and let Pm(G) denote the number of perfect matchings of G.We denote the path with m vertices by P_m and the Cartesian product of graphs G and H by G×H. In this paper, as the continuance of our paper [W. Yan, F. Zhang, Enumeration of perfect matchings of graphs with reflective symmetry by Pfaffians, Adv. Appl. Math. 32 (2004) 175-188], we enumerate perfect matchings in a type of Cartesian products of graphs by the Pfaffian method, which was discovered by Kasteleyn. Here are some of our results:1. Let T be a tree and let C_n denote the cycle with n vertices. Then Pm(C₄×T)=∏(2+α²), where the product ranges over all eigenvalues α of T. Moreover, we prove that Pm(C₄×T) is always a square or double a square.2. Let T be a tree. Then Pm(P₄×T)=∏(1+3α²+α⁴), where the product ranges over all non-negative eigenvalues α of T.3. Let T be a tree with a perfect matching. Then Pm(P₃×T)=∏(2+α²), where the product ranges over all positive eigenvalues α of T. Moreover, we prove that Pm(C₄×T)=[Pm(P₃×T)]².     

一些特殊图类乘积的离散度

连通图的离散度是用s(G)来表示的,s(G)=max{ω(G-S)-|S|:ω(G-S)>1,SV(G)}.给出了两个完全图乘积的和一个完全图与路的乘积的离散度.还给出了两个完全图乘积的坚韧度.     

Estimates of covering numbers of convex sets with slowly decaying orthogonal subsets

Covering numbers of precompact symmetric convex subsets of Hilbert spaces are investigated. Lower bounds are derived for sets containing orthogonal subsets with norms of their elements converging to zero sufficiently slowly. When these sets are convex hulls of sets with power-type covering numbers, the bounds are tight. The arguments exploit properties of generalized Hadamard matrices. The results are illustrated by examples from machine learning, neurocomputing, and nonlinear approximation.     

Optimally Stable Multivariate Bases

We show that the tensor product B-spline basis and the triangular Bernstein basis are in some sense best conditioned among all nonnegative bases for the spaces of tensor product splines and multivariate polynomials, respectively. We also introduce some new condition numbers which are analogs of component-wise condition numbers for linear systems introduced by Skeel.     

Superposition, Entanglement, and Product of States

The superposition relation extended to the statistical operators is shown to be invariant under tensor product and partial trace operations. Particular mathematical examples of superposition are characterized as well as the nature of the Schmidt decomposition of pure states superposition of other pure states.     

Comparison of higher-order accurate schemes for solving the two-dimensional unsteady Burgers' equation

This paper is devoted to the testing and comparison of numerical solutions obtained from higher-order accurate finite difference schemes for the two-dimensional Burgers' equation having moderate to severe internal gradients. The fourth-order accurate two-point compact scheme, and the fourth-order accurate Du Fort Frankel scheme are derived. The numerical stability and convergence are presented. The cases of shock waves of severe gradient are solved and checked with the fourth-order accurate Du Fort Frankel scheme solutions. The present study shows that the fourth-order two-point compact scheme is highly stable and efficient in comparison with the fourth-order accurate Du Fort Frankel scheme.     

Weaving hadamard matrices with maximum excess and classes with small excess

Weaving is a matrix construction developed in 1990 for the purpose of obtaining new weighing matrices. Hadamard matrices obtained by weaving have the same orders as those obtained using the Kronecker product, but weaving affords greater control over the internal structure of matrices constructed, leading to many new Hadamard equivalence classes among these known orders. It is known that different classes of Hadamard matrices may have different maximum excess. We explain why those classes with smaller excess may be of interest, apply the method of weaving to explore this question, and obtain constructions for new Hadamard matrices with maximum excess in their respective classes. With this method, we are also able to construct Hadamard matrices of near‐maximal excess with ease, in orders too large for other by‐hand constructions to be of much value. We obtain new lower bounds for the maximum excess among Hadamard matrices in some orders by constructing candidates for the largest excess. For example, we construct a Hadamard matrix with excess 1408 in order 128, larger than all previously known values. We obtain classes of Hadamard matrices of order 96 with maximum excess 912 and 920, which demonstrates that the maximum excess for classes of that order may assume at least three different values. Since the excess of a woven Hadamard matrix is determined by the row sums of the matrices used to weave it, we also investigate the properties of row sums of Hadamard matrices and give lists of them in small orders. © 2004 Wiley Periodicals, Inc. J Combin Designs 12: 233–255, 2004.