一个新的混沌系统的动力学分析及混沌控制

提出了一个新的混沌系统,研究了其基本动力学特性.设计了实现该系统的混沌电路,电路实验结果验证了系统的混沌行为.根据Lyapunov稳定性理论,采用自适应backstepping控制方法,把系统控制到一个有界点.数值仿真证明了该方法的有效性和可行性.     

Exact Solution to an Extremal Problem on Graphic Sequences with a Realization Containing Every 2-Tree on k Vertices

A simple graph G is a 2-tree if G=K_3,or G has a vertex v of degree 2,whose neighbors are adjacent,and G-v is a 2-tree.Clearly,if G is a 2-tree on n vertices,then |E(G)|=2 n-3.A non-increasing sequence π=(d_1,...,d_n) of nonnegative integers is a graphic sequence if it is realizable by a simple graph G on n vertices.[Acta Math.Sin.Engl.Ser.,25,795-802(2009)] proved that if k≥2,n≥9/2 k~2+19/2 k and π=(d_1,...,d_n) is a graphic sequence with∑_(i=1)~n di(k-2)n,then π has a realization containing every 1-tree(the usual tree) on k vertices.Moreover,the lower bound(k-2)_n is the best possible.This is a variation of a conjecture due to Erdos and Sos.In this paper,we investigate an analogue problem for 2-trees and prove that if k≥3 is an integer with k≡i(mod 3),n≥ 20[k/3] ~2+31[k/3]+12 and π=(d_1,...,d_n) is a graphic sequence with ∑_(i=1)~n d_imax{k-1)(n-1), 2 [2 k/3] n-2 n-[2 k/3] ~2+[2 k/3]+1-(-1)~i}, then π has a realization containing every 2-tree on k vertices.Moreover,the lower bound max{(k-1)(n-1), 2[2 k/3]n-2 n-[2 k/3] ~2+[2 k/3]+1-(-1)~i}is the best possible.This result implies a conjecture due to [Discrete Math.Theor.Comput.Sci.,17(3),315-326(2016)].     

Generating multi-layer nested chaotic attractor and its FPGA implementation

Complex chaotic sequences are widely employed in real world, so obtaining more complex sequences have received highly interest. For enhancing the complexity of chaotic sequences, a common approach is increasing the scroll-number of attractors. In this paper, a novel method to control system for generating multi-layer nested chaotic attractors is proposed.At first, a piecewise(PW) function, namely quadratic staircase function, is designed. Unlike pulse signals, each level-logic of this function is square constant, and it is easy to realize. Then, by introducing the PW functions to a modified Chua's system with cubic nonlinear terms, the system can generate multi-layer nested Chua's attractors. The dynamical properties of the system are numerically investigated. Finally, the hardware implementation of the chaotic system is used FPGA chip.Experimental results show that theoretical analysis and numerical simulation are right. This chaotic oscillator consuming low power and utilization less resources is suitable for real applications.     

蕴含K5-e图的度序列

设σ（G，n）是具有下述性质的最小正偶数，每一项和至少为σ（G．n）的n项可图序列π都有一个实现包台G作为于图．本文给出σ（K5-e，7）=32,σ（K5-e,8）=36。以及当n≥9时．σ（K5-e,n）=2[（5n/6）/2]．     

Types of two-dimensionalN = 4 superconformal field theories

Various types ofN = 4 superconformal symmetries in two dimensions are considered. It is proposed that apart from the well-known cases ofSU (2)and SU(2) × SU(2) ×U (1), their Kac-Moody symmetry can also be SU(2) × (U (1))⁴. Operator product expansions for the last case are derived. A complete free field realization for the same is obtained     

The Realization of 4-dimensional 3-Lie Algebras

In this paper, we mainly investigate the realization of 3-Lie algebras from a family of Lie algebras. We prove the realization theorem, offer a concrete example realizing all type of 4-dimensional 3-Lie algebras, and also give some properties about semi-simple n-Lie algebras.     

Cut points in metric spaces

In this note, we will define topological and virtual cut points of finite metric spaces and show that, though their definitions seem to look rather distinct, they actually coincide. More specifically, let X denote a finite set, and let denote a metric defined on X. The tight span T(D) of D consists of all maps for which f(x)=sup_yX(xy−f(x)) holds for all xX. Define a map fT(D) to be a topological cut point of D if T(D)−{f} is disconnected, and define it to be a virtual cut point of D if there exists a bipartition (or split) of the support of f into two non-empty sets A and B such that ab=f(a)+f(b) holds for all points aA and bB. It will be shown that, for any given metric D, topological and virtual cut points actually coincide, i.e., a map fT(D) is a topological cut point of D if and only if it is a virtual cut point of D.