动力系统简介

本文对动力系统这一学科的历史、理论、应用以及与其他学科的联系作一简介.     

Lemniscates and inequalities for the logarithmic capacities of continua

It is shown that if P(z) = z ⁿ + ? is a polynomial with connected lemniscate E(P) = {z: ¦P(z)¦ ≤ 1} and m critical points, then, for any n? m+1 points on the lemniscate E(P), there exists a continuum γ ? E(P) of logarithmic capacity cap γ ≤ 2^?1/n which contains these points and all zeros and critical points of the polynomial. As corollaries, estimates for continua of minimum capacity containing given points are obtained.     

The property of being polynomial for Mal’tsev constraint satisfaction problems

A combinatorial constraint satisfaction problem aims at expressing in unified terms a wide spectrum of problems in various branches of mathematics, computer science, and AI. The generalized satisfiability problem is NP-complete, but many of its restricted versions can be solved in a polynomial time. It is known that the computational complexity of a restricted constraint satisfaction problem depends only on a set of polymorphisms of relations which are admitted to be used in the problem. For the case where a set of such relations is invariant under some Mal’tsev operation, we show that the corresponding constraint satisfaction problem can be solved in a polynomial time. __________ Translated from Algebra i Logika, Vol. 45, No. 6, pp. 655–686, November–December, 2006.     

关于艾森斯坦因判别法的间接应用

探讨了间接应用艾森斯坦因判别法判断整系数多项式在有理数域上不可约的两种途径.     

Minimum concave cost production system: A further generalization of multi-echelon model

We will consider a concave minimization problem associated with a series production system in which raw material is processed inm consecutive facilities. The products at some facility are either sent to the next facility or stocked in the warehouse. The amount of demand for the final products during periodi, i = 1,,n, are known in advance. Our problem is to minimize the sum of processing, holding and backlogging cost, all of which are assumed to be concave.The origin of this model is the classical economic lot size problem of Wagner and Whitin and was extensively studied by Zangwill. This model is very important from the theoretical as well as practical point of view and this is one of the very rare instances in which polynomial time algorithm has been constructed for concave minimization problems.The purpose of this paper is to extend the model further to the situation in which time lag is associated with processing at each facility. We will propose an efficient O(n ⁴ m) algorithm for this class of problems.     

On the average length of lexicographic paths

A bound is given for the average length of a lexicographic path, a definition that is motivated by degeneracies encountered when using the randomized simplex method.     

On the Permanental Polynomials of Some Graphs

Let G be a simple graph with adjacency matrix A(G) and (G,x) the permanental polynomial of G. Let G × H denotes the Cartesian product of graphs G and H. Inspired by Kleins idea to compute the permanent of some matrices (Mol. Phy. 31 (3) (1976) 811–823), in this paper in terms of some orientation of graphs we study the permanental polynomial of a type of graphs. Here are some of our main results.1.If G is a bipartite graph containing no subgraph which is an even subdivision of K _2,3, then G has an orientation G ^e such that (G,x) = det (xI-A(G ^e )), where A(G ^e ) denotes the skew adjacency matrix of G ^e.2.Let G be a 2-connected outerplanar bipartite graph with n vertices. Then there exists a 2-connected outerplanar bipartite graph with 2n+2 vertices such that (G,x) is a factor of .3.Let T be an arbitrary tree with n vertices. Then , where ₁ , ₂ , ..., _n are the eigenvalues of T.     

Hosoya polynomials of armchair open‐ended nanotubes

For a connected graph G we denote by d(G,k) the number of vertex pairs at distance k. The Hosoya polynomial of G is H(G,x) = ∑_k≥0 d(G,k)x^k. In this paper, analytical formulae for calculating the polynomials of armchair open‐ended nanotubes are given. Furthermore, the Wiener index, derived from the first derivative of the Hosoya polynomial in x = 1, and the hyper‐Wiener index, from one‐half of the second derivative of the Hosoya polynomial multiplied by x in x = 1, can be calculated. © 2006 Wiley Periodicals, Inc. Int J Quantum Chem, 2007     

Liquid Densities and Excess Molar Volumes for Binary Systems (Ionic Liquids + Methanol or Water) at 298.15, 303.15 and 313.15 K,and at Atmospheric Pressure

Binary excess molar volumes, V _m ^E, have been evaluated from density measurements, using a vibrating tube densimeter over the entire composition range for binary liquid mixtures of ionic liquids 1-ethyl-3-methyl-imidazolium diethyleneglycol monomethylethersulphate [EMIM]⁺[CH₃(OCH₂CH₂)₂OSO₃]⁻ or 1-butyl-3-methyl-imidazolium diethyleneglycol monomethylethersulphate [BMIM]⁺[CH₃(OCH₂CH₂)₂OSO₃]⁻ or 1-methyl-3-octyl-imidazolium diethyleneglycol monomethylethersulphate [MOIM]⁺[CH₃(OCH₂CH₂)₂OSO₃]⁻+methanol and [EMIM]⁺[CH₃(OCH₂CH₂)₂OSO₃]⁻+water at 298.15, 303.15 and 313.15 K. The V _m ^E values were found to be negative for all systems studied. The V _m ^E results are explained in terms of intermolecular interactions and packing effects. The experimental data were fitted by the Redlich-Kister polynomial.     

Superized Troesch complexes and cohomology for strict polynomial superfunctors

We adapt a construction due to Troesch to the category of strict polynomial superfunctors in order to construct complexes of injective objects whose cohomology is isomorphic to Frobenius twists of the (super)symmetric power functors. We apply these complexes to construct injective resolutions of the even and odd Frobenius twist functors, to investigate the structure of the Yoneda algebra of the Frobenius twist functor, and to compute other extension groups between strict polynomial superfunctors. By an equivalence of categories, this also provides cohomology calculations in the category of left modules over Schur superalgebras.