Calculation of a static potential created by plane fractal cluster

In this paper we demonstrate new approach that can help in calculation of electrostatic potential of a fractal (self-similar) cluster that is created by a system of charged particles. For this purpose we used the simplified model of a plane dendrite cluster [1] that is generated by a system of the concentric charged rings located in some horizontal plane (see Fig. 2). The radiuses and charges of the system of concentric rings satisfy correspondingly to relationships: r_n = r₀ξⁿ and e_n = e₀bⁿ, where n determines the number of a current ring. The self-similar structure of the system considered allows to reduce the problem to consideration of the functional equation that similar to the conventional scaling equation. Its solution represents itself the sum of power-low terms of integer order and non-integer power-law term multiplied to a log-periodic function [5], [6]. The appearance of this term was confirmed numerically for internal region of the self-similar cluster (r₀ ≪ r ≪ r_N−1), where r₀, r_N−1 determine the smallest and the largest radiuses of the limiting rings correspondingly. The results were obtained for homogeneously (b > 0) and heterogeneously (b < 0) charged rings. We expect that this approach allows to consider more complex self-similar structures with different geometries of charge distributions.     

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.     

On generalized Jordan 1-derivation in rings

Let n ⩾ 1 be a fixed integer and let R be an (n + 1)!-torsion free 1-ring with identity element e. If F, d:R → R are two additive mappings satisfying F(xⁿ⁺¹) = F(x)(x¹)ⁿ + xd(x)(x¹)ⁿ⁻¹ + x²d(x)(x¹)ⁿ⁻²+ ⋯ +xⁿd(x) for all x ∈ R, then d is a Jordan 1-derivation and F is a generalized Jordan 1-derivation on R.     

Curious Characterizations of Projective and Affine Geometries

We prove the following characterization theorem: If any three of the following four matroid invariants—the number of points, the number of lines, the coefficient of λ^n − 2 in the characteristic polynomial, and the number of three-element dependent sets—of a rank-n combinatorial geometry (or simple matroid) are the same as those of a rank-n projective geometry, then it is a projective geometry (of the same order). To do this, we use a lemma which is of independent interest: If H is a geometry in which all the lines have exactly ℓ − 1 or ℓ points and G is a geometry with at least three of the four matroid invariants the same as H, then all the lines in G also have exactly ℓ − 1 or ℓ points. An analogue of the characterization theorem holds for affine geometries. Our methods also yield inequalities amongst the four matroid invariants.     

On the positive definite solutions of nonlinear matrix equation X + A⋆ X−δA = Q

In this paper we consider the positive definite solutions of nonlinear matrix equation X + A^⋆X^−δA = Q, where δ ∈ (0, 1], which appears for the first time in [S.M. El-Sayed, A.C.M. Ran, On an iteration methods for solving a class of nonlinear matrix equations, SIAM J. Matrix Anal. Appl. 23 (2001) 632–645]. The necessary and sufficient conditions for the existence of a solution are derived. An iterative algorithm for obtaining the positive definite solutions of the equation is discussed. The error estimations are found.     

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

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.     

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.     

A Bijective Approach to the Area of Generalized Motzkin Paths

For fixed positive integer k, let E_n denote the set of lattice paths using the steps (1, 1), (1, − 1), and (k, 0) and running from (0, 0) to (n, 0) while remaining strictly above the x-axis elsewhere. We first prove bijectively that the total area of the regions bounded by the paths of E_n and the x-axis satisfies a four-term recurrence depending only on k. We then give both a bijective and a generating function argument proving that the total area under the paths of E_n equals the total number of lattice points on the x-axis hit by the unrestricted paths running from (0, 0) to (n − 2, 0) and using the same step set as above.     

Statistical properties of nucleotides in human chromosomes 21 and 22

In this paper the statistical properties of nucleotides in human chromosomes 21 and 22 are investigated. The n-tuple Zipf analysis with n = 3, 4, 5, 6, and 7 is used in our investigation. It is found that the most common n-tuples are those which consist only of adenine (A) and thymine (T), and the rarest n-tuples are those in which GC or CG pattern appears twice. With the n-tuples become more and more frequent, the double GC or CG pattern becomes a single GC or CG pattern. The percentage of four nucleotides in the rarest ten and the most common ten n-tuples are also considered in human chromosomes 21 and 22, and different behaviors are found in the percentage of four nucleotides. Frequency of appearance of n-tuple f(r) as a function of rank r is also examined. We find the n-tuple Zipf plot shows a power-law behavior for r < 4ⁿ⁻¹ and a rapid decrease for r > 4ⁿ⁻¹. In order to explore the interior statistical properties of human chromosomes 21 and 22 in detail, we divide the chromosome sequence into some moving windows and we discuss the percentage of ξη (ξ, η = A, C, G, T) pair in those moving windows. In some particular regions, there are some obvious changes in the percentage of ξη pair, and there maybe exist functional differences. The normalized number of repeats N₀(l) can be described by a power law: N₀(l) ∼ l^−μ. The distance distributions P₀(S) between two nucleotides in human chromosomes 21 and 22 are also discussed. A two-order polynomial fit exists in those distance distributions: log P₀(S) = a + bS + cS², and it is quite different from the random sequence.     

Filter matrix based on interpolation wavelets for solving Fredholm integral equations

The interpolation wavelet is used to solve the Fredholm integral equation of the second kind in this study. Hence, by the extension of interpolation wavelets that [−1, 1] is divided to 2^N+1 (N ⩾  − 1) subinterval, we have polynomials with a degree less than M + 1 in each new interval. Therefore, by considering the two-scale relation the filter coefficients and filter matrix are used as the proof of theorems. The important point is interpolation wavelets lead to more sparse matrix when we try to solve integral equation by an approximate kernel decomposed to a lower and upper resolution. Using n-time, where (n ⩾ 2), two-scale relation in this method errors of approximate solution as O((2^−(N+1))ⁿ⁺¹). Also, the filter coefficient simplifies the proof of some theorems and the order of convergence is estimated by numerical errors.     

Numerical simulation of magnetohydrodynamic buoyancy-induced flow in a non-isothermally heated square enclosure

Numerical simulation of magnetohydrodynamic (MHD) buoyancy-induced heat transfer and fluid flow has been analyzed in a non-isothermally heated square enclosure using finite volume method. The bottom wall of enclosure were heated and cooled with a sinusoidal function and top wall was cooled isothermally. Vertical walls of the enclosure were adiabatic. Effects of Rayleigh number (Ra = 10⁴, 10⁵ and 10⁶), Hartman number (Ha = 0, 50 and 100) and amplitude of sinusoidal function (n = 0.25, 0.5 and 1) on temperature and flow fields were analyzed. It was observed that heat transfer was decreased with increasing Hartmann number and decreasing value of amplitude of sinusoidal function.     

Existence of quasibounded solutions for the higher order dynamic equations on measure chains

By using the exponential dichotomy and Schauder’s fixed point theorem, some new criteria are established for the existence of quasibounded solutions of the inhomogeneous system x^Δ = A(t)x + g(t, x) + h(t), which generalize the previous results in [15], [19].     

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.     

Vacuum polarization in light two-electron atoms and ions

A general theory of the vacuum polarization in light atomic and muon-atomic systems is considered. We derive the closed analytical expression for the Uehling potential and evaluate corrections on vacuum polarization for the 1¹S-state of the two-electron ³He and ⁴He atoms and for some two-electron ions, including the Li⁺, Be²⁺, B³⁺ and C⁴⁺ ions. The correction for vacuum polarization in two-electron He atoms has been evaluated as ΔE_ueh ≈ 7.253 ± 0.0025 × 10⁻⁷ a.u. The analogous corrections in the two-electron He-like ions rapidly increase with the nuclear charge Q (ΔE_ueh ≈ 2.7061 × 10⁻⁶ a.u. for the Li⁺ ion and ΔE_ueh ≈ 2.3495 × 10⁻⁵ a.u. for the C⁴⁺ ion). The corresponding corrections have also been evaluated for the electron–nucleus and electron–electron interactions.     

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.     

Fast Rectangular Matrix Multiplication and Applications

First we study asymptotically fast algorithms for rectangular matrix multiplication. We begin with new algorithms for multiplication of ann×nmatrix by ann×n²matrix in arithmetic timeO(n^ω),ω=3.333953…, which is less by 0.041 than the previous record 3.375477…. Then we present fast multiplication algorithms for matrix pairs of arbitrary dimensions, estimate the asymptotic running time as a function of the dimensions, and optimize the exponents of the complexity estimates. For a large class of input matrix pairs, we improve the known exponents. Finally we show three applications of our results:   (a) we decrease from 2.851 to 2.837 the known exponent of the work bounds for fast deterministic (NC) parallel evaluation of the determinant, the characteristic polynomial, and the inverse of ann×nmatrix, as well as for the solution to a nonsingular linear system ofnequations,   (b) we asymptotically accelerate the known sequential algorithms for the univariate polynomial composition mod xⁿ, yielding the complexity boundO(n^1.667) versus the old record ofO(n^1.688), and for the univariate polynomial factorization over a finite field, and   (c) we improve slightly the known complexity estimates for computing basic solutions to the linear programming problem withmconstraints andnvariables.     

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.     

Quantum Complexity of Integration

It is known that quantum computers yield a speed-up for certain discrete problems. Here we want to know whether quantum computers are useful for continuous problems. We study the computation of the integral of functions from the classical Hölder classes F^k, α_d on [0, 1]^d and define γ by γ=(k+α)/d. The known optimal orders for the complexity of deterministic and (general) randomized methods are comp(F^k, α_d, ε)≍ε^−1/γ and comp^random(F^k, α_d, ε)≍ε^−2/(1+2γ). For a quantum computer we prove comp^quant_query(F^k, α_d, ε)≍ε^−1/(1+γ) and comp^quant(F^k, α_d, ε)⩽Cε^−1/(1+γ)(log ε⁻¹)^1/(1+γ). For restricted Monte Carlo (only coin tossing instead of general random numbers) we prove comp^coin(F^k, α_d, ε)⩽Cε^−2/(1+2γ)(log ε⁻¹)^1/(1+2γ). To summarize the results one can say that   • there is an exponential speed-up of quantum algorithms over deterministic (classical) algorithms, if γ is small;   • there is a (roughly) quadratic speed-up of quantum algorithms over randomized classical methods, if γ is small.