Variations on a theme by Mark Kac

Mark Kac's theorem on the mean recurrence time in a stationary stochastic process in discrete time with discrete states is taken as the starting point for a series of variations, most of which are formulated in terms of 0–1 processes. Whereas the original theorem deals with the mean recurrence time of a given state under the condition that the state is realized at time 0, this condition is dropped in part of the variations; two others refer to the variance of the recurrence time and two to the Poincaré cycle of a dynamical system. Most variations consist in inequalities and formal identities for the mean first-arrival time and subsequent recurrence times for the given state.     

Oscillations in three-reaction quadratic mass-action systems

It is known that rank-two bimolecular mass-action systems do not admit limit cycles. With a view to understanding which small mass-action systems admit oscillation, in this paper we study rank-two networks with bimolecular source complexes but allow target complexes with higher molecularities. As our goal is to find oscillatory networks of minimal size, we focus on networks with three reactions, the minimum number that is required for oscillation. However, some of our intermediate results are valid in greater generality. One key finding is that an isolated periodic orbit cannot occur in a three-reaction, trimolecular, mass-action system with bimolecular sources. In fact, we characterize all networks in this class that admit a periodic orbit; in every case, all nearby orbits are periodic too. Apart from the well-known Lotka and Ivanova reactions, we identify another network in this class that admits a center. This new network exhibits a vertical Andronov–Hopf bifurcation. Furthermore, we characterize all two-species, three-reaction, bimolecular-sourced networks that admit an Andronov–Hopf bifurcation with mass-action kinetics. These include two families of networks that admit a supercritical Andronov–Hopf bifurcation and hence a stable limit cycle. These networks necessarily have a target complex with a molecularity of at least four, and it turns out that there are exactly four such networks that are tetramolecular.     

再论Mobius变换中的n阶循环群判据

用二阶方阵的幂运算取代Mobius变换的迭代运算,导出了Mobius变换为n阶循环群的判据,并对判据进行了简化,最后给出了它们的应用.     

The traveling salesman problem in graphs with some excluded minors

Given a graph and a length function defined on its edge-set, the Traveling Salesman Problem can be described as the problem of finding a family of edges (an edge may be chosen several times) which forms a spanning Eulerian subgraph of minimum length. In this paper we characterize those graphs for which the convex hull of all solutions is given by the nonnegativity constraints and the classical cut constraints. This characterization is given in terms of excluded minors. A constructive characterization is also given which uses a small number of basic graphs.     

A NECESSARY AND SUFFICIENT CONDITION FOR THE COEXISTENCE OF A CLASS OF CUBIC CURVE SEPARATRIX CYCLES AND LIMIT CYCLES TO THE CUBIC SYSTEM

In this paper, we give the necessary and sufficient condition for the coexistence of a class of cubic curve separatrix cycles and limit cycles to the cubic system, and study their topological structures.     

度和与图中具有给定阶数的点不交的路

设G是一个n阶图，n=∑^ki=1ni，其中,ni≥2(i=1,2,…，k）是整数。我们利用度和给出图G中存在n1,n2，…，nk阶点不交路的充分条件。     

Hamiltonian[k,k+1]-因子

本文考虑n/2-临界图中Hamiltonian[k,k+1]-因子的存在性。Hamiltonian[k,k+1]-因子是指包含Hamiltonian圈的[k,k+1]-因子;给定阶数为n的简单图G,若δ(G)≥n/2而δ(G\e)相似文献   

极限环的表达式和计算

本文提出一种解析法和数值法相结合的方法，用来计算多项式微分系统的极限环，极限环表示为x=∑k≥0(ak cos kφ bk sin kφ),y=∑k≥0(ck cos kφ dk sin kφ)，先用解析法求出小参数时极限环的初始表达式，然后用增量法和迭代法求出任意参数时极限环满足给定精度的表达式，半稳定极限环和分叉值也可以计算。     

一类三次系统极限环的惟一性

讨论三次系统x=x(A0+A1x+A2y+A3xy-A4y2)y=y(x-1)的极限环问题.得到了该系统不存在极限环和存在惟一极限环的条件.     

纵横扩张的优化

得到了最小折数纵横扩张的判别准则．针对4-正则图的平面嵌入的纵横扩张的特殊性，给出了它的最小折数纵横扩张判别准则．