An algorithm for then×n optimum assignment problem

In this paper we present an algorithm for finding an optimum assignment for ann×n matrixM inn iterations. The method uses systematic permutations on the rows ofM and is based on the properties of optimum assignments. The implementation presented in the paper requires at mostO(n ³) in time andn ²+6n memory locations for solving a densen×n problem.This work was supported by the National Science Foundation Grant NSF ENG 74-19788.     

Poincaré cycles and ergodic behavior of a linear diatomic chain

The ergodic behavior of a linear diatomic chain is shown to be analogous to that of a linear monatomic chain. Starting with the expressions for the time-relaxed correlation functions between any two particles in the chain, we show that the existence of Poincaré cycles is not inconsistent with the development of an equilibrium state. Also, we show that those dynamical variables that are ergodic for the linear monoatomic chain remain ergodic in the diatomic chain. It is shown that the autocorrelation functions for particles with equal or different masses decay in time ast ^–1/2 .This work was completed when the author was associated with the Institute for Fluid Dynamics and Applied Mathematics, University of Maryland and supported by the United States Air Force through the Air Force Office of Scientific Research of the Air Research and Development Command under contract No. AF18(600)1315.     

Cycle Action on Treelike Structures

The purpose of this paper is to study the action on cycles of several known classes of oligomorphic groups, that is, infinite permutation groups of countable degree having only finitely many orbits on k-sets for each k. The groups studied here are all related to trees and treelike relational structures. The sequence whose k-th term is the number of orbits in the action on k-cycles is called Parker sequence. It turns out that, if we are dealing with the automorphism group of a suitable relational structure, this sequence counts also the finite substructures admitting a cyclic automorphism; in calculating these sequences for various groups, we shall thus describe and enumerate such substructures.Di più dirò: ch’a gli alberi dà vita [I shall say more: the trees are given life spirito uman che sente e che ragiona. by a human spirit that perceives and reasons.Di più dirò: ch’a gli alberi dà vita spirito uman che sente e che ragiona. Per prova sollo; io n’ho la voce udita che nel cor flebilmente anco mi suona.[I shall say more: the trees are given life by a human spirit that perceives and reasons. I know it by experience: I heard their voice and it still resounds faintly in my heart.]Torquato Tasso, Gerusalemme liberata, XIII, 49     

Bifurcation of small limit cycles in cubic integrable systems using higher-order analysis

In this paper, we present a method of higher-order analysis on bifurcation of small limit cycles around an elementary center of integrable systems under perturbations. This method is equivalent to higher-order Melinikov function approach used for studying bifurcation of limit cycles around a center but simpler. Attention is focused on planar cubic polynomial systems and particularly it is shown that the system studied by ?o?a?dek (1995) [24] can indeed have eleven limit cycles under perturbations at least up to 7th order. Moreover, the pattern of numbers of limit cycles produced near the center is discussed up to 39th-order perturbations, and no more than eleven limit cycles are found.     

A concrete example with multiple limit cycles for three dimensional Lotka–Volterra systems

The number of limit cycles for three dimensional Lotka–Volterra systems is an open problem. Recently, Yu et al. (2016) constructed some examples with the possibility of the existence of four limit cycles. Unfortunately, multiple limit cycles are not visible by numerical simulations, because all of them are very close to the interior equilibrium and extremely small. We present a concrete example with multiple limit cycles for three dimensional Lotka–Volterra systems which we can confirm them by numerical simulations. First we prepare the modified formula to compute coefficients of the normal form for the generalized Hopf bifurcation. Applying this formula to three dimensional Lotka–Volterra competitive systems with the aid of the computer algebra system, we derive the critical parameter values explicitly such that the interior equilibrium is exactly an unstable weak focus. Also we show that the heteroclinic cycle on the boundary of ${\mathbb{R}}_{+}^3$ is repelling. This implies that there exists a stable limit cycle by the Poincare–Bendixson theorem. Then, adding some suitable perturbations to parameters, we generate additional two limit cycles near the interior equilibrium by the generalized Hopf bifurcation. Finally we confirm that there exist three limit cycles by numerical simulations.     

Productivity optimization of microalgae cultivation in a batch photobioreactor process

We address the question of mean biomass volumetric productivity optimization, which originates from the simplification of dynamics of microalgae in a batch bioreactor process with light incidence. In particular, the stability of the model is analyzed, some optimality necessary conditions for the nonsmooth optimization problem obtained through the inclusion of different photoperiods are studied, and the model is applied in the particular case of Chlamydomonas reinhardtii microalgae to validate our results.     

Extremal graphs for the k‐flower

The Turán number of a graph H, , is the maximum number of edges in any graph of order n that does not contain an H as a subgraph. A graph on vertices consisting of k triangles that intersect in exactly one common vertex is called a k‐fan, and a graph consisting of k cycles that intersect in exactly one common vertex is called a k‐flower. In this article, we determine the Turán number of any k‐flower containing at least one odd cycle and characterize all extremal graphs provided n is sufficiently large. Erdős, Füredi, Gould, and Gunderson determined the Turán number for the k‐fan. Our result is a generalization of their result. The addition aim of this article is to draw attention to a powerful tool, the so‐called progressive induction lemma of Simonovits.     

市场接纳不确定下短周期新产品产能投资研究 ——考虑竞争的投资时机与规模决策

新产品的市场接纳具有很大不确定性,传统投资理论并不适用于新产品投资。针对新产品投资中的产能投资,研究了垄断企业和有成本差异的竞争企业制定短周期新产品的产能投资时机与规模策略。给定企业“早”和“晚”两个投资时机可供选择,定义“早”投资时,企业只知道新产品市场规模的期望和方差;“晚”投资时,企业知道新产品真实的市场规模。垄断企业进入市场之前无法进行销售信息的收集,只会选择“早”投资或者不投资,给出其选择“早”投资的条件、最优产能投资规模及最大期望利润。有成本差异企业竞争的情形可以分为四种,分别给出四种情形下的最优产能投资规模及最大期望利润,并通过比较各情形下两企业的最大期望利润给出最优的产能投资时机策略。     

A new class of Ramsey-Turán problems

We introduce and study a new class of Ramsey-Turán problems, a typical example of which is the following one:Let ε>0 and G be a graph of sufficiently large order n with minimum degree δ(G)>3n/4. If the edges of G are colored in blue or red, then for all k∈[4,⌊(1/8−ε)n⌋], there exists a monochromatic cycle of length k.