Related papers: Admissibility and nonuniform polynomial dichotomie…
The irreducible decomposition of a unitary representation often contains continuous spectrum when restricted to a non-compact subgroup. The author singles out a nice class of branching problems where each irreducible summand occurs…
By considering the nonuniform exponential dichotomy spectrum, we introduce a global asymptotic nonuniform stability conjecture for nonautonomous differential systems, whose restriction to the autonomous case is related to the classical…
Inertial manifold theory, saddle point property and exponential dichotomy have been treated as different topics in the literature with different proofs. As a common feature, they all have the purpose of `splitting' the space to understand…
This paper is devoted to the study of nonautonomous multivalued semiflows and their associated pullback attractors. For this kind of dynamical systems we are able to characterize the upper and lower bounds of the attractor as complete…
We develop theory concerning non-uniform complexity in a setting in which the notion of single-pass instruction sequence considered in program algebra is the central notion. We define counterparts of the complexity classes P/poly and…
We start by defining an approach to non-monotonic probabilistic reasoning in terms of non-monotonic categorical (true-false) reasoning. We identify a type of non-monotonic probabilistic reasoning, akin to default inheritance, that is…
In this paper, ordinary and exponential dichotomies are defined in differential equations with equations with piecewise constant argument of general type. We prove the asymptotic equivalence between the bounded solutions of a linear system…
The most general nonuniform reaction-diffusion models on a one-dimensional lattice with boundaries, for which the time evolution equations of corre- lation functions are closed, are considered. A transfer matrix method is used to find the…
We present sufficient conditions under which a given linear nonautonomous system and its nonlinear perturbation are topologically conjugated. Our conditions are of a very general form and provided that the nonlinear perturbations are…
In this paper, we first establish a criterion based on contractive function for the existence of polynomial attractors. This criterion only involves some rather weak compactness associated with the repeated limit inferior and requires no…
Deciding whether a graph can be embedded in a grid using only unit-length edges is NP-complete, even when restricted to binary trees. However, it is not difficult to devise a number of graph classes for which the problem is polynomial, even…
Verification of discrete time or continuous time dynamical systems over the reals is known to be undecidable. It is however known that undecidability does not hold for various classes of systems: if robustness is defined as the fact that…
The extended Hamilton's Principle and other methods proposed to handle non-holonomic constraints are considered. They dont agree with each other. By looking at its consistency with D'Alembert's principle for linear non-holonomic…
The no invariant line fields conjecture is one of the main outstanding problems in traditional complex dynamics. In this paper we consider non-autonomous iteration where one works with compositions of sequences of polynomials with suitable…
Cubic and quartic non-autonomous differential equations with continuous piecewise linear coefficients are considered. The main concern is to find the maximum possible multiplicity of periodic solutions. For many classes, we show that the…
Super-stability and strong stability are properties of a matching in the stable matching problem with ties. In this paper, we introduce a common generalization of super-stability and strong stability, which we call non-uniform stability.…
We study the smoothness properties of a global and nonautonomous topological conjugacy between a linear system and a quasilinear perturbation. The linear system exhibits a nonuniform exponential dichotomy with a nontrivial projector and…
In the literature two notions of the word problem for a variety occur. A variety has a decidable word problem if every finitely presented algebra in the variety has a decidable word problem. It has a uniformly decidable word problem if…
We consider the semiring of abstract finite dynamical systems up to isomorphism, with the operations of alternative and synchronous execution. We continue searching for efficient algorithms for solving polynomial equations of the form $P(X)…
Polynomials are common algebraic structures, which are often used to approximate functions including probability distributions. This paper proposes to directly define polynomial distributions in order to describe stochastic properties of…