一类生态系统的周期解的全局渐近稳定性

本文研究了有三个种群相互作用的数学模式: 我们分别建立了系统(*)和(**)存在唯一的大范围渐近稳定的正周期解的充分条件.     

Hammerstein型非线性积分方程正解的个数

<正> 本文是作者工作[8]、[9]的继续.在[9]中作者利用Leray-Schauder拓扑度理论研究了多项式型Hammerstein非线性积分方程的固有值,即设     

Involutorische Automorphismen von Laguerre-Ebenen mit genau zwei Fixpunkten

A miquelian Laguerre-plan of characteristic 2 can be characterized by the property that for each pair {A, B} of non parallel points there exists an involutoric automorphism whose set of fixed points is exactly {A, B}.     

Symmetrische Minkowski-Ebenen

The theory of Minkowski-planes has been initiated by W.Benz as an abstraction of the geometry of plane sections of a non degenerated ruled quadric in three-dimensional projective space. We give some basic definitions and concepts of this theory, including a list of properties of circle-bundles in symmetric Minkowski-planes. Finite Minkowski planes of even order are symmetric.Minkowski-planes may be interpreted as the geometries of sharply triply sets of permutations. The most important properties of Minkowski-planes are expressed in terms of these permutation sets. In § 6 some facts on ovoidal Minkowski-planes are discussed.     

一类生化反应的三分子模型的定性分析

本文讨论生物化学中一类三分子反应的数学模型:(?)应用常微分方程定性分析的方法,对系统(*)在第一象限内的奇点的类型和性质进行了研究。并得到下列结果: (1) 当ac≥b^1/2时,系统(*)在第一象限内无极限环; (2) 当ac1/2时,证明了极限环的存在性。     

On the automorphism group of inversive planes of odd order

The structure of the fix bundle free automorphism groups of inversive planes of odd order is determined. As a special case of our main result, the automorphism groups with a transitive action on the points of an inversive plane of odd order are essentially determined, and the plane is shown to be miquelian when these have no non-trivial normal subgroups of odd order.     

Cliffords Kreisesatz für miquelsche Benz-Ebenen

A new proof of Clifford's circle theorem is given, which is based upon simple properties of angles between Clifford circles. Necessarily, the cases are included, where some Clifford circles degenerate to points.?The proof is valid for all miquelian Benz-planes. Received 8 November 1999.     

Limit cycles for a perturbation of a quadratic center with symmetry

To estimate the number of limit cycles appearing under a perturbation of a quadratic system that has a center with symmetry, we use the method of generalized Dulac functions. To this end, we reduce the perturbed system to a Liénard system with a small parameter, for which we construct a Dulac function depending on the parameter. This permits one to estimate the number of limit cycles in the perturbed system for all sufficiently small parameter values. We find the Dulac function by solving a linear programming problem. The suggested method is used to analyze four specific perturbed systems that globally have exactly three limit cycles [i.e., the limit cycle distribution 3 or (3, 0)] and two systems that have the limit cycle distribution (3, 1) (i.e., one nest around each of the two foci).     

具有面积测度的一些仿射联络空间

<正> 为了要把 K 展空间和具有 K 重面积测度的空间结合起来,笔者和谷超豪讨论过具有两种结构的一些空间,第一种结构是:空间具有 K 维面积测度,就是说:对于空间的任何 K 维可微分流形 V_K 的一部分给定了一个 K 重积分,作为这部分的“面积”;第     

Connection Formulas for Second Order Differential Equations with a Complex Parameter and Having an Arbitrary Number of Turning Points

We consider the differential equation on a finite interval I, where I contains m turning points, that is here, zeros of ?. Using asymptotic estimates proved by R. E. LANGER for solutions of (*) for intervals containing only one turning point we derive asymptotic estimates (for ρ → ) for a special fundamental system of solutions of (*) in I. The results obtained are fundamental for the investigation of eigenvalue problems defined by (*) and suitable boundary conditions.     

A non-miquelian Laguerre plane satisfying a theorem of miquelian type

This note shows that a theorem of miquelian type known as (M2) holds in a certain non miquelian Laguerre plane of shear type as defined by Löwen and Pfüller[1].Dedicated to Professor H. Karzel on the occasion of his 70th birthday     

Nonlinear oscillations in business cycle model with time lags

In this paper we analyse the dynamics of the Kaldor–Kalecki business cycle model. This model is based on the classical Kaldor model in which capital stock changes are caused by past investment decisions. This lag is connected with time delay needed for new capital to be installed. The dynamics of the model is reduced to the form of damped oscillator with negative feedback connected with lag parameter and next it is analysed in terms of bifurcation theory. We find conditions for existence and persistence of oscillatory behaviour which is represented by limit cycle on some central manifold in phase space, i.e., single Hopf bifurcation. We demonstrate that the Hopf cycles may be exhibited for nonzero measure set of the parameter space. The conditions for bifurcation of co-dimension two connected with interaction of bifurcations as well as bifurcation diagrams are also given. Finally, we obtain numerical values describing an amplitude and a period of oscillation for different parameter of the system. It is also proved that while the investment function is not nonlinear a quasi-periodic solution (a 1:2 resonant double Hopf point) can appear. The source of such a behaviour is rather a consequence of time lag than nonlinearity of the investment function. Our results confirm the existence of asymmetric (two periodic) cycles in the Kaldor–Kalecki model with time-to-build.     

Oscillation theory of first order functional differential equations with deviating arguments

Summary New oscillation criteria are established for the first order functional differential equation (*) y'(t)+p(t)y(g(t))=0and its nonlinear analogue. The results are presented so that a remarkable duality existing between the case where (*) is retarded (g(t)t) is apparent. Possible extension of the results for (*) to equations with several deviating arguments is attempted. Finally, it is shown that there exists a class of autonomous equations for which the oscillation situation can be completely characterized.     

1-Factorizations of cartesian products of regular graphs

Let G₁, G₂…, G_n be regular graphs and H be the Cartesian product of these graphs (H = G₁ × G₂ × … × G_n). The following will be proved: If the set {G₁, G₂…, G_n} has at leat one of the following properties: (*) for at leat one i ? {1, 2,…, n}, there exists a 1-factorization of G_i or (**) there exists at least two numbers i and j such that 1 ≤ i < j ≤ n and both the Graphs G_i and G_j contain at least one 1-factor, then there exists a 1-factorization of H. Further results: Let F be a cycle of length greater than three and let G be an arbitrary cubic graph. Then there exists a 1-factorization of the 5-regular graph H = F × G. The last result shows that neither (*) nor (**) is a necessary condition for the existence of a 1-factorization of a Cartesian product of regular graphs.     

一类Lyness方程的一些性质

本文主要研究下列Lyness方程的性质Xn+1=Xn\(a+b0Xn+b1Xn-1+…+bkXn-k)Xn-k-1,n=0,1,2,…,其中a,b0,b,…,bk∈[0,∞),a+k∑i=0bi＞0,k∈{0,1,2,…}.文中给出了方程(*)严格振动的充分条件,以及环长和环上极值的位置.另外,还得到了方程(*)在特殊情况下分别具有4,5,6周期的必要充分条件.本文的结果改进并推广了一些已知结果.     

Efficient global optimization algorithm assisted by multiple surrogate techniques

Surrogate-based optimization proceeds in cycles. Each cycle consists of analyzing a number of designs, fitting a surrogate, performing optimization based on the surrogate, and finally analyzing a candidate solution. Algorithms that use the surrogate uncertainty estimator to guide the selection of the next sampling candidate are readily available, e.g., the efficient global optimization (EGO) algorithm. However, adding one single point at a time may not be efficient when the main concern is wall-clock time (rather than number of simulations) and simulations can run in parallel. Also, the need for uncertainty estimates limits EGO-like strategies to surrogates normally implemented with such estimates (e.g., kriging and polynomial response surface). We propose the multiple surrogate efficient global optimization (MSEGO) algorithm, which adds several points per optimization cycle with the help of multiple surrogates. We import uncertainty estimates from one surrogate to another to allow use of surrogates that do not provide them. The approach is tested on three analytic examples for nine basic surrogates including kriging, radial basis neural networks, linear Shepard, and six different instances of support vector regression. We found that MSEGO works well even with imported uncertainty estimates, delivering better results in a fraction of the optimization cycles needed by EGO.     

Counterexamples to Grötzsch-Sachs-Koester's conjecture

Let G be a 4-regular planar graph and suppose that G has a cycle decomposition S (i.e., each edge of G is in exactly on cycle of the decomposition) with every pair of adjacent edges on a face always in different cycles of S. Such a graph G arises as a superposition of simple closed curves in the plane with tangencies disallowed. Grötzsch-Sachs-Koester's conjecture states that if the cycles of G can be partitioned into four classes, such that two cycles in the same classes are disjoint, G is vertex 3-colorable. In this note, the conjecture is disproved.     

Chorded Cycles

A chord is an edge between two vertices of a cycle that is not an edge on the cycle. If a cycle has at least one chord, then the cycle is called a chorded cycle, and if a cycle has at least two chords, then the cycle is called a doubly chorded cycle. The minimum degree and the minimum degree-sum conditions are given for a graph to contain vertex-disjoint chorded (doubly chorded) cycles containing specified elements of the graph, i.e., specified vertices, specified edges as cycle-edges, specified paths, or specified edges as chords. Furthermore, the minimum degree condition is given for a graph to be partitioned into chorded cycles containing specified edges as cycle-edges.     

Short cycle structures for graphs on surfaces and an open problem of Mohar and Thomassen

In this paper we investigate cycle base structures of a (weighted) graph and show that much information of short cycles is contained in an MCB (i.e., minimum cycle base). After setting up a Hall type theorem for base-transformation, we give a sufficient and necessary condition for a cycle base to be an MCB. Furthermore, we show that the structure of MCB in a (weighted) graph is unique. The property is also true for those having a longest length (although much work has been down in evaluating MCB, little is known for those having a longest length). We use those methods to find out some unknown properties for short cycles sharing particular properties in (unweighted) graphs. As applications, we determine the structures of short cycles in an embedded graph and show that there exist polynomially bounded algorithms in finding a shortest contractible cycle and a shortest two-sided cycle provided such cycles exist. Those answer an open problem of B. Mohar and C. Thomassen.