On the heritability of the property <Emphasis Type="Italic">D</Emphasis><Subscript><Emphasis Type="Italic">π</Emphasis></Subscript> by subgroups

We consider the so-called Jordan-Pochhammer systems, a special class of linear Pfaffian systems of Fuchsian type on complex linear (or projective) spaces. These systems appeared as systems of differential equations for hypergeometric type integrals in which the integrand is a product of powers of linear functions. These systems also arise in some reductions of the Knizhnik-Zamolodchikov equations. The main advantage of these systems is the possibility of presenting a basis in the solution space of such systems in an explicit integral form and, as a consequence, of describing their monodromy representation. The main focus in the paper is placed on the applications of Jordan-Pochhammer systems. We describe the relationship of Jordan-Pochhammer systems to isomonodromic deformations of Fuchsian systems that are described by the Schlesinger equations, as well as to the linearization of the dynamical system of bending spatial polygons. We also describe the application of Jordan-Pochhammer systems to constructing Kohno systems on the Manin-Schechtman configuration spaces.     

Regular reduction of controlled Hamiltonian system with symplectic structure and symmetry

In this paper, our goal is to study the regular reduction theory of regular controlled Hamiltonian (RCH) systems with symplectic structure and symmetry, and this reduction is an extension of regular symplectic reduction theory of Hamiltonian systems under regular controlled Hamiltonian equivalence conditions. Thus, in order to describe uniformly RCH systems defined on a cotangent bundle and on the regular reduced spaces, we first define a kind of RCH systems on a symplectic fiber bundle. Then we introduce regular point and regular orbit reducible RCH systems with symmetry by using momentum map and the associated reduced symplectic forms. Moreover, we give regular point and regular orbit reduction theorems for RCH systems to explain the relationships between RpCH-equivalence, RoCH-equivalence for reducible RCH systems with symmetry and RCH-equivalence for associated reduced RCH systems. Finally, as an application we regard rigid body and heavy top as well as them with internal rotors as the regular point reducible RCH systems on the rotation group SO(3) and on the Euclidean group SE(3), as well as on their generalizations, respectively, and discuss their RCH-equivalence. We also describe the RCH system and RCH-equivalence from the viewpoint of port Hamiltonian system with a symplectic structure.     

Generalized radix representations and dynamical systems. I

Summary We are concerned with families of dynamical systems which are related to generalized radix representations. The properties of these dynamical systems lead to new results on the characterization of bases of Pisot number systems as well as canonical number systems.     

RECURSIVE SYSTEM IDENTIFICATION

Most of existing methods in system identification with possible exception of those for linear systems are off-line in nature, and hence are nonrecursive. This paper demonstrates the recent progress in recursive system identification. The recursive identification algorithms are presented not only for linear systems （multivariate ARMAX systems） but also for nonlinear systems such as the Hammerstein and Wiener systems, and the nonlinear ARX systems. The estimates generated by the algorithms are online updated and converge a.s. to the true values as time tends to infinity.     

Polling systems with multiple coupled servers

We consider polling systems with multiple coupled servers. We explore the class of systems that allow an exact analysis. For these systems we present distributional results for the waiting time, the marginal queue length, and the joint queue length at polling epochs. The class in question includes several single-queue systems with a varying number of servers, two-queue two-server systems with exhaustive service and exponential service times, as well as infinite-server systems with an arbitrary number of queues, exhaustive or gated service, and deterministic service times.     

一类Toeplitz线性方程组与多项式除法的复杂性

本文给出带状Toeplitz线性方程组,带状三角Toeplitz线性方程组求解的快速方法,其方法基于三角Toeplitz方程与Toeplitz方程的快速求解.并由此给出了一般多次式除法的新算法.     

On the solution of inequality systems relevant to IC-layout

Many problems arising in CAD systems for VLSI design, such as layout computation and compaction as well as channel routing, can be reduced to the solution of a certain class of systems of linear inequalities. The complexity of the solution of such systems is studied. The results show that CAD systems manipulating merely the geometry of the layout without changing its topology can be efficiently implemented. However, systems that are also able to change the topology of the layout have to solve hard, i.e., NP-complete, problems.     

A theory for synchronization of dynamical systems

In this paper, a theory for synchronization of multiple dynamical systems under specific constraints is developed from a theory of discontinuous dynamical systems. The concepts on synchronization of two or more dynamical systems to specific constraints are presented. The synchronization, desynchronization and penetration of multiple dynamical systems to multiple specified constraints are discussed, and the necessary and sufficient conditions for such synchronicity are developed. The synchronicity of two dynamical systems to a single specific constraint and to multiple specific constraints is investigated. Finally, the synchronization and the corresponding complexity for multiple slave systems with multiple master systems are discussed briefly. The meaning of synchronization for dynamical systems with constraints is extended as a generalized, universal concept. The theory presented in this paper may be as a universal theory for dynamical systems. The paper provides a theoretic frame work in order to control slave systems which can be synchronized with master systems through specific constraints in a general sense.     

First Steps Towards an Institution of Algebra Replacement Systems

Algebra replacement systems are introduced as formal models of state dependent and state transforming systems. The first part of an institution of algebra replacement systems is developed, that is, a model theoretic and logical framework that can be used to describe and reason about such systems. The usual operational understanding of a replacement system as a labeled transition system is then considered as one particular model in the model category. Under appropriate conditions such a constructed replacement system is initial.     

On movable singularities of Garnier systems

We study movable singularities of Garnier systems by using an approach based on the relationship between these systems and Schlesinger isomonodromic deformations of Fuchsian systems, as well as Lauricella hypergeometric equations.     

Output feedback stabilization for a class of nonlinear time-evolution systems

A variety of problems in nonlinear time-evolution systems such as communication networks, computer networks, manufacturing, traffic management, etc., can be modelled as min–max-plus systems in which operations of min, max and addition appear simultaneously. Systems with only maximum (or minimum) constraints can be modelled as max-plus system and handled by max-plus algebra which changes the original nonlinear system in the traditional sense into linear system in this framework. Min-max-plus systems are extensions of max-plus systems and nonlinear even in the max-plus algebra view. Output feedback stabilization for min–max-plus systems with min–max-plus inputs and max-plus outputs is considered in this paper. Max-plus projection representation for the closed-loop system with min–max-plus output feedback is introduced and the formula to calculate the cycle time is presented. Stabilization of reachable systems with at least one observable state and a further result for reachable and observable systems are worked out, during which max-plus output feedbacks are used to stabilize the systems. The method based on the max-plus algebra is constructive in nature.     

Self-Dual Hamiltonians as Deformations of Free Systems

We formulate the problem of finding self-dual Hamiltonians (associated with integrable systems) as deformations of free systems given on various symplectic manifolds and discuss several known explicit examples including the recently found double elliptic Hamiltonians. We consider self-duality as the basic principle, while duality in integrable systems (of the Toda/Calogero/Ruijsenaars type) comes as a secondary notion (degenerations of self-dual systems).     

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.     

Three and four-body systems in one dimension: Integrability,superintegrability and discrete symmetries

Families of three-body Hamiltonian systems in one dimension have been recently proved to be maximally superintegrable by interpreting them as one-body systems in the three-dimensional Euclidean space, examples are the Calogero, Wolfes and Tramblay Turbiner Winternitz systems. For some of these systems, we show in a new way how the superintegrability is associated with their dihedral symmetry in the three-dimensional space, the order of the dihedral symmetries being associated with the degree of the polynomial in the momenta first integrals. As a generalization, we introduce the analysis of integrability and superintegrability of four-body systems in one dimension by interpreting them as one-body systems with the symmetries of the Platonic polyhedra in the four-dimensional Euclidean space. The paper is intended as a short review of recent results in the sector, emphasizing the relevance of discrete symmetries for the superintegrability of the systems considered.     

System of vector quasi-variational inclusions with some applications

In this paper, we consider systems of vector quasi-variational inclusions which include systems of vector quasi-equilibrium problems for multivalued maps, systems of vector optimization problems and several other systems as special cases. We establish existence results for solutions of these systems. As applications of our results, we derive the existence results for solutions of system vector optimization problems, mathematical programs with systems of vector variational inclusion constraints and bilevel problems. Another application of our results provides the common fixed point theorem for a family of lower semicontinuous multivalued maps. Further applications of our results for existence of solutions of systems of vector quasi-variational inclusions are given to prove the existence of solutions of systems of Minty type and Stampacchia type generalized implicit quasi-variational inequalities. The results of this paper can be seen as extensions and generalizations of several known results in the literature.     

On stability for switched linear positive systems

This paper addresses the stability properties of switched linear positive systems in continuous-time as well as in discrete-time. In the discrete-time case, some sufficient and necessary conditions for asymptotic stability are derived for pairs of second order systems. Similar conditions are also established for a finite number of second order systems. Furthermore, for higher order systems, some results on stability are provided in a similar manner. In particular, in this case, a common linear Lyapunov function guaranteeing the stability of the switched positive systems can be easily located by means of geometry properties. In the continuous-time case, a finite number of second order systems are considered. Some equivalent conditions for stability of such systems are developed.     

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.     

On regular and singular interval systems

We give a survey on interval linear systems discussing problems for regular systems as well as for singular ones. We consider several solution sets and direct methods to enclose them. Moreover we study iterative methods, particularly the total step method as the basis for other ones. We also use this method for enclosing solutions of singular linear systems.     

Grothendieck Inclusion Systems

Inclusion systems have been introduced in algebraic specification theory as a categorical structure supporting the development of a general abstract logic-independent approach to the algebra of specification (or programming) modules. Here we extend the concept of indexed categories and their Grothendieck flattenings to inclusion systems. An important practical significance of the resulting Grothendieck inclusion systems is that they allow the development of module algebras for multi-logic heterogeneous specification frameworks. At another level, we show that several inclusion systems in use in some syntactic (signatures, deductive theories) or semantic contexts (models) appear as Grothendieck inclusion systems too. We also study several general properties of Grothendieck inclusion systems.     

Fractal tiles associated with shift radix systems

Shift radix systems form a collection of dynamical systems depending on a parameter r which varies in the d-dimensional real vector space. They generalize well-known numeration systems such as beta-expansions, expansions with respect to rational bases, and canonical number systems. Beta-numeration and canonical number systems are known to be intimately related to fractal shapes, such as the classical Rauzy fractal and the twin dragon. These fractals turned out to be important for studying properties of expansions in several settings.In the present paper we associate a collection of fractal tiles with shift radix systems. We show that for certain classes of parameters r these tiles coincide with affine copies of the well-known tiles associated with beta-expansions and canonical number systems. On the other hand, these tiles provide natural families of tiles for beta-expansions with (non-unit) Pisot numbers as well as canonical number systems with (non-monic) expanding polynomials.We also prove basic properties for tiles associated with shift radix systems. Indeed, we prove that under some algebraic conditions on the parameter r of the shift radix system, these tiles provide multiple tilings and even tilings of the d-dimensional real vector space. These tilings turn out to have a more complicated structure than the tilings arising from the known number systems mentioned above. Such a tiling may consist of tiles having infinitely many different shapes. Moreover, the tiles need not be self-affine (or graph directed self-affine).