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.     

Pattern Frequency Sequences and Internal Zeros

Let q be a pattern and let S_n, q(c) be the number of n-permutations having exactly c copies of q. We investigate when the sequence (S_n, q(c))_c ≥ 0 has internal zeros. If q is a monotone pattern it turns out that, except for q = 12 or 21, the nontrivial sequences (those where n is at least the length of q) always have internal zeros. For the pattern q = 1(l + 1)l…2 there are infinitely many sequences which contain internal zeros and when l = 2 there are also infinitely many which do not. In the latter case, the only possible places for internal zeros are the next-to-last or the second-to-last positions. Note that by symmetry this completely determines the existence of internal zeros for all patterns of length at most 3.     

Existence and asymptotics of traveling waves for nonlocal diffusion systems

In this paper, we deal with the existence and asymptotic behavior of traveling waves for nonlocal diffusion systems with delayed monostable reaction terms. We obtain the existence of traveling wave front by using upper-lower solutions method and Schauder’s fixed point theorem for c > c₁(τ) and using a limiting argument for c = c₁(τ). Moreover, we find a priori asymptotic behavior of traveling waves with the help of Ikehara’s Theorem by constructing a Laplace transform representation of a solution. Especially, the delay can slow the minimal wave speed for ?₂f(0, 0) > 0 and the delay is independent of the minimal wave speed for ?₂f(0, 0) = 0.     

Bounds of the hyper-chaotic Lorenz–Stenflo system

To estimate the ultimate bound and positively invariant set for a dynamical system is an important but quite challenging task in general. This paper attempts to investigate the ultimate bounds and positively invariant sets of the hyper-chaotic Lorenz–Stenflo (L–S) system, which is based on the optimization method and the comparison principle. A family of ellipsoidal bounds for all the positive parameters values a, b, c, dand a cylindrical bound for a > 0, b > 1, c > 0, d > 0 are derived. Numerical results show the effectiveness and advantage of our methods.     

Explicit series solution of travelling waves with a front of Fisher equation

In this paper, an analytic technique, namely the homotopy analysis method, is employed to solve the Fisher equation, which describes a family of travelling waves with a front. The explicit series solution for all possible wave speeds 0 < c < +∞ is given. Such kind of explicit series solution has never been reported, to the best of author’s knowledge. Our series solution indicates that the solution contains an oscillation part when 0 < c < 2. The proposed analytic approach is general, and can be applied to solve other similar nonlinear travelling wave problems.     

Simple regression in view of elliptical models

For the simple linear model Y = θ1 + βx + ? where the error vector follows the elliptically contoured distribution, we consider the unrestricted, restricted, preliminary test and shrinkage estimators for the intercept parameter, θ when it is suspected that the slope parameter β may be β_o. The exact bias and MSE expressions are derived and the mean-square relative efficiency is taken to determine the relative dominance properties of the proposed estimators in comparison. In the continuation, the optimal level of significance of the preliminary test estimator is tabulated and some graphical result are also displayed.     

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.     

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.     

Commutativity and self-duality: Two tales of one equation

The mathematical expressions for the commutativity or self-duality of an increasing [0, 1]² → [0, 1] function F involve the transposition of its arguments. We unite both properties in a single functional equation. The solutions of this functional equation are discussed. Special attention goes to the geometrical construction of these solutions and their characterization in terms of contour lines. Furthermore, it is shown how ‘rotating’ the arguments of F allows to convert the results into properties for [0, 1]² → [0, 1] functions having monotone partial functions.     

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.     

Delayed transitions in non-linear replicator networks: About ghosts and hypercycles

In this paper we analyze delayed transition phenomena associated to extinction thresholds in a mean field model for hypercycles composed of three and four units, respectively. Hence, we extend a previous analysis carried out with the two-membered hypercycle [see Sardanyés J, Solé RV. Ghosts in the origins of life? Int J Bifurcation Chaos 2006;16(9), in press]. The models we analyze show that, after the tangent bifurcation, these hypercycles also leave a ghost in phase space. These ghosts, which actually conserve the dynamical properties of the coalesced coexistence fixed point, delay the flows before hypercycle extinction. In contrast with the two-component hypercycle, both ghosts show a plateau in the delay as ϕ → 0, thus displacing the power-law dependence to higher values of ϕ, in which the scaling law is now given by τ ∼ ϕ^β, with β = −1/3 (where τ is the delay and ϕ = ϵ − ϵ_c, the parametric distance above the extinction bifurcation point). These results suggest that the presence of the ghost is a general property of hypercycles. Such ghosts actually cause a memory effect which might increase hypercycle survival chances in fluctuating environments.     

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.     

Characterizations of PG(n − 1, q)\PG(k − 1, q) by Numerical and Polynomial Invariants

We show that the simple matroid PG(n − 1, q)\PG(k − 1, q), for n ≥ 4 and 1 ≤ k ≤ n − 2, is characterized by a variety of numerical and polynomial invariants. In particular, any matroid that has the same Tutte polynomial as PG(n − 1, q)\PG(k − 1, q) is isomorphic to PG(n − 1, q)\PG(k − 1, q).     

The stochastic soliton-like solutions of stochastic KdV equations

By means of a generalized method and symbolic computation, we consider a stochastic KdV equation U_t + f(t)U ♢ U_x + g(t)U_xxx = W(t) ♢ R^♢(t, U, U_x, U_xxx). We construct new and more general formal solutions. At the same time, we recover all the solutions found by Xie [Phys. Lett. A 310 (2003) 161]. The solutions obtained include the nontravelling wave and coefficient function’s stochastic soliton-like solutions, singular stochastic soliton-like solutions, stochastic triangular functions solutions.     

Integrals,Quantum Galois Extensions,and the Affineness Criterion for Quantum Yetter–Drinfel'd Modules

In this paper we shall generalize the notion of an integral on a Hopf algebra introduced by Sweedler, by defining the more general concept of an integral of a threetuple (H, A, C), where H is a Hopf algebra coacting on an algebra A and acting on a coalgebra C. We prove that there exists a total integral γ: C → Hom(C, A) of (H, A, C) if and only if any representation of (H, A, C) is injective in a functorial way, as a corepresentation of C. In particular, the quantum integrals associated to Yetter–Drinfel'd modules are defined. Let now A be an H-bicomodule algebra, ^H$\text{Y}$$\text{D}$_A the category of quantum Yetter–Drinfel'd modules, and B = {a ∈ A|∑S^− 1(a_〈1〉)a_{〈 − 1〉} ⊗ a_〈0〉 = 1_H ⊗ a}, the subalgebra of coinvariants of the Verma structure A ∈ ^H$\text{Y}$$\text{D}$_A. We shall prove the following affineness criterion: if there exists γ: H → Hom(H, A) a total quantum integral and the canonical map β: A ⊗ _B A → H ⊗ A, β(a ⊗ _B b) = ∑S^− 1(b_〈1〉)b_{〈 − 1〉} ⊗ ab_〈0〉 is surjective (i.e., A/B is a quantum homogeneous space), then the induction functor – ⊗ _B A: $\text{M}$_B → ^H$\text{Y}$$\text{D}$_A is an equivalence of categories. The affineness criteria proven by Cline, Parshall, and Scott, and independently by Oberst (for affine algebraic groups schemes) and Schneider (in the noncommutative case), are recovered as special cases.     

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.     

On “P” property and the column-W property

P-matrices play an important role in the well-posedness of a linear complementarity problem (LCP). Similarly, the well-posedness of a horizontal linear complementarity problem (HLCP) is closely related to the column-W property of a matrix k-tuple.In this paper we first consider the problem of generating P-matrices from a given pair of matrices. Given a matrix pair (D, F) where D is a square matrix of order m and matrix F has m rows, “what are the conditions under which there exists a matrix G such that (D + FG) is a P-matrix?”. We obtain necessary and sufficient conditions for the special case when the column rank of F is m ? 1. A decision algorithm of complexity O(m²) to check whether the given pair of matrices (D, F) is P-matrisable is obtained. We also obtain a necessary and an independent sufficient condition for the general case when rank(F) is less than m ? 1.We then generalise the P-matrix generating problem to the generation of matrix k-tuples satisfying the column-W property from a given matrix (k + 1)-tuple. That is, given a matrix (k + 1)-tuple (D₁, … ,D_k, F), where D_js are square matrices of order m and F is a matrix having m rows, we determine the conditions under which the matrix k-tuple (D₁ + FG₁, … ,D_k + FG_k) satisfies the column-W property. As in the case of P-matrices we obtain necessary and sufficient conditions for the case when rank(F) = m ? 1. Using these conditions a decision algorithm of complexity O(km²) to check whether the given matrix (k + 1)-tuple is column-W matrisable is obtained. Then for the case when rank(F) is less than m ? 1, we obtain a necessary and an independent sufficient condition.For a special sub-class of P-matrices we give a polynomial time decision algorithm for P-matrisability. Finally, we obtain a geometric characterisation of column-W property by generalising the well known separation theorem for P-matrices.