Space–time symmetry violation,configuration mixing model and E-infinity theory

We have studied the time reversal symmetry violation on the bases of the configuration mixing model and E-infinity theory. With the use of the Cabibbo angle approximation, we have presented the transformation matrix in terms of the golden ratio (?), and shown that the time reversal symmetry violation is described by the configuration mixing of the unstable and stable manifolds (W^u, W^s). The magnitude of the mixing for the weak interaction field is given by the expression sin² θ_T(theor) ≈ sin⁴ θ_C(theor) ≈ (?)¹² = 3.105 × 10^?3, which is compared to the Kaon decay experiment ～2.3 × 10^?3. We have also discussed the space–time symmetry violation by using the CPT theorem.     

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.     

Simulación numérica del flujo turbulento de aire con gotas dispersas de agua a través de separadores de torres de refrigeración

This work presents a numerical study on the turbulent flow of air with dispersed water droplets in separators of mechanical cooling towers. The averaged Navier-Stokes equations are discretised through a finite volume method, using the Fluent and Phoenics codes, and alternatively employing the turbulence models k ? ?, k ? ω and the Reynolds stress model, with low-Re version and wall enhanced treatment refinements. The results obtained are compared with numerical and experimental results taken from the literature. The degree of accuracy obtained with each of the considered models of turbulence is stated. The influence of considering whether or not the simulation of the turbulent dispersion of droplets is analyzed, as well as the effects of other relevant parameters on the collection efficiency and the coefficient of pressure drop. Focusing on four specific eliminators (‘Belgian wave’, ‘H1-V’, ‘L-shaped’ and ‘Zig-zag’), the following ranges of parameters are outlined: 1 ≤ U_e ≤ 5 m/s for the entrance velocity, 2 ≤ D_p ≤ 50 μm for the droplet diameter, 650 ≤ Re ≤ 8.500 for Reynolds number, and 0.05 ≤ P_i ≤ 5 for the inertial parameter. Results reached alternately with Fluent and Phoenics codes are compared. The best results correspond to the simulations performed with Fluent, using the SST k ? ω turbulence model, with values of the dimensionless scaled distance to wall y⁺ in the range 0.2 to 0.5. Finally, correlations are presented to predict the conditions for maximum collection efficiency (100 %), depending on the geometric parameter of removal efficiency of each of the separators, which is introduced in this work.     

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.     

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.     

Conditional contractivity of Runge–Kutta methods for nonlinear differential equations with many variable delays

This paper deals with conditional contractivity properties of Runge–Kutta (RK) methods with variable step-size applied to nonlinear differential equations with many variable delays (MDDEs). The concepts of CRN_m(ω, H)- and BN_f(μ, ?)-stability are introduced. It is shown that the numerical solution produced by a BN_f(μ, ?)-stable Runge–Kutta method with an appropriate interpolation is contractive. In particular, these results are also novel for nonlinear differential equations with many constant delays or single variable delay. To obtain BN_f(μ, ?)-stable methods, (k, l)-algebraically stable Runge–Kutta methods are also investigated.     

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.     

Comment on the 3+1 dimensional Kadomtsev–Petviashvili equations

We comment on traveling wave solutions and rational solutions to the 3+1 dimensional Kadomtsev–Petviashvili (KP) equations: (u_t + 6uu_x + u_xxx)_x ± 3u_yy ± 3u_zz = 0. We also show that both of the 3+1 dimensional KP equations do not possess the three-soliton solution. This suggests that none of the 3+1 dimensional KP equations should be integrable, and partially explains why they do not pass the Painlevé test. As by-products, the one-soliton and two-soliton solutions and four classes of specific three-soliton solutions are explicitly presented.     

Predictions based on the cumulative curves: Basic principles and nontrivial example

In this paper the new prediction method based on analysis of the integrated (cumulative) curves is suggested. This method includes the procedure of the optimal linear smoothing (POLS) for the finding of optimal trends, independent “reading” of relative fluctuations in terms of β-distribution function that are formed after subtraction of the calculated trend and the recognition of the proper fitting hypothesis for the integrated optimal trends by the eigen-coordinates method. The combined noninvasive approach was applied to analysis of temperature data obtained from the site http://data.giss.nasa.gov/gistemp/ related to the global warming (GW) phenomenon. These data are considered as nontrivial examples of verification of new forecasting method. The available data were combined into six files covering the mean/anomalous temperature 1546 month’s points covering the period from the January of 1880 up to October of 2008. Besides the global registered points the combined files included in themselves the north/south data points measured independently for both the Earth’s hemispheres. The combined new method (preliminary verified on mimic data) applied to these files predicts the changing of the GW period by the global cooling (GC) period that will happen during the years 2038–2136. Besides this important result a new method helps to discover the influence of a small but stable oscillating process with a set of self-similar periods Ω_n = Ω₀ξⁿ, n = 0, ±1, ±2, ±3, ±4 with mean period 〈T〉 = 12.55 year. This fact should present interest for ecologists and meteorologists working in this field.     

Net-convergence and weak separation axioms in (L, M)-fuzzy topological molecular lattices

In this paper, we used the concept of (L, M)-fuzzy remote neighborhood system to study and establish the convergence theory of molecular nets. Next, we introduce the T_i-axioms (i = ?1, 0, 1, 2) in (L, M)-fuzzy topological molecular lattices, and discuss some of their characterizations. Finally, we show that the T_i-axioms (i = ?1, 0, 1, 2) are preserved under homeomorphisms.     

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.     

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.     

Computing best-possible bounds for the distribution of a sum of several variables is NP-hard

In many real-life situations, we know the probability distribution of two random variables x₁ and x₂, but we have no information about the correlation between x₁ and x₂; what are the possible probability distributions for the sum x₁ + x₂? This question was originally raised by A.N. Kolmogorov. Algorithms exist that provide best-possible bounds for the distribution of x₁ + x₂; these algorithms have been implemented as a part of the efficient software for handling probabilistic uncertainty. A natural question is: what if we have several (n > 2) variables with known distribution, we have no information about their correlation, and we are interested in possible probability distribution for the sum y = x₁ + ⋯ + x_n? Known formulas for the case n = 2 can be (and have been) extended to this case. However, as we prove in this paper, not only are these formulas not best-possible anymore, but in general, computing the best-possible bounds for arbitrary n is an NP-hard (computationally intractable) problem.     

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.     

Solution of the Burgers equation using an implicit linearizing transformation

The initial-boundary-value problem on the semi-infinite interval and on a finite interval for the Burgers equation u_t = u_xx + 2u_xu is solved using a stream function ? and a linearizing transformation w = e^?. The transformation reduces the equation to a heat equation with appropriate initial and homogeneous time-dependent linear boundary conditions. One advantage of this method is that we never need to find an explicit expression for ? in our computations.     

Second-order approximation of angle-ply composite laminated thin plate under combined excitations

The influence of the quadratic and cubic terms on non-linear dynamic characteristics of the angle-ply composite laminated rectangular plate with parametric and external excitations is investigated. The method of multiple time scale perturbation is applied to solve the non-linear differential equations describing the system up to and including the second-order approximation. All possible resonance cases are extracted and investigated at this approximation order. Two cases of the sub-harmonic resonances cases (Ω₂ ? 2ω₁ and Ω₂ ? 2ω₂) in the presence of 1:2 internal resonance ω₂ ? 2ω₁ are considered. The stability of the system is investigated using both frequency response equations and phase-plane method. It is quite clear that some of the simultaneous resonance cases are undesirable in the design of such system as they represent some of the worst behavior of the system. Such cases should be avoided as working conditions for the system. Some recommendations regarding the different parameters of the system are reported. Comparison with the available published work is reported.     

Equivalent Blocks of Finite General Linear Groups in Non-describing Characteristic

J. Chuang, R. Kessar, and J. Rickard have proved Broué's Abelian defect group conjecture for many symmetric groups. We adapt the ideas of Kessar and Chuang towards finite general linear groups (represented over non-describing characteristic). We then describe Morita equivalences between certain p-blocks of GL_n(q) with defect group C_p^α × C_p^α, as q varies (see Theorem 2). Here p and q are coprime. This generalizes work of S. Koshitani and M. Hyoue, who proved the same result for principal blocks of GL_n(q) when p = 3, α = 1, in a different way.     

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.     

The applications of a higher-dimensional Lie algebra and its decomposed subalgebras

With the help of invertible linear transformations and the known Lie algebras, a higher-dimensional 6 × 6 matrix Lie algebra sμ(6) is constructed. It follows a type of new loop algebra is presented. By using a (2 + 1)-dimensional partial-differential equation hierarchy we obtain the integrable coupling of the (2 + 1)-dimensional KN integrable hierarchy, then its corresponding Hamiltonian structure is worked out by employing the quadratic-form identity. Furthermore, a higher-dimensional Lie algebra denoted by E, is given by decomposing the Lie algebra sμ(6), then a discrete lattice integrable coupling system is produced. A remarkable feature of the Lie algebras sμ(6) and E is used to directly construct integrable couplings.