Design of controller for Lur’e systems guaranteeing dichotomy

In this paper, the problem of controller design for Lur’e systems guaranteeing dichotomy is investigated. On the basis of Kalman-Yakubovich-Popov (KYP) lemma and two frequency equalities, a new methodology for the dichotomy analysis of the Lur’e systems is proposed. A linear matrix inequality (LMI) based criterion is derived, which is equivalent to the Leonov’s frequency-domain one, while for the dichotomy analysis and synthesis which is more straightforward than the frequency-domain one. In virtue of this result, a dynamic output feedback controller ensuring the dichotomy property for Lur’e systems is designed. Finally a numerical example is included to demonstrate the validity and the applicability of the proposed approach.     

A stochastic Ramsey theorem

We establish a stochastic extension of Ramsey's theorem. Any Markov chain generates a filtration relative to which one may define a notion of stopping times. A stochastic colouring is any k-valued (k<∞) colour function defined on all pairs consisting of a bounded stopping time and a finite partial history of the chain truncated before this stopping time. For any bounded stopping time θ and any infinite history ω of the Markov chain, let ω|θ denote the finite partial history up to and including the time θ(ω). Given k=2, for every ?>0, we prove that there is an increasing sequence θ₁<θ₂<? of bounded stopping times having the property that, with probability greater than 1−?, the history ω is such that the values assigned to all pairs (ω|θi,θj), with i<j, are the same. Just as with the classical Ramsey theorem, we also obtain an analogous finitary stochastic Ramsey theorem. Furthermore, with appropriate finiteness assumptions, the time one must wait for the last stopping time (in the finitary case) is uniformly bounded, independently of the probability transitions. We generalise the results to any finite number k of colours.     

Loose Hamilton cycles in hypergraphs

We prove that any k-uniform hypergraph on n vertices with minimum degree at least contains a loose Hamilton cycle. The proof strategy is similar to that used by Kühn and Osthus for the 3-uniform case. Though some additional difficulties arise in the k-uniform case, our argument here is considerably simplified by applying the recent hypergraph blow-up lemma of Keevash.     

MEXIT: Maximal un-coupling times for stochastic processes

Classical coupling constructions arrange for copies of the same Markov process started at two different initial states to become equal as soon as possible. In this paper, we consider an alternative coupling framework in which one seeks to arrange for two different Markov (or other stochastic) processes to remain equal for as long as possible, when started in the same state. We refer to this “un-coupling” or “maximal agreement” construction as MEXIT, standing for “maximal exit”. After highlighting the importance of un-coupling arguments in a few key statistical and probabilistic settings, we develop an explicit MEXIT construction for stochastic processes in discrete time with countable state-space. This construction is generalized to random processes on general state-space running in continuous time, and then exemplified by discussion of MEXIT for Brownian motions with two different constant drifts.     

Möbius transformation and a version of Schwarz lemma in octonionic analysis

The octonion is a generalization of complex to noncommutative and nonassociative space which has closed relation with exception geometries, wave equation, Yang‐Mills equations, black hole, string theory, and special relativity. In this paper, the Möbius transformation in this manner is first introduced, and some properties are discussed about the transformation in octonionic analysis. Some technique lemmas will be given to solve the problems caused by the weak form of associativity. These versions of Schwarz lemma and Schwarz‐Pick lemma are first studied in octonionic setting which will invoke integral representation formula for harmonic function and Möbius transformations. This will generalize the corresponding results which appear in the classical function theory to nonassociative space and may give new energy for the development of physics.     

Abel's lemma on summation by parts and basic hypergeometric series

Basic hypergeometric series identities are revisited systematically by means of Abel's lemma on summation by parts. Several new formulae and transformations are also established. The author is convinced that Abel's lemma on summation by parts is a natural choice in dealing with basic hypergeometric series.     

Separation properties of induced I(L)-topological spaces

The concept of induced I(L)-topological spaces has been introduced by Kubiak (Ph.D. Thesis, UAM, Poznan, 1985) and independently by Wang (Kexue Tongbao 34 (5) (1989) 333). In this paper, the separation properties in the sense of Hutton–Reilly of induced I(L)-topological spaces are investigated. The main result of the paper is a characterization of L-topological spaces by means of the appropriate Hutton–Reilly separation properties of its induced I(L)-topological space.     

Henstock引理,导函数的可积性,积分原函数的可导性

对经典实分析非绝对积分理论中的Henstock引理的本质特征进行了讨论,指出:Henstock引理的本质是刻划了导函数的可积性和积分原函数的可导性问题.     

Adaptive synchronization of a critical chaotic system

This paper further investigates the synchronization problem of a new chaotic system with known or unknown system parameters. Based on the Lyapunov stability theory, a novel adaptive control law is derived for the synchronization of a new chaotic system with known or unknown system parameters. Theoretical analysis and numerical simulations show the effectiveness and feasibility of the proposed schemes.