‎This note deals with the systems of parabolic equations with local and localized sources involving $n$ components‎. ‎We obtained the exponent regions‎, ‎where $kin {1,2,cdots,n}$ components may blow up simultaneously while the other $(n-k)$ ones still remain bounded under suitable initial data‎. ‎It is proved that different initial data can lead to different blow-up phenomena even in the same ...

We study the numerical integration problem for functions with infinitely many variables. The functions we want to integrate are from a reproducing kernel Hilbert space which is endowed with a weighted norm. We study the worst case ε-complexity which is defined as the minimal cost among all algorithms whose worst case error over the Hilbert space unit ball is at most ε. Here we assume that the c...

We consider an inverse problem of recovering the non-linearity in one dimensional variable exponent $p(x)$-Laplace equation from Dirichlet-to-Neumann map. The can be recovered up to natural obstruction rearrangements. main technique is using a Muntz-Szasz theorem after reducing determining function its $L^p$-norms.

In 1867, Syvlester noted that the Kronecker product of two Hadamard matrices is an Hadamard matrix. This gave a way to obtain an Hadamard matrix of exponent four from two of exponent two. Early last decade, Agayan and Sarukhanyan found a way to combine two Hadamard matrices of exponent two to obtain one of exponent three, and just last year Craigen, Seberry and Zhang discovered how to combine f...

We consider the transmission of nonexponentially many messages through a binary symmetric channel with noiseless feedback. obtain an upper bound for best decoding error exponent. Combined corresponding known lower bound, this allows us to find reliability function at zero rate.

We prove that for k ≪ 4 √n regular resolution requires length nΩ(k ) to establish that an Erdős–Rényi graph with appropriately chosen edge density does not contain a k-clique. This lower bound is optimal up to the multiplicative constant in the exponent, and also implies unconditional nΩ(k ) lower bounds on running time for several state-of-the-art algorithms for finding maximum cliques in graphs.