The regularity of bidimensional solutions of the third grade fluids equations

It was recently proved in [1,2] that the third grade fluids equations have a unique global bidimensional solution provided that the initial velocity belongs to the Sobolev space H². Here, we complete this result by proving that this solution preserves the Sobolev regularity of the initial data, i.e., if the initial velocity belongs to H^m, m ≥ 2, then the evolved velocity v(t, ·) also belongs to H^m for every time t.     

On the existence of bounded solutions for a nonlinear elliptic system

This work deals with the system (?Δ) ^m u?= a(x) v ^p , (?Δ) ^m v?=?b(x)?u ^q with Dirichlet boundary condition in a domain ${\Omega\subset\mathbb{R}^n}$ , where Ω is a ball if n ≥ 3 or a smooth perturbation of a ball when n?=?2. We prove that, under appropriate conditions on the parameters (a, b, p, q, m, n), any nonnegative solution (u, v) of the system is bounded by a constant independent of (u, v). Moreover, we prove that the conditions are sharp in the sense that, up to some border case, the relation on the parameters are also necessary. The case m?=?1 was considered by Souplet (Nonlinear Partial Differ Equ Appl 20:464–479, 2004). Our paper generalize to m ≥ 1 the results of that paper.     

Condition numbers with their condition numbers for the weighted moore-penrose inverse and the weighted least squares solution

In this paper, the authors investigate the condition number with their condition numbers for weighted Moore-Penrose inverse and weighted least squares solution of $\mathop {\min }\limits_x ||Ax - b||_M $ , whereA is a rank-deficient complex matrix in ?^{m × n} andb a vector of lengthm in ?^m,x a vector of length n in ?ⁿ. For the normwise condition number, the sensitivity of the relative condition number itself is studied, the componentwise perturbation is also investigated.     

Global solutions of the fast diffusion equation with gradient absorption terms

We investigate the existence of nonnegative weak solutions to the problem ut=Δ(um)−p|∇u| in Rn×(0,∞) with ⁺(1−2/n)<m<1. It will be proved that: (i) When 1<p<2, if the initial datum u₀∈D(Rn) then there exists a solution; (ii) When 1<p<(2+mn)/(n+1), if the initial datum u₀(x) is a bounded and nonnegative measure then the solution exists; (iii) When (2+mn)/(n+1)?p<2, if the initial datum is a Dirac mass then the solution does not exist. We also study the large time behavior of the L¹-norm of solutions for 1<p?(2+mn)/(n+1), and the large time behavior of t1/β‖u(⋅,t)−Ec(⋅,t)L^∞_‖ for (2+mn)/(n+1)<p<2.     

A generalization of the fast LUP matrix decomposition algorithm and applications

We show that any m × n matrix A, over any field, can be written as a product, LSP, of three matrices, where L is a lower triangular matrix with l's on the main diagonal, S is an m × n matrix which reduces to an upper triangular matrix with nonzero diagonal elements when the zero rows are deleted, and P is an n × n permutation matrix. Moreover, L, S, and P can be found in O(m^α?1n) time, where the complexity of matrix multiplication is O(m^α). We use the LSP decomposition to construct fast algorithms for some important matrix problems. In particular, we develop O(m^α?1n) algorithms for the following problems, where A is any m × n matrix: (1) Determine if the system of equations $\text{A}\text{x}\text{=}\text{b}$ (where $\text{b}$ is a column vector) has a solution, and if so, find one such solution. (2) Find a generalized inverse, $\text{A}{}^1$, of A (i.e., $\text{AA}{}^1\text{A = A}$). (3) Find simultaneously a maximal independent set of rows and a maximal independent set of columns of A.     

On the existence of Hadamard matrices

Given any natural number q > 3 we show there exists an integer t ? [2log₂(q ? 3)] such that an Hadamard matrix exists for every order 2^sq where s > t. The Hadamard conjecture is that s = 2.This means that for each q there is a finite number of orders 2^υq for which an Hadamard matrix is not known. This is the first time such a statement could be made for arbitrary q.In particular it is already known that an Hadamard matrix exists for each 2^sq where if q = 2^m ? 1 then s ? m, if q = 2^m + 3 (a prime power) then s ? m, if q = 2^m + 1 (a prime power) then s ? m + 1.It is also shown that all orthogonal designs of types (a, b, m ? a ? b) and (a, b), 0 ? a + b ? m, exist in orders m = 2^t and 2^t+2 · 3, t ? 1 a positive integer.     

A generalization of the binary Preparata code

A classical binary Preparata code P₂(m) is a nonlinear (2^m+1,2^2(2m-1-m),6)-code, where m is odd. It has a linear representation over the ring Z₄ [Hammons et al., The Z₄-linearity of Kerdock, Preparata, Goethals and related codes, IEEE Trans. Inform. Theory 40(2) (1994) 301-319]. Here for any q=2^l>2 and any m such that (m,q-1)=1 a nonlinear code P_q(m) over the field F=GF(q) with parameters (q(Δ+1),q^2(Δ-m),d?3q), where Δ=(q^m-1)/(q-1), is constructed. If d=3q this set of parameters generalizes that of P₂(m). The equality d=3q is established in the following cases: (1) for a series of initial admissible values q and m such that q^m<2¹⁰⁰; (2) for m=3,4 and any admissible q, and (3) for admissible q and m such that there exists a number m₁ with m₁|m and d(P_q(m₁))=3q. We apply the approach of [Nechaev and Kuzmin, Linearly presentable codes, Proceedings of the 1996 IEEE International Symposium Information Theory and Application Victoria, BC, Canada 1996, pp. 31-34] the code P is a Reed-Solomon representation of a linear over the Galois ring R=GR(q²,4) code P dual to a linear code K with parameters near to those of generalized linear Kerdock code over R.     

On the structure of solutions to a class of quasilinear elliptic Neumann problems

We study the structure of positive solutions to the equation ?^mΔ_mu-u^m-1+f(u)=0 with homogeneous Neumann boundary condition. First, we show the existence of a mountain-pass solution and find that as ?→0⁺ the mountain-pass solution develops into a spike-layer solution. Second, we prove that there is an uniform upper bound independent of ? for any positive solution to our problem. We also present a Harnack-type inequality for the positive solutions. Finally, we show that if 1<m?2 holds and ? is sufficiently large, any positive solution must be a constant.     

Potential theory in the class of m-subharmonic functions

A potential theory for the equation (dd ^c u)m ∧ β ^n?m = fβ ⁿ , 1 ≤ m ≤ n, is developed. The corresponding notions of m-capacity and m-subharmonic functions are introduced, and their properties are studied.     

Universal self-similarity of porous media equation with absorption: the critical exponent case

In this paper we study the large time behavior of non-negative solutions to the Cauchy problem of u_t=Δu^m−u^q in R^N×(0,∞), where m>1 and q=q_c≡m+2/N is a critical exponent. For non-negative initial value u(x,0)=u₀(x)∈L¹(R^N), we show that the solution converges, if u₀(x)(1+|x|)^k is bounded for some k>N, to a unique fundamental solution of u_t=Δu^m, independent of the initial value, with additional logarithmic anomalous decay exponent in time as t→∞.     

Hölder Continuous Solutions to Complex Hessian Equations

We prove the Hölder continuity of the solution to complex Hessian equation with the right hand side in L ^p , \(p>\frac {n}{m}\) , 1 < m < n, in a m-strongly pseudoconvex domain in ? ⁿ under some additional conditions on the density near the boundary and on the boundary data.     

On the false discovery proportion convergence under Gaussian equi-correlation

We study the convergence of the false discovery proportion (FDP) of the Benjamini-Hochberg procedure in the Gaussian equi-correlated model, when the correlation ρ_m converges to zero as the hypothesis number m grows to infinity. In this model, the FDP converges to the false discovery rate (FDR) at rate {min(m,1/ρ_m)}^1/2, which is different from the standard convergence rate m^1/2 holding under independence.     

On critical Fujita exponents for the porous medium equation with a nonlinear boundary condition

We establish the critical Fujita exponents for the solution of the porous medium equation u_t=Δu^m, x∈R₊^N, t>0, subject to the nonlinear boundary condition −∂u^m/∂x₁=u^p, x₁=0, t>0, in multi-dimension.     

A note on the numerical evaluation of finite integrals of oscillatory functions

A method is described for the numerical evaluation of integrals of the form ∫ _?1 ¹ f(x)K(m,x)dx, wheref(x) is smooth in [?1,1], whileK(m,x) is highly oscillatory for large values ofm.     

On the Fourier transforms of retarded Lorentz-invariant functions

In this article we evaluate the Fourier transforms of retarded Lorentz-invariant functions (and distributions) as limits of Laplace transforms. Our method works generally for any retarded Lorentz-invariant functions φ(t) (t?Rⁿ) which is, besides, a continuous function of slow growth. We give, among others, the Fourier transform of G_R(t, α, m², n) and G_A(t, α, m², n), which, in the particular case α = 1, are the characteristic functions of the volume bounded by the forward and the backward sheets of the hyperboloid u = m² and by putting α = ?k are the derivatives of k-order of the retarded and the advanced-delta on the hyperboloid u = m². We also obtain the Fourier transform of the function W(t, α, m², n) introduced by M. Riesz (Comm. Sem. Mat. Univ. Lund4 (1939)). We finish by evaluating the Fourier transforms of the distributional functions G_R(t, α, m², n), G_A(t, α, m², n) and W(t, α, m², n) in their singular points.     

Exact solution to a nonlinear Klein-Gordon equation

The nonlinear Klein-Gordon equation ?^μ?_μΦ + M²Φ + λ₁Φ^1?m + λ₂Φ^1?2m = 0 has the exact formal solution Φ = [u^2m ?λ₁u^m/(m ? 2)M²+λ₁²/(m?2)²M⁴?λ₂/4(m ? 1)M²]^1/mu^?1, m ≠ 0, 1, 2, where u and v^?1 are solutions of the linear Klein-Gordon equation. This equation is a simple generalization of the ordinary second order differential equation satisfied by the homogeneous function y = [au^m + b(uv)^m/2 + cv^m]^k/m, where u and v are linearly independent solutions of y″ + r(x) y′ + q(x) y = 0.     

PCR algorithm for parallel computing the solution of the general restricted linear equations

In this paper we present a parallel algorithm for parallel computing the solution of the general restricted linear equations Ax=b,x∈T, where T is a subspace of ? ⁿ and b∈AT. By this algorithm the solution x=A _T,S ⁽²⁾ b is obtained in n(log?₂ m+log?₂(n?s+1)+7)+log?₂ m+1 steps with P=mn processors when m≥2(n?1) and with P=2n(n?1) processors otherwise.     

On the maximum number of permutations with given maximal or minimal distance

Let us denote by R(k, ? λ)[R(k, ? λ)] the maximal number $\text{M}$ such that there exist $\text{M}$ different permutations of the set {1,…, k} such that any two of them have at least λ (at most λ, respectively) common positions. We prove the inequalities R(k, ? λ) ? kR(k ? 1, ? λ ? 1), R(k, ? λ) ? R(k, ? λ ? 1) ? k!, R(k, ? λ) ? kR(k ? 1, ? λ ? 1). We show: R(k, ? k ? 2) = 2, R(k, ? 1) = (k ? 1)!, R(p^m, ? 2) = (p^m ? 2)!, R(p^m + 1, ? 3) = (p^m ? 2)!, $\text{R(k, ? k ? 3) =}\text{k!}\text{2}$, R(k, ? 0) = k, R(p^m, ? 1) = p^m(p^m ? 1), R(p^m + 1, ? 2) = (p^m + 1)p^m(p^m ? 1). The exact value of R(k, ? λ) is determined whenever k ? k₀(k ? λ); we conjecture that R(k, ? λ) = (k ? λ)! for k ? k₀(λ). Bounds for the general case are given and are used to determine that the minimum of |R(k, ? λ) ? R(k, ? λ)| is attained for $\text{λ = (}\text{k}\text{2}\text{) + O(}\text{k}\text{log}\text{k}\text{)}$.     

On cyclic decompositions of the complete graph into the 2-regular graphs

The symbol C(m₁ ⁿ ₁m₂ ⁿ ₂...m_s ⁿ _s) denotes a 2-regular graph consisting ofn _i cycles of lengthm _i , i=1, 2,…,s. In this paper, we give some construction methods of cyclic(K _v ,G)-designs, and prove that there exists a cyclic(K _v , G)-design whenG=C((4m ₁) ⁿ ₁(4m ₂) ⁿ ₂...(4m _s ) ⁿ _s andv ≡ 1 (mod 2¦G¦).