Kirkman triple systems of order 21 with nontrivial automorphism group

There are 50,024 Kirkman triple systems of order 21 admitting an automorphism of order 2. There are 13,280 Kirkman triple systems of order 21 admitting an automorphism of order 3. Together with the 192 known systems and some simple exchange operations, this leads to a collection of 63,745 nonisomorphic Kirkman triple systems of order 21. This includes all KTS(21)s having a nontrivial automorphism group. None of these is doubly resolvable. Four are quadrilateral-free, providing the first examples of such a KTS(21).

     

Classification of Hadamard matrices of order 44 with automorphisms of order 7

The Hadamard matrices of order 44 possessing automorphisms of order 7 are classified. The number of their equivalence classes is 384. The order of their full automorphism group is calculated. These Hadamard matrices yield 1683 nonisomorphic 3-(44,22,10) designs, 57932 nonisomorphic 2-(43,21,10) designs, and two inequivalent extremal binary self-dual doubly even codes of length 88 (one of them being new).     

The Steiner quadruple systems of order 16

The Steiner quadruple systems of order 16 are classified up to isomorphism by means of an exhaustive computer search. The number of isomorphism classes of such designs is 1,054,163. Properties of the designs—including the orders of the automorphism groups and the structures of the derived Steiner triple systems of order 15—are tabulated. A consistency check based on double counting is carried out to gain confidence in the correctness of the classification.     

Classification of scalar third order ordinary differential equations linearizable via generalized contact transformations

Whereas Lie had linearized scalar second order ordinary differential equations (ODEs) by point transformations, and later Chern had extended to the third order by using contact transformation, till recently no work had been done for higher order (or systems) of ODEs. Lie had found a unique class defined by the number of infinitesimal symmetry generators but the more general ODEs were not so classified. Recently, classifications of higher order and systems of ODEs were provided. In this paper we relate contact symmetries of scalar ODEs with point symmetries of reduced systems. We define a new type of transformation that builds upon this relation and obtain equivalence classes of scalar third order ODEs linearizable via these transformations. Four equivalence classes of such equations are seen to exist.     

大系统关于部分变元的指数稳定性

本文利用Lyapunov函数法讨论了大系统关于部分变元的指数稳定性,得到了一些定理.通过把高阶系统看作低阶关联子系统的复合,从而使独立子系统的部分变元指数稳定性反映了整个系统同样的特性.     

Complex analysis in subsystems of second order arithmetic

This research is motivated by the program of Reverse Mathematics. We investigate basic part of complex analysis within some weak subsystems of second order arithmetic, in order to determine what kind of set existence axioms are needed to prove theorems of basic analysis. We are especially concerned with Cauchy’s integral theorem. We show that a weak version of Cauchy’s integral theorem is proved in RCAo. Using this, we can prove that holomorphic functions are analytic in RCAo. On the other hand, we show that a full version of Cauchy’s integral theorem cannot be proved in RCAo but is equivalent to weak König’s lemma over RCAo.     

Estimate of the attraction domain for a class of nonlinear switched systems

We consider a hybrid dynamical system composed of a family of subsystems of nonlinear differential equations and a switching law which determines the order of their operation. It is assumed that subsystems are homogeneous with homogeneity degrees less than one, and zero solutions of all subsystems are asymptotically stable. Using the Lyapunov direct method and the method of differential inequalities, we determine classes of switching laws providing prescribed estimates of domains of attraction for zero solutions of the corresponding hybrid systems. The developed approaches are used for the stabilization of a double integrator.     

ContributionsThe extremal codes of length 42 with automorphism of order 7

All [42, 21, 8] binary self-dual codes with automorphisms of order 7 are enumerated. Up to equivalence there are 16 such codes. These codes are defined with their generator matrices.     

Stability of singularly perturbed switched systems with time delay and impulsive effects

This paper studies the stability properties of singularly perturbed switched systems with time delay and impulsive effects. Such systems are assumed to consist of both unstable and stable subsystems. By using the multiple Lyapunov functions technique and the dwell time approach, some stability criteria are established. Our results show that impulses do contribute in order to obtain stability properties even when the system consists of only unstable subsystems. Numerical examples are presented to verify our theoretical results.     

The Waveform Relaxation method for systems of differential/algebraic equations

This paper reports efforts towards establishing a parallel numerical algorithm known as Waveform Relaxation (WR) for simulating large systems of differential/algebraic equations. The WR algorithm was established as a relaxation based iterative method for the numerical integration of systems of ODEs over a finite time interval. In the WR approach, the system is broken into subsystems which are solved independently, with each subsystem using the previous iterate waveform as “guesses” about the behavior of the state variables in other subsystems. Waveforms are then exchanged between subsystems, and the subsystems are then resolved repeatedly with this improved information about the other subsystems until convergence is achieved.

In this paper, a WR algorithm is introduced for the simulation of generalized high-index DAE systems. As with ODEs, DAE systems often exhibit a multirate behavior in which the states vary as differing speeds. This can be exploited by partitioning the system into subsystems as in the WR for ODEs. One additional benefit of partitioning the DAE system into subsystems is that some of the resulting subsystems may be of lower index and, therefore, do not suffer from the numerical complications that high-index systems do. These lower index subsystems may therefore be solved by less specialized simulations. This increases the efficiency of the simulation since only a portion of the problem must be solved with specially tailored code. In addition, this paper established solvability requirements and convergence theorems for varying index DAE systems for WR simulation.     

Switching adaptive controllers to control fractional‐order complex systems with unknown structure and input nonlinearities

This article investigates the chaos control problem for the fractional‐order chaotic systems containing unknown structure and input nonlinearities. Two types of nonlinearity in the control input are considered. In the first case, a general continuous nonlinearity input is supposed in the controller, and in the second case, the unknown dead‐zone input is included. In each case, a proper switching adaptive controller is introduced to stabilize the fractional‐order chaotic system in the presence of unknown parameters and uncertainties. The control methods are designed based on the boundedness property of the chaotic system's states, where, in the proposed methods the nonlinear/linear dynamic terms of the fractional‐order chaotic systems are assumed to be fully unknown. The analytical results of the mentioned techniques are proved by the stability analysis theorem of fractional‐order systems and the adaptive control method. In addition, as an application of the proposed methods, single input adaptive controllers are adopted for control of a class of three‐dimensional nonlinear fractional‐order chaotic systems. And finally, some numerical examples illustrate the correctness of the analytical results. © 2014 Wiley Periodicals, Inc. Complexity 21: 211–223, 2015     

Translation planes of order 27

Translation planes of order 27 are classified. Various invariants play an important role in a computer search.     

A new approach to the construction of subsystems of complex root systems

Dynkin has shown how subsystems of real root systems may be constructed. As the concept of subsystems of complex root systems is not as well developed as in the real case, in this paper we give an algorithm to classify the proper subsystems of complex proper root systems. Furthermore, as an application of this algorithm, we determine the proper subsystems of imprimitive complex proper root systems. These proper subsystems are useful in giving combinatorial constructions of irreducible representations of properly generated finite complex reflection groups.     

Stability of switched systems with time delay

In this paper, we study the qualitative properties of linear and nonlinear delay switched systems which have stable and unstable subsystems. First, we prove some inequalities which lead to the switching laws that guarantee: (a) the global exponential stability to linear switched delay systems with stable and unstable subsystems; (b) the local exponential stability of nonlinear switched delay systems with stable and unstable subsystems. In addition, these switching laws indicate that if the total activation time ratio among the stable subsystems, unstable subsystems and time delay is larger than a certain number, the switched systems are exponentially stable for any switching signals under these laws. Some examples are given to illustrate the main results.     

Exponential synchronization for fractional‐order chaotic systems with mixed uncertainties

This article focuses on the problem of exponential synchronization for fractional‐order chaotic systems via a nonfragile controller. A criterion for α‐exponential stability of an error system is obtained using the drive‐response synchronization concept together with the Lyapunov stability theory and linear matrix inequalities approach. The uncertainty in system is considered with polytopic form together with structured form. The sufficient conditions are derived for two kinds of structured uncertainty, namely, (1) norm bounded one and (2) linear fractional transformation one. Finally, numerical examples are presented by taking the fractional‐order chaotic Lorenz system and fractional‐order chaotic Newton–Leipnik system to illustrate the applicability of the obtained theory. © 2014 Wiley Periodicals, Inc. Complexity 21: 114–125, 2015     

Second order theories with ordinals and elementary comprehension

We study elementary second order extensions of the theoryID ₁ of non-iterated inductive definitions and the theoryPA _Ω of Peano arithmetic with ordinals. We determine the exact proof-theoretic strength of those extensions and their natural subsystems, and we relate them to subsystems of analysis with arithmetic comprehension plusΠ ₁ ¹ comprehension and bar induction without set parameters. Research supported by the Swiss National Science Foundation     

Infinite classes of anti‐mitre and 5‐sparse Steiner triple systems

In this paper, we present three constructions for anti‐mitre Steiner triple systems and a construction for 5‐sparse ones. The first construction for anti‐mitre STSs settles two of the four unsettled admissible residue classes modulo 18 and the second construction covers such a class modulo 36. The third construction generates many infinite classes of anti‐mitre STSs in the remaining possible orders. As a consequence of these three constructions we can construct anti‐mitre systems for at least 13/14 of the admissible orders. For 5‐sparse STS(υ), we give a construction for υ ≡ 1, 19 (mod 54) and υ ≠ 109. © 2005 Wiley Periodicals, Inc. J Combin Designs 14: 237–250, 2006     

Synchronization of fractional order chaotic systems using active control method

In this article, the active control method is used for synchronization of two different pairs of fractional order systems with Lotka–Volterra chaotic system as the master system and the other two fractional order chaotic systems, viz., Newton–Leipnik and Lorenz systems as slave systems separately. The fractional derivative is described in Caputo sense. Numerical simulation results which are carried out using Adams–Bashforth–Moulton method show that the method is easy to implement and reliable for synchronizing the two nonlinear fractional order chaotic systems while it also allows both the systems to remain in chaotic states. A salient feature of this analysis is the revelation that the time for synchronization increases when the system-pair approaches the integer order from fractional order for Lotka–Volterra and Newton–Leipnik systems while it reduces for the other concerned pair.     

Transformation of high order linear differential-algebraic systems to first order

We study general nonsquare linear systems of differential-algebraic systems of arbitrary order. We analyze the classical procedure of turning the system into a first order system and demonstrate that this approach may lead to different solvability results and smoothness requirements. We present several examples that demonstrate this phenomenon and then derive existence and uniqueness results for differential-algebraic systems of arbitrary order and index. We use these results to identify exactly those variables for which the order reduction to first order does not lead to extra smoothness requirements and demonstrate the effects of this new formulation with a numerical example.Dedicated to Richard S. Varga on the occasion of his 77th birthday.