Switching systems and entropy

Switching systems are non-autonomous dynamical systems obtained by switching between two or more autonomous dynamical systems as time goes on. They can be mainly found in control theory, physics, economy, biomathematics, chaotic cryptography and of course in the theory of dynamical systems, in both discrete and continuous time. Much of the recent interest in these systems is related to the emergence of new properties by the mechanism of switching, a phenomenon known in the literature as Parrondo's paradox. In this paper we consider a discrete-time switching system composed of two affine transformations and show that the switched dynamics has the same topological entropy as the switching sequence. The complexity of the switching sequence, as measured by the topological entropy, is fully transferred, for example, to the switched dynamics in this particular case.     

Edge decompositions into two kinds of graphs

Let H be an arbitrary graph and let K_1,2 be the 2-edge star. By a {K_1,2,H}-decomposition of a graph G we mean a partition of the edge set of G into subsets inducing subgraphs isomorphic to K_1,2 or H. Let J be an arbitrary connected graph of odd size. We show that the problem to decide if an instance graph G has a {K_1,2,H}-decomposition is NP-complete if H has a component of an odd size and H≠pK_1,2∪qJ, where pK_1,2∪qJ is the disjoint union of p copies of K_1,2 and q copies of J. Moreover, we prove polynomiality of this problem for H=qJ.     

Inducing regulation of any digraphs

For a given structure D (digraph, multidigraph, or pseudodigraph) and an integer r large enough, a smallest inducing r-regularization of D is constructed. This regularization is an r-regular superstructure of the smallest possible order with bounded arc multiplicity, and containing D as an induced substructure. The sharp upper bound on the number, ρ, of necessary new vertices among such superstructures for n-vertex general digraphs D is determined, ρ being called the inducing regulation number of D. For being the maximum among semi-degrees in D, simple n-vertex digraphs D with largest possible ρ are characterized if either or (where the case is not a trivial subcase of ).     

On the GF(p) Linear Complexity of Hall's Sextic Sequences and Some Cyclotomic-Set-Based

Klapper (1994) showed that there exists a class of geometric sequences with the maximal possible linear complexity when considered as sequences over $GF(2)$, but these sequences have very low linear complexities when considered as sequences over $GF(p)(p$ is an odd prime). This linear complexity of a binary sequence when considered as a sequence over $GF(p)$ is called $GF(p)$ complexity. This indicates that the binary sequences with high $GF(2)$ linear complexities are inadequate for security in the practical application, while, their $GF(p)$ linear complexities are also equally important, even when the only concern is with attacks using the Berlekamp-Massey algorithm [Massey, J. L., Shift-register synthesis and bch decoding, {\it IEEE Transactions on Information Theory}, {\bf 15}(1), 1969, 122--127]. From this perspective, in this paper the authors study the $GF(p)$ linear complexity of Hall''s sextic residue sequences and some known cyclotomic-set-based sequences.     

Spherical Radon transform and the average of the condition number on certain Schubert subvarieties of a Grassmannian

We study the average complexity of certain numerical algorithms when adapted to solving systems of multivariate polynomial equations whose coefficients belong to some fixed proper real subspace of the space of systems with complex coefficients. A particular motivation is the study of the case of systems of polynomial equations with real coefficients. Along these pages, we accept methods that compute either real or complex solutions of these input systems. This study leads to interesting problems in Integral Geometry: the question of giving estimates on the average of the normalized condition number along great circles that belong to a Schubert subvariety of the Grassmannian of great circles on a sphere. We prove that this average equals a closed formula in terms of the spherical Radon transform of the condition number along a totally geodesic submanifold of the sphere.     

Modified multiscale permutation entropy algorithm and its application for multiscroll chaotic systems

To analyze the complexity of continuous chaotic systems better, the modified multiscale permutation entropy (MMPE) algorithm is proposed. Characteristics and parameter choices of the MMPE algorithm are investigated. The comparative study between MPE and MMPE shows that MMPE has better robustness for identifying different chaotic systems when the scale factor τ takes large values. Compared with MPE, MMPE algorithm is more suitable for analyzing the complexity of time series as it has τ time series. For its application, MMPE algorithm is used to calculate the complexity of multiscroll chaotic systems. Results show that complexity of multiscroll chaotic systems does not increase as scroll number increases. Discussions based on first‐order difference operation present a reasonable explanation on why the complexity does not increase. This complexity analysis method lays a theoretical as well as experimental basis for the applications of multiscroll chaotic systems. © 2014 Wiley Periodicals, Inc. Complexity 21: 52–58, 2016     

The expectation and variance of the joint linear complexity of random periodic multisequences

The linear complexity of sequences is one of the important security measures for stream cipher systems. Recently, in the study of vectorized stream cipher systems, the joint linear complexity of multisequences has been investigated. By using the generalized discrete Fourier transform for multisequences, Meidl and Niederreiter determined the expectation of the joint linear complexity of random N-periodic multisequences explicitly. In this paper, we study the expectation and variance of the joint linear complexity of random periodic multisequences. Several new lower bounds on the expectation of the joint linear complexity of random periodic multisequences are given. These new lower bounds improve on the previously known lower bounds on the expectation of the joint linear complexity of random periodic multisequences. By further developing the method of Meidl and Niederreiter, we derive a general formula and a general upper bound for the variance of the joint linear complexity of random N-periodic multisequences. These results generalize the formula and upper bound of Dai and Yang for the variance of the linear complexity of random periodic sequences. Moreover, we determine the variance of the joint linear complexity of random periodic multisequences with certain periods.     

求解$P_*(\kappa)$阵线性互补问题的宽邻域Dikin型高阶内点算法

Based on the idea of Dikin-type primal-dual affine scaling method for linear programming, we describe a high-order Dikin-type algorithm for P. （κ）-matrix linear complementarity problem in a wide neighborhood of the central path, and its polynomial-time complexity bound is given. Finally, two numerical experiments are provided to show the effectiveness of the proposed algorithms.