非保守力学系统Nielsen方程的形式不变性

研究非保守力学系统Nielsen方程的形式不变性.给出非保守力学系统Nielsen方程的形式不变性的定义和判据,研究形式不变性和Noether对称性的关系,并举例说明结果的应用 关键词： 非保守力学系统 Nielsen方程 形式不变性 Noether对称性     

THE EIGENVALUE PERTURBATION BOUND FOR ARBITRARY MATRICES

In this paper we present some new absolute and relative perturbation bounds for theeigenvalue for arbitrary matrices, which improves some recent results. The eigenvalueinclusion region is also discussed.     

和式∑k=0^nμ^kf（k）的发生函数算法

利用普通幂级数发生函数方法，通过对发生函数进行xD算子，得到和式∑k=0^nμ^kf（k）的计算公式，并计算该类和式＋     

Stability and bifurcation in a delayed predator-prey system with Beddington-DeAngelis functional response

We consider a delayed predator-prey system with Beddington-DeAngelis functional response. The stability of the interior equilibrium will be studied by analyzing the associated characteristic transcendental equation. By choosing the delay τ as a bifurcation parameter, we show that Hopf bifurcation can occur as the delay τ crosses some critical values. The direction and stability of the Hopf bifurcation are investigated by following the procedure of deriving normal form given by Faria and Magalhães. An example is given and numerical simulations are performed to illustrate the obtained results.     

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.