Ideal Systems and Connecting Orbits

In this paper,we study a class of dynamical systems in Rn - ideal systems and give an existence criterion of quasi-connecting orbits for such systems. Also, an existence criterion of connecting orbits for general systems is given.     

On Elliptic Systems in the Unit Ball of C2, Including Those Degenerate on the Boundary

In this paper we formulate some problems for the Fuether and invariant Fuether systems which turn out to be uniquely solvable in the unit ball of C².     

Representations of the solutions of the first-order elliptic and hyperbolic systems via harmonic and wave functions respectively

ABSTRACT

In this paper representations of the solutions of all first-order elliptic and hyperbolic systems in three-dimensional and four-dimensional spaces are obtained through the derivatives of harmonic and wave functions, respectively.     

Equations in the Q-completion of a torsion-free hyperbolic group

In this paper we prove the algorithmic solvability of finite systems of equations over the Q-completion of a torsion-free hyperbolic group.

     

Primitive recursive analogues of regular cardinals based on ordinal representation systems for KPi and KPM

In this paper, we develop primitive recursive analogues of regular cardinals by using ordinal representation systems for KPi and KPM. We also define primitive recursive analogues of inaccessible and hyperinaccessible cardinals. Moreover, we characterize the primitive recursive analogue of the least (uncountable) regular cardinal.     

An abstract version of the Morse index theorem and its application to hypersurfaces of constant mean curvature

In [5] Smale generalized the Morse index theorem (originally proved by Morse in [3]) to elliptic partial differential systems in several independent variables. Smale's result was used by Simons in [4] to obtain the index theorem for minimal submanifolds. The purpose of this paper is to give an abstract version of the Morse index theorem and use it to prove an index theorem for hypersurfaces of constant mean curvature. This was sugested by Barbosa and do Carmo in [1].     

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).     

An operator-theoretic approach to theorems of the Pick-Nevanlinna and Carathéodory types

In this paper we deal with singularities of the linear systems of plane curves passing through S, where S is a zerodimensional closed subscheme of degree n of P ²=P _k ² ,k an algebraically closed field of any characteristic. We determine the least degree of a nonsingular curve passing through S, when S is in uniform position. This paper was written while the author was member of C.N.R., Sez. 3 of G.N.S.A.G.A. and was supported by M.P.I. funds     

连续自映射拓扑压的两个注记

令T:X→ X是紧度量空间(X,d)上的连续映射.该文给出了T的拓扑压和T在非游荡集上的限制的拓扑压相等的不依赖于变分原理的一个直接证明.同时,还讨论了半共轭的两个系统的拓扑压之间的关系,证明了拓扑压在一致有限对一条件下是半共轭不变量.     

Global classification of the planar Lotka–Volterra differential systems according to their configurations of invariant straight lines

In this article, we study the Lotka–Volterra planar quadratic differential systems. We denote by LV systems all systems which can be brought to a Lotka–Volterra system by an affine transformation and time homotheties. All these systems possess invariant straight lines. We classify the family of LV systems according to their geometric properties encoded in the configurations of invariant straight lines which these systems possess. We obtain a total of 65 such configurations which are distinguished, roughly speaking, by the multiplicity of their invariant lines and by the multiplicities of the singularities of the systems located on these lines. We determine an algebraic subvariety of \mathbbR¹²{\mathbb{R}^{12}} which contains all these systems and we find the bifurcation diagram of the configurations of LV systems within this algebraic subvariety, in terms of polynomial invariants with respect to the group action of affine transformations and time homotheties. This geometric classification will serve as a basis for the full topological classification of LV systems.     

A remark on banks theorem

ABSTRACT

For discrete autonomous dynamical systems, it was found that in the three conditions defining Devaney chaos, topological transitivity and dense periodic points together imply sensitive dependence on initial condition (Banks, Brooks, Cairns, Davis and Stacey, On Devaney's definition of chaos, The Amer. Math. Monthly 99 (1992), pp. 332–334). In this paper, we give the definition of finitely generated non-autonomous dynamical systems (NADS) and generalize the Banks et al. theorem to the finitely generated NADS.     

Infinitely many non-constant periodic solutions with negative fixed energy for Hamiltonian systems

ABSTRACT

In this paper, we obtain the existence of infinitely many non-constant periodic solutions with negative fixed energy for a class of second-order Hamiltonian systems, which greatly improves the existing results such as Zhang [Periodic solutions for some second order Hamiltonian systems. Nonlinearity. 2009;22(9):2141–2150, Theorem 1.5]. Moreover, we exhibit two simple and instructive examples to make our result more clear, which have not been solved by known results.     

On Linear Implicit Non-autonomous Systems of Difference Equations

This paper deals with the solvability of initial-value problems (IVPs) and multipoint boundary-value problems (MPBVPs) for linear implicit non-autonomous systems of difference equations.     

Game-theoretic coupled riccati equations associated to controlled linear differential systems with jump markov perturbations

In this paper we investigate several properties of the stabilizing solution of a class of systems of Riccati type differential equations with indefinite sign associated to controlled systems described by differential equations with Markovian jumping.

We show that the existence of a bounded on R ₊ and stabilizing solution for this class of systems of Riccati type differential equations is equivalent to the solvability of a control-theoretic problem, namely disturbance attenuation problem.

If the coefficients of the considered system are theta;-periodic functions then the stabilizing solution is also theta;-periodic and if the coefficients are asymptotic almost periodic functions, then the stabilizing solution is also asymptotic almost periodic and its almost periodic component is a stabilizing solution for a system of Riccati type differential equations defined on the whole real axis. One proves also that the existence of a stabilizing and bounded on R ₊ solution of a system of Riccati differential equations with indefinite sign is equivalent to the existence of a solution to a corresponding system of matrix inequalities. Finally, a minimality property of the stabilizing solution is derived.     

The Hardness of Polynomial Equation Solving

Elimination theory was at the origin of algebraic geometry in the nineteenth century and now deals with the algorithmic solving of multivariate polynomial equation systems over the complex numbers or, more generally, over an arbitrary algebraically closed field. In this paper we investigate the intrinsic sequential time complexity of universal elimination procedures for arbitrary continuous data structures encoding input and output objects of elimination theory (i.e., polynomial equation systems) and admitting the representation of certain limit objects. Our main result is the following: let there be given such a data structure and together with this data structure a universal elimination algorithm, say P, solving arbitrary parametric polynomial equation systems. Suppose that the algorithm P avoids unnecessary branchings and that P admits the efficient computation of certain natural limit objects (as, e.g., the Zariski closure of a given constructible algebraic set or the parametric greatest common divisor of two given algebraic families of univariate polynomials). Then P$ cannot be a polynomial time algorithm. The paper contains different variants of this result and discusses their practical implications.     

Weingarten surfaces and nonlinear partial differential equations

The sine-Gordon equation has been known for a long time as the equation satisfied by the angle between the two asymptotic lines on a surface inR ³ with constant Gauss curvature –1. In this paper, we consider the following question: Does any other soliton equation have a similar geometric interpretation? A method for finding all the equations that have such an interpretation using Weingarten surfaces inR ³ is given. It is proved that the sine-Gordon equation is the only partial differential equation describing a class of Weingarten surfaces inR ³ and having a geometricso(3)-scattering system. Moreover, it is shown that the elliptic Liouville equation and the elliptic sinh-Gordon equation are the only partial differential equations describing classes of Weingarten surfaces inR ³ and having geometricso(3,C)-scattering systems.     

Approximate Factorization in Shallow Water Applications

We consider the numerical integration of problems modelling phenomena in shallow water in 3 spatial dimensions. If the governing partial differential equations for such problems are spatially discretized, then the right-hand side of the resulting system of ordinary differential equations can be split into terms f ₁, f ₂, f ₃ and f ₄, respectively representing the spatial derivative terms with respect to the x, y and z directions, and the interaction terms. It is typical for shallow water applications that the interaction term f ₄ is nonstiff and that the function f ₃ corresponding with the vertical spatial direction is much more stiff than the functions f ₁ and f ₂ corresponding with the horizontal spatial directions. The reason is that in shallow seas the gridsize in the vertical direction is several orders of magnitude smaller than in the horizontal directions. In order to solve the initial value problem (IVP) for these systems numerically, we need a stiff IVP solver, which is necessarily implicit, requiring the iterative solution of large systems of implicit relations. The aim of this paper is the design of an efficient iteration process based on approximate factorization. Stability properties of the resulting integration method are compared with those of a number of integration methods from the literature. Finally, a performance test on a shallow water transport problem is reported.     

Planforms in three dimensions

The spatially periodic, steady-state solutions to systems of partial differential equations (PDE) are calledplanforms. There already exists a partial classification of the planforms for Euclidean equivariant systems of PDE inR ² (see [6, 7]), In this article we attempt to give such a classification for Euclidean equivariant systems of PDE inR ³. Based on the symmetry and spatial periodicity of each planform, 59 different planforms are found.We attempt to find the planforms on all lattices inR ³ that are forced to exist near a steady-state bifurcation from a trivial solution. The proof of our classification uses Liapunov-Schmidt reduction with symmetry (which can be used if we assume spatial periodicity of the solutions) and the Equivariant Branching Lemma. The analytical problem of finding planforms for systems of PDE is reduced to the algebraic problem of computing isotropy subgroups with one dimensional fixed point subspaces.The Navier-Stokes equations and reaction-diffusion equations (with constant diffusion coefficients) are examples of systems of PDE that satisfy the conditions of our classifications. In this article, we show that our classification applies to the Kuramoto-Sivashinsky equation.     

Calmness of partially perturbed linear systems with an application to the central path

ABSTRACT

In this paper we develop point-based formulas for the calmness modulus of the feasible set mapping in the context of linear inequality systems with a fixed abstract constraint and (partially) perturbed linear constraints. The case of totally perturbed linear systems was previously analyzed in [Cánovas MJ, López MA, Parra J, et al. Calmness of the feasible set mapping for linear inequality systems. Set-Valued Var Anal. 2014;22:375–389, Section 5]. We point out that the presence of such an abstract constraint yields the current paper to appeal to a notable different methodology with respect to previous works on the calmness modulus in linear programming. The interest of this model comes from the fact that partially perturbed systems naturally appear in many applications. As an illustration, the paper includes an example related to the classical central path construction. In this example we consider a certain feasible set mapping whose calmness modulus provides a measure of the convergence of the central path. Finally, we underline the fact that the expression for the calmness modulus obtained in this paper is (conceptually) implementable as far as it only involves the nominal data.