Hyperbolic invariant sets of the real generalized Hénon maps

In this paper, the conditions under which there exists a uniformly hyperbolic invariant set for the generalized Hénon map F(x, y) =  (y, ag(y) ? δx) are investigated, where g(y) is a monic real-coefficient polynomial of degree d ? 2, a and δ are non-zero parameters. It is proved that for certain parameter regions the map has a Smale horseshoe and a uniformly hyperbolic invariant set on which it is topologically conjugate to the two-sided fullshift on two symbols, where g(y) has at least two different non-negative or non-positive real zeros, and ∣a∣ is sufficiently large. Moreover, it is shown that if g(y) has only simple real zeros, then for sufficiently large ∣a∣, there exists a uniformly hyperbolic invariant set on which F is topologically conjugate to the two-sided fullshift on d symbols.     

Free in-plane vibration analysis of a curved beam (arch) with arbitrary various concentrated elements

In the existing literature, the information regarding the exact solutions for free in-plane vibrations of the curved beams (or arches) carrying various concentrated elements is rare, particularly for the case with multiple attachments including eccentricities and mass moments of inertias. For this reason, this paper aims at presenting an effective approach to tackle the title problem. First of all, the un-coupled equation of motion for the circumferential displacement of an arch segment is derived. Next, based on the value of the discriminate parameter for a cubic equation, the exact solutions for the three types of roots of the un-coupled equation are determined and, corresponding to each type of roots, all displacement functions for the arch segment in terms of the real numbers (instead of the complex ones) are obtained. Finally, use of the compatible equations for the displacements and slopes together with the equilibrium equations for the forces and moments at each intermediate node and two ends of the entire curved beam, a frequency equation of the form ∣H(ω)∣ = 0 is obtained. It is found that the conventional approach by using the condition “∣H(ω^t)∣ ? ε” to search for the approximate value of ω^t is difficult even if the convergence tolerance ε is greater than 10⁺³ (i.e., ε > 10⁺³) instead of less than 10^?3 (i.e., ε < 10^?3), however, the half-interval method is one of the effective tools for solving the problem if all coefficients of the determinant ∣H(ω)∣ are the real numbers. In addition to comparing with the existing literature, most of the numerical results obtained from the presented method are compared with those obtained from the conventional finite element method (FEM) and good agreement is achieved.     

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

Landau’s theorem for functions with logharmonic Laplacian

In this paper, we show the existence of Landau constant for functions with logharmonic Laplacian of the form F(z) = ∣z∣²L(z) + K(z), ∣z∣ < 1, where L is logharmonic and K is harmonic. Moreover, the problem of minimizing the area is solved     

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

Hyperbolicity of the invariant sets for the real polynomial maps

In this paper, the conditions under which there exits a uniformly hyperbolic invariant set for the map f_a(x) = ag(x) are studied, where a is a real parameter, and g(x) is a monic real-coefficient polynomial. It is shown that for certain parameter regions, the map has a uniformly hyperbolic invariant set on which it is topologically conjugate to the one-sided subshift of finite type for A, where ∣a∣ is sufficiently large, A is an eventually positive transition matrix, and g has at least two different real zeros or only one real zero. Further, it is proved that there exists an invariant set on which the map is topologically semiconjugate to the one-sided subshift of finite type for a particular irreducible transition matrix under certain conditions, and one type of these maps is not hyperbolic on the invariant set.     

1D numerical simulation of charge trapping in an insulator submitted to an electron beam irradiation. Part I: Computation of the initial secondary electron emission yield

The aim of this work is to study by numerical simulation a mathematical modelling technique describing charge trapping during initial charge injection in an insulator submitted to electron beam irradiation. A two-fluxes method described by a set of two stationary transport equations is used to split the electron current j_e(z) into coupled forward j_e+(z) and backward j_e?(z) currents and such that j_e(z) = j_e+(z) ? j_e?(z). The sparse algebraic linear system, resulting from the vertex-centered finite-volume discretization scheme is solved by an iterative decoupled fixed point method which involves the direct inversion of a bi-diagonal matrix.The sensitivity of the initial secondary electron emission yield with respect to the energy of incident primary electrons beam, that is penetration depth of the incident beam, or electron cross sections (absorption and diffusion) is investigated by numerical simulations.     

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.     

Fractional dynamics of systems with long-range interaction

We consider one-dimensional chain of coupled linear and nonlinear oscillators with long-range powerwise interaction defined by a term proportional to 1/∣n − m∣^α+1. Continuous medium equation for this system can be obtained in the so-called infrared limit when the wave number tends to zero. We construct a transform operator that maps the system of large number of ordinary differential equations of motion of the particles into a partial differential equation with the Riesz fractional derivative of order α, when 0 < α < 2. Few models of coupled oscillators are considered and their synchronized states and localized structures are discussed in details. Particularly, we discuss some solutions of time-dependent fractional Ginzburg–Landau (or nonlinear Schrodinger) equation.     

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.     

Matrix characterization of linear codes with arbitrary Hamming weight hierarchy

The support of an [n, k] linear code C over a finite field F_q is the set of all coordinate positions such that at least one codeword has a nonzero entry in each of these coordinate position. The rth generalized Hamming weight d_r(C), 1 ⩽ r ⩽ k, of C is defined as the minimum of the cardinalities of the supports of all [n, r] subcodes of C. The sequence (d₁(C), d₂(C), … , d_k(C)) is called the Hamming weight hierarchy (HWH) of C. The HWH, d_r(C) = n − k + r;  r = 1, 2 , …, k, characterizes maximum distance separable (MDS) codes. Therefore the matrix characterization of MDS codes is also the characterization of codes with the HWH d_r(C) = n − k + r; r = 1, 2, … , k. A linear code C with systematic check matrix [I∣P], where I is the (n − k) × (n − k) identity matrix and P is a (n − k) × k matrix, is MDS iff every square submatrix of P is nonsingular. In this paper we extend this characterization to linear codes with arbitrary HWH. Using this result, we characterize Near-MDS codes, Near-Near-MDS (N²-MDS) codes and A^μ-MDS codes. The MDS-rank of C is the smallest integer η such that d_η+1 = n − k + η + 1 and the defect vector of C with MDS-rank η is defined as the ordered set {μ₁(C), μ₂(C), μ₃(C), … , μ_η(C), μ_η+1(C)}, where μ_i(C) = n − k + i − d_i(C). We call C a dually defective code if the defect vector of the code and its dual are the same. We also discuss matrix characterization of dually defective codes. Further, the codes meeting the generalized Greismer bound are characterized in terms of their generator matrix. The HWH of dually defective codes meeting the generalized Greismer bound are also reported.     

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.     

New exact solitary-wave special solutions for the nonlinear dispersive K(m, n) equations

In this paper, we study the nonlinear dispersive K(m, n) equations: u_t + (u^m)_x − (uⁿ)_xxx = 0 which exhibit solutions with solitary patterns. New exact solitary solutions are found. The two special cases, K(2, 2) and K(3, 3), are chosen to illustrate the concrete features of the decomposition method in K(m, n) equations. The nonlinear equations K(m, n) are studied for two different cases, namely when m = n being odd and even integers. General formulas for the solutions of K(m, n) equations are established.     

Inverse problems for parabolic equations 2

Let u_t − u_xx = h(t) in 0 ⩽ x ⩽ π, t ⩾ 0. Assume that u(0, t) = v(t), u(π, t) = 0, and u(x, 0) = g(t). The problem is: what extra data determine the three unknown functions {h, v, g} uniquely? This question is answered and an analytical method for recovery of the above three functions is proposed.     

Dynamical systems method and surjectivity of nonlinear maps

If F : H → H is a $C_{\mathrm{loc}}^2$-map in a real Hilbert space, sup_{u ∈ B(u0,R)}∥[F′(u)]⁻¹∥ ⩽ m(R), and ${\mathrm{limsup}}_{R>0}\frac{R}{m(R)}=\infty$, then F is surjective.     

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.