The Computational Complexity of the Chow Form

We present a bounded probability algorithm for the computation of the Chowforms of the equidimensional components of an algebraic variety. In particular, this gives an alternative procedure for the effective equidimensional decomposition of the variety, since each equidimensional component is characterized by its Chow form. The expected complexity of the algorithm is polynomial in the size and the geometric degree of the input equation system defining the variety. Hence it improves (or meets in some special cases) the complexity of all previous algorithms for computing Chow forms. In addition to this, we clarify the probability and uniformity aspects, which constitutes a further contribution of the paper. The algorithm is based on elimination theory techniques, in line with the geometric resolution algorithm due to M. Giusti, J. Heintz, L. M. Pardo, and their collaborators. In fact, ours can be considered as an extension of their algorithm for zero-dimensional systems to the case of positive-dimensional varieties. The key element for dealing with positive-dimensional varieties is a new Poisson-type product formula. This formula allows us to compute the Chow form of an equidimensional variety from a suitable zero-dimensional fiber. As an application, we obtain an algorithm to compute a subclass of sparse resultants, whose complexity is polynomial in the dimension and the volume of the input set of exponents. As another application, we derive an algorithm for the computation of the (unique) solution of a generic overdetermined polynomial equation system.     

Regularity of Harmonic Functions in Cheeger-Type Sobolev Spaces

We give a geometric approach to the study of the regularity of harmonic functions in Cheeger-type Sobolev spaces, and prove the Hölder continuity of such functions. In the proof, we give a definition of an upper curvature bound of the unit sphere of a Banach space, which seems to be of independent interest.     

Pauli-Fierz Hamiltonians defined as quadratic forms

We study Pauli-Fierz Hamiltonians-self-adjoint operators describing a small quantum system interacting with a bosonic field. Using quadratic form techniques, we extend the results of Dereziński-Gérard and Gérard about the self-adjointness, the location of the essential spectrum and the existence of a ground state to a large class of Pauli-Fierz Hamiltonians.     

Combinatorics of normal sequences of braids

Many natural counting problems arise in connection with the normal form of braids—and seem to have not been much considered so far. Here we solve some of them. One of the noteworthy points is that a number of different induction schemes appear. The key technical ingredient is an analysis of the normality condition in terms of permutations and their descents, in the vein of the Solomon algebra. As was perfectly summarized by a referee, the main result asserts that the size of the automaton involved in the automatic structure of Bn associated with the normal form can be lowered from n! to p(n), the number of partitions of n.     

主范式的运算性质

研究了极大项、极小项的运算性质 ,利用这些性质给出了求 A,A∨ B,A∧ B,A→ B,A B的主范式的公式 ,由此可用程序化的方法求任意公式的主范式 .     

Higher discriminants of binary forms

We propose a method for constructing systems of polynomial equations that define submanifolds of degenerate binary forms of an arbitrary degeneracy degree. __________ Translated from Teoreticheskaya i Matematicheskaya Fizika, Vol. 153, No. 2, pp. 147–157, November, 2007.     

Electromagnetic properties of strange baryons in a relativistic quark model

We present some of our results for the electromagnetic properties of excited Σ hyperons, computed within the framework of the Bonn constituent-quark model, which is based on the Bethe-Salpeter approach. The seven parameters entering the model are fitted against the best-known baryon masses. Accordingly, the results for the form factors and helicity amplitudes are genuine predictions. We compare with the scarce experimental data available and discuss the processes in which Σ ^*'s may play an important role.     

正定矩阵标准型的复合矩阵的一般形式

实对称正定矩阵的复合矩阵正定性的研究已有结论,但对于一般意义下的正定矩阵的复合矩阵是否仍然是正定的研究需要利用一般的正定矩阵的标准形的复合矩阵进行讨论,给出了一般公式及具体算法,为讨论其复合矩阵的正定性提供了基础条件.     

G-网络排队系统的研究新进展

在研究排队网络的文献中,G-网络(即推广的排队网络)最近受到了国际学者广泛的关注,它的研究在一定程度上丰富了排队网络的内容.正因为有很多学者投入到此项研究中,新的结果是层出不穷的.本文简短地介绍G-网络近年来的发展.