On chaotic set-valued discrete dynamical systems

Let (X, d) be a metric space and let f: (X, d) → (X, d) be a continuous map. In this note we investigate the relationships between the chaoticity of some set-valued discrete dynamical systems associated to f (collective chaos) and the chaoticity of f (individual chaos).     

A note on chaos via Furstenberg family couple

The concepts of the first type of distributional chaos in the Tan-Xiong sense (Abbrev. DC1 in the Tan-Xiong sense), the second type of strong-distributional chaos (Abbrev. strong DC2) and the third type of strong-distributional chaos (Abbrev. strong DC3) were introduced by Tan et al. [F. Tan, J. Xiong. Chaos via Furstenberg family couple, Topology Appl. (2008), doi:10.1016/j.topol.2008.08.006] for continuous maps of a metric space. However, it turns out that, for continuous maps of a compact metric space, the three mutually nonequivalent versions of distributional chaos can be discussed. Let X be a compact metric space and f:X→X a continuous map. In this paper, we show that for any integer N>0, f is strong DC2 (resp. strong DC3) if and only if f^N is strong DC2 (resp. strong DC3). We also show that the above three versions of distributional chaos are topological conjugacy invariant. In addition, as an application, we present an example.     

Structurally unstable regular dynamics in 1D piecewise smooth maps,and circle maps

In this work we consider a simple system of piecewise linear discontinuous 1D map with two discontinuity points: X′ = aX if ∣X∣ < z, X′ = bX if ∣X∣ > z, where a and b can take any real value, and may have several applications. We show that its dynamic behaviors are those of a linear rotation: either periodic or quasiperiodic, and always structurally unstable. A generalization to piecewise monotone functions X′ = F(X) if ∣X∣ < z, X′ = G(X) if ∣X∣ > z is also given, proving the conditions leading to a homeomorphism of the circle.     

On a problem of iteration invariants for distributional chaos

We show that if f is a DC3 continuous map of a compact metric space then also f^N is DC3, for every N > 0. This solves a problem given by [Li R. A note on the three versions of distributional chaos. Commun Nonlinear Sci Numer Simulat 2011;16:1993-1997].     

Special Functions on the Sphere with Applications to Minimal Surfaces

A function which is homogeneous in x, y, z of degree n and satisfies V_xx + V_yy + V_zz = 0 is called a spherical harmonic. In polar coordinates, the spherical harmonics take the form rⁿf_n, where f_n is a spherical surface harmonic of degree n. On a sphere, f_n satisfies ▵ f_n + n(n + 1)f_n = 0, where ▵ is the spherical Laplacian. Bounded spherical surface harmonics are well studied, but in certain instances, unbounded spherical surface harmonics may be of interest. For example, if X is a parameterization of a minimal surface and n is the corresponding unit normal, it is known that the support function, w = X · n, satisfies ▵w + 2w = 0 on a branched covering of a sphere with some points removed. While simple in form, the boundary value problem for the support function has a very rich solution set. We illustrate this by using spherical harmonics of degree one to construct a number of classical genus-zero minimal surfaces such as the catenoid, the helicoid, Enneper's surface, and Hennenberg's surface, and Riemann's family of singly periodic genus-one minimal surfaces.     

Devaney’s chaos implies distributional chaos in a sequence

Let X be a complete metric space without isolated points, and let f:X→X be a continuous map. In this paper we prove that if f is transitive and has a periodic point of period p, then f is distributionally chaotic in a sequence. Particularly, chaos in the sense of Devaney is stronger than distributional chaos in a sequence.     

The maximal and minimal ranks of a quaternion matrix expression with applications

In this paper, we establish the formulas of the extermal ranks of the quaternion matrix expression f(X₁, X₂) = C₇ ? A₄X₁B₄ ? A₅X₂B₅ where X₁, X₂ are variant quaternion matrices subject to quaternion matrix equations A₁X₁ = C₁, A₂X₁ = C₂, A₃X₁ = C₃, X₂B₁ = C₄, X₂B₂ = C₅, X₂B₃ = C₆. As applications, we give a new necessary and sufficient condition for the existence of solutions to some systems of quaternion matrix equations. Some results can be viewed as special cases of the results of this paper.     

On Certain C-Test Words for Free Groups

Let F_m be a free group of a finite rank m ≥ 2 and let X_i, Y_j be elements in F_m. A non-empty word w(x₁,…,x_n) is called a C-test word in n letters for F_m if, whenever (X₁,…,X_n) = w(Y₁,…,Y_n) ≠ 1, the two n-typles (X₁,…,X_n) and (Y₁,…,Y_n) are conjugate in F_m. In this paper we construct, for each n ≥ 2, a C-test word v_n(x₁,…,x_n) with the additional property that v_n(X₁,…,X_n) = 1 if and only if the subgroup of F_m generated by X₁,…,X_n is cyclic. Making use of such words v_m(x₁,…,x_m) and v_m + 1(x₁,…,x_m + 1), we provide a positive solution to the following problem raised by Shpilrain: There exist two elements u₁, u₂ ∈ F_m such that every endomorphism ψ of F_m with non-cyclic image is completely determined by ψ(u₁), ψ(u₂).     

A semi-Markov process with an inverse Gaussian distribution as sojourn time

Let X_n denote the state of a device after n repairs. We assume that the time between two repairs is the time τ taken by a Wiener process {W(t), t ? 0}, starting from w₀ and with drift μ < 0, to reach c ∈ [0, w₀). After the nth repair, the process takes on either the value X_n?1 + 1 or X_n?1 + 2. The probability that X_n = X_n?1 + j, for j = 1, 2, depends on whether τ ? t₀ (a fixed constant) or τ > t₀. The device is considered to be worn out when X_n ? k, where k ∈ {1, 2, …}. This model is based on the ones proposed by Rishel (1991) [1] and Tseng and Peng (2007) [2]. We obtain an explicit expression for the mean lifetime of the device. Numerical methods are used to illustrate the analytical findings.     

Iterative Solution of Nonlinear Equations Involving Strongly Accretive Operators without the Lipschitz Assumption

LetEbe a real Banach space with a uniformly convex dual spaceE*. SupposeT:E → Eis a continuous (not necessarily Lipschitzian) strongly accretive map such that (I − T) has bounded range, whereIdenotes the identity operator. It is proved that the Ishikawa iterative sequence converges strongly to the unique solution of equationTx = f,f ∈ E. Our results extend and complement the recent results obtained by Chidume.     

Linear Groups Definable in o-Minimal Structures

We study subgroups G of GL(n, R) definable in o-minimal expansions M = (R, +, · ,…) of a real closed field R. We prove several results such as: (a) G can be defined using just the field structure on R together with, if necessary, power functions, or an exponential function definable in M. (b) If G has no infinite, normal, definable abelian subgroup, then G is semialgebraic. We also characterize the definably simple groups definable in o-minimal structures as those groups elementarily equivalent to simple Lie groups, and we give a proof of the Kneser–Tits conjecture for real closed fields.     

Steady state analysis of a bulk queue with multiple vacations,setup times with N-policy and closedown times

In this paper a M^X/G (a, b)/1 queueing system with multiple vacations, setup time with N-policy and closedown times is considered. On completion of a service, if the queue length is ξ, where ξ < a, then the server performs closedown work. Following closedown the server leaves for multiple vacations of random length irrespective of queue length. When the server returns from a vacation and if the queue length is still less than ‘N’, he leaves for another vacation and so on, until he finds ‘N’ (N > b) customers in the queue. That is, if the server finds at least ‘N’ customers waiting for service, then he requires a setup time ‘R’ to start the service. After the setup he serves a batch of ‘b’ customers, where b ⩾ a. Various characteristics of the queueing system and a cost model with the numerical solution for a particular case of the model are presented.     

Complex dynamics in Duffing–Van der Pol equation

Duffing–Van der Pol equation with fifth nonlinear-restoring force and two external forcing terms is investigated. The threshold values of existence of chaotic motion are obtained under the periodic perturbation. By second-order averaging method and Melnikov method, we prove the criterion of existence of chaos in averaged system under quasi-periodic perturbation for ω₂ = nω₁ + εσ, n = 1, 3, 5, and cannot prove the criterion of existence of chaos in second-order averaged system under quasi-periodic perturbation for ω₂ = nω₁ + εσ, n = 2, 4, 6, 7, 8, 9, 10, where σ is not rational to ω₁, but can show the occurrence of chaos in original system by numerical simulation. Numerical simulations including heteroclinic and homoclinic bifurcation surfaces, bifurcation diagrams, Lyapunov exponent, phase portraits and Poincaré map, not only show the consistence with the theoretical analysis but also exhibit the more new complex dynamical behaviors. We show that cascades of interlocking period-doubling and reverse period-doubling bifurcations from period-2 to -4 and -6 orbits, interleaving occurrence of chaotic behaviors and quasi-periodic orbits, transient chaos with a great abundance of period windows, symmetry-breaking of periodic orbits in chaotic regions, onset of chaos which occurs more than one, chaos suddenly disappearing to period orbits, interior crisis, strange non-chaotic attractor, non-attracting chaotic set and nice chaotic attractors. Our results show many dynamical behaviors and some of them are strictly departure from the behaviors of Duffing–Van der Pol equation with a cubic nonlinear-restoring force and one external forcing.     

P-chaos implies distributional chaos and chaos in the sense of Devaney with positive topological entropy

Let f be a continuous map from a compact metric space X to itself. The map f is called to be P-chaotic if it has the pseudo-orbit-tracing property and the closure of the set of all periodic points for f is equal to X. We show that every P-chaotic map from a continuum to itself is chaotic in the sense of Devaney and exhibits distributional chaos of type 1 with positive topological entropy.     

Interpolation by Integer-Valued Polynomials

LetRbe a Krull ring with quotient fieldKanda₁,…,a_ninR. If and only if thea_iare pairwise incongruent mod every height 1 prime ideal of infinite index inRdoes there exist for all valuesb₁,…,b_ninRan interpolating integer-valued polynomial, i.e., anf ∈ K[x] withf(a_i) = b_iandf(R) ⊆ R.IfSis an infinite subring of a discrete valuation ringR_vwith quotient fieldKanda₁,…,a_ninSare pairwise incongruent mod allM^k_v ∩ Sof infinite index inS, we also determine the minimald(depending on the distribution of thea_iamong residue classes of the idealsM^k_v ∩ S) such that for allb₁,…,b_n ∈ R_vthere exists a polynomialf ∈ K[x] of degree at mostdwithf(a_i) = b_iandf(S) ⊆ R_v.     

Lower bounds for minimum semidefinite rank from orthogonal removal and chordal supergraphs

The minimum semidefinite rank (msr) of a graph is the minimum rank among positive semidefinite matrices with the given graph. The OS-number is a useful lower bound for msr, which arises by considering ordered vertex sets with some connectivity properties. In this paper, we develop two new interpretations of the OS-number. We first show that OS-number is also equal to the maximum number of vertices which can be orthogonally removed from a graph under certain nondegeneracy conditions. Our second interpretation of the OS-number is as the maximum possible rank of chordal supergraphs who exhibit a notion of connectivity we call isolation-preserving. These interpretations not only give insight into the OS-number, but also allow us to prove some new results. For example we show that msr(G) = |G| ? 2 if and only if OS(G) = |Gzsfnc ? 2.     

Discrepancy principle for DSM II

Let Ay = f, A is a linear operator in a Hilbert space H, y ⊥ N(A) ≔ {u : Au = 0}, R(A) ≔ {h : h = Au, u ∈ D(A)} is not closed, ∥f_δ − f∥ ⩽ δ. Given f_δ, one wants to construct u_δ such that lim_δ→0∥u_δ − y∥ = 0. Two versions of discrepancy principles for the DSM (dynamical systems method) for finding the stopping time and calculating the stable solution u_δ to the original equation Ay = f are formulated and mathematically justified.     

An extended rational interpolation method

To interpolate function, f(x), a ? x ? b, when we have some information about the values of f(x) and their derivatives in separate points on {x₀, x₁, … , x_n} ? [a, b], the Hermit interpolation method is usually used. Here, to solve this kind of problems, extended rational interpolation method is presented and it is shown that the suggested method is more efficient and suitable than the Hermit interpolation method, especially when the function f(x) has singular points in interval [a, b]. Also for implementing the extended rational interpolation method, the direct method and the inverse differences method are presented, and with some examples these arguments are examined numerically.