On the number of positive solutions of elliptic systems

The paper deals with the existence, multiplicity and nonexistence of positive radial solutions for the elliptic system div(|?|^{p –2}?) + λk_i (|x |) fⁱ (u₁, …,u_n) = 0, p > 1, R₁ < |x | < R₂, u_i (x) = 0, on |x | = R₁ and R₂, i = 1, …, n, x ∈ ?^N , where k_i and fⁱ, i = 1, …, n, are continuous and nonnegative functions. Let u = (u₁, …, u_n), φ (t) = |t |^{p –2}t, fⁱ₀ = lim_{‖ u ‖→0}((fⁱ ( u ))/(φ (‖ u ‖))), fⁱ_∞= lim_{‖ u ‖→∞}((fⁱ ( u ))/(φ (‖ u ‖))), i = 1, …, n, f = (f¹, …, fⁿ), f ₀ = ∑ⁿ _{i =1} fⁱ ₀ and f _∞ = ∑ⁿ _{i =1} fⁱ _∞. We prove that either f ₀ = 0 and f _∞ = ∞ (superlinear), or f ₀ = ∞and f _∞ = 0 (sublinear), guarantee existence for all λ > 0. In addition, if fⁱ ( u ) > 0 for ‖ u ‖ > 0, i = 1, …, n, then either f ₀ = f _∞ = 0, or f ₀ = f _∞ = ∞, guarantee multiplicity for sufficiently large, or small λ, respectively. On the other hand, either f₀ and f_∞ > 0, or f₀ and f_∞ < ∞ imply nonexistence for sufficiently large, or small λ, respectively. Furthermore, all the results are valid for Dirichlet/Neumann boundary conditions. We shall use fixed point theorems in a cone. (© 2007 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Interior numerical approximation of boundary value problems with a distributional data

We study the approximation properties of a harmonic function u ∈ H^1?k(Ω), k > 0, on a relatively compact subset A of Ω, using the generalized finite element method (GFEM). If Ω = ??, for a smooth, bounded domain ??, we obtain that the GFEM‐approximation u_S ∈ S of u satisfies ‖u ? u_S‖ ≤ Ch^γ‖u‖, where h is the typical size of the “elements” defining the GFEM‐space S and γ ≥ 0 is such that the local approximation spaces contain all polynomials of degree k + γ. The main technical ingredient is an extension of the classical super‐approximation results of Nitsche and Schatz (Applicable Analysis 2 (1972), 161–168; Math Comput 28 (1974), 937–958). In addition to the usual “energy” Sobolev spaces H¹(??), we need also the duals of the Sobolev spaces H^m(??), m ∈ ?₊. © 2005 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2006     

The existence of positive solutions to a non‐local singular boundary value problem

We consider the non‐local singular boundary value problem (1) where q ∈ C⁰([0,1]) and f, h ∈ C⁰((0,∞)), limf(x)=?∞, limh(x)=∞. We present conditions guaranteeing the existence of a solution x ∈ C¹([0,1]) ∩ C²((0,1]) which is positive on (0,1]. The proof of the existence result is based on regularization and sequential techniques and on a non‐linear alternative of Leray–Schauder type. Copyright © 2005 John Wiley & Sons, Ltd.     

Behavior of the constant in Korenblum's maximum principle

Let A^p (??) (p ≥ 1) be the Bergman space over the open unit disk ?? in the complex plane. Korenblum's maximum principle states that there is an absolute constant c ∈ (0, 1) (may depend on p), such that whenever |f (z)| ≤ |g (z)| (f, g ∈ A^p (??)) in the annulus c < |z | < 1, then ∥f ≤ ∥g ∥. For p ≥ 1, let c_p be the largest value of c for which Korenblum's maximum principle holds. In this note we prove that c_p → 1 as p → ∞. Thus we give a positive answer of a question of Hinkkanen. (© 2008 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Edge-colored saturated graphs

A graph G is (k₁, k₂, …, k_t)-saturated if there exists a coloring C of the edges of G in t colors 1, 2, …, t in such a way that there is no monochromatic complete k_i-subgraph K of color i, 1 ? i ? t, but the addition of any new edge of color i, joining two nonadjacent vertices in G, with C, creates a monochromatic K of color i, 1 ? i ? t. We determine the maximum and minimum number of edges in such graphs and characterize the unique extremal graphs.     

Spherical Maximal Operators on Radial Functions

Let A_tf(x) denote the mean of f over a sphere of radius t and center x. We prove sharp estimates for the maximal function M_E f(X) = sup_t∈_E |Atf(x)| where E is a fixed set in IR⁺ and f is a radial function ∈ L^p(IR^d). Let P_d = d/(d?1) (the critical exponent for Stein's maximal function). For the cases (i) p < p_d, d ? 2, and (ii) p = p_d, d ? 3, and for p ? q ? ∞ we prove necessary and sufficient conditions on E for M_E to map radial functions in L^p to the Lorentz space L^P,q.     

Existence results for non-autonomous multiple-fragmentation models

We investigate an initial-value problem modelling fragmentation processes where particles split into two or more pieces at a rate, γ, that not only depends on the sizes of the particles involved but also on time. The existence of non-negative, mass-conserving solutions is established by considering a truncated version of an associated non-autonomous abstract Cauchy problem. The latter has solutions of the form u(t)=U_n(t,t₀)f, t⩾t₀, where f is the known data at some fixed time t₀⩾0 and {U_n(t,s)} is a uniformly continuous evolution system. A limit evolution system {U(t,s)} is shown to exist. Depending on the form of the known data f at time t₀, the scalar-valued function u, obtained from the limit evolution system via u(x, t)=[U(t, t₀)f](x) for a.e. x>0, t⩾t₀, is a solution of either the original initial-value problem or an integral version of this problem. © 1997 B. G. Teubner Stuttgart–John Wiley & Sons Ltd.     

Finding blocks and other patterns in a random coloring of ℤ

Let ξ = (ξ_k)_k∈? be i.i.d. with P(ξ_k = 0) = P(ξ_k = 1) = 1/2, and let S: = (S_k) be a symmetric random walk with holding on ?, independent of ξ. We consider the scenery ξ observed along the random walk path S, namely, the process (χ_k := ξ). With high probability, we reconstruct the color and the length of blockⁿ, a block in ξ of length ≥ n close to the origin, given only the observations (χ_k). We find stopping times that stop the random walker with high probability at particular places of the scenery, namely on blockⁿ and in the interval [?3ⁿ,3ⁿ]. Moreover, we reconstruct with high probability a piece of ξ of length of the order 3 around blockⁿ, given only 3 observations collected by the random walker starting on the boundary of blockⁿ. © 2005 Wiley Periodicals, Inc. Random Struct. Alg., 2006     

Covering arrays with mixed alphabet sizes

Covering arrays with mixed alphabet sizes, or simply mixed covering arrays, are natural generalizations of covering arrays that are motivated by applications in software and network testing. A (mixed) covering array A of type is a k × N array with the cells of row i filled with elements from ? and having the property that for every two rows i and j and every ordered pair of elements (e,f) ∈ ? × ?, there exists at least one column c, 1 ≤ c ≤ N, such that A_i,c = e and A_j,c = f. The (mixed) covering array number, denoted by , is the minimum N for which a covering array of type with N columns exists. In this paper, several constructions for mixed covering arrays are presented, and the mixed covering array numbers are determined for nearly all cases with k = 4 and for a number of cases with k = 5. © 2003 Wiley Periodicals, Inc. J Combin Designs 11: 413–432, 2003; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10059     

Star factorizations of graph products

A k‐star is the graph K_1,k. We prove a general theorem about k‐star factorizations of Cayley graphs. This is used to give necessary and sufficient conditions for the existence of k‐star factorizations of any power (K_q)^s of a complete graph with prime power order q, products C × C ×··· × C of k cycles of arbitrary lengths, and any power (C_r)^s of a cycle of arbitrary length. © 2001 John Wiley & Sons, Inc. J Graph Theory 36: 59–66, 2001     

About smoothness of solutions of the heat equations in closed,smooth space‐time domains

We consider the probabilistic solutions of the heat equation u = u + f in D, where D is a bounded domain in ?² = {(x¹, x²)} of class C^2k. We give sufficient conditions for u to have k^th‐order continuous derivatives with respect to (x¹, x²) in D? for integers k ≥ 2. The equation is supplemented with C^2k boundary data, and we assume that f ? C^2(k?1). We also prove that our conditions are sharp by examples in the border cases. © 2005 Wiley Periodicals, Inc.     

Factorizations of complete multipartite graphs into generalized cubes

For a positive integer d, the usual d‐dimensional cube Q_d is defined to be the graph (K₂)^d, the Cartesian product of d copies of K₂. We define the generalized cube Q(K_k, d) to be the graph (K_k)^d for positive integers d and k. We investigate the decomposition of the complete multipartite graph K into factors that are vertex‐disjoint unions of generalized cubes Q(K_k, d_i), where k is a power of a prime, n and j are positive integers with j ≤ n, and the d_i may be different in different factors. We also use these results to partially settle a problem of Kotzig on Q_d‐factorizations of K_n. © 2000 John Wiley & Sons, Inc. J Graph Theory 33: 144–150, 2000     

Robust characterizations of k‐wise independence over product spaces and related testing results

A discrete distribution D over Σ₁ ×··· ×Σ_n is called (non‐uniform) k ‐wise independent if for any subset of k indices {i₁,…,i_k} and for any z₁∈Σ,…,z_k∈Σ, Pr_X～D[X···X = z₁···z_k] = Pr_X～D[X = z₁]···Pr_X～D[X = z_k]. We study the problem of testing (non‐uniform) k ‐wise independent distributions over product spaces. For the uniform case we show an upper bound on the distance between a distribution D from k ‐wise independent distributions in terms of the sum of Fourier coefficients of D at vectors of weight at most k. Such a bound was previously known only when the underlying domain is {0,1}ⁿ. For the non‐uniform case, we give a new characterization of distributions being k ‐wise independent and further show that such a characterization is robust based on our results for the uniform case. These results greatly generalize those of Alon et al. (STOC'07, pp. 496–505) on uniform k ‐wise independence over the Boolean cubes to non‐uniform k ‐wise independence over product spaces. Our results yield natural testing algorithms for k ‐wise independence with time and sample complexity sublinear in terms of the support size of the distribution when k is a constant. The main technical tools employed include discrete Fourier transform and the theory of linear systems of congruences.© 2012 Wiley Periodicals, Inc. Random Struct. Alg., 2013     

New partial difference sets in p‐groups

Latin square type partial difference sets (PDS) are known to exist in R × R for various abelian p‐groups R and in ?^t. We construct a family of Latin square type PDS in ?^t × ?^2nt_p using finite commutative chain rings. When t is odd, the ambient group of the PDS is not covered by any previous construction. © 2002 Wiley Periodicals, Inc. J Combin Designs 10: 394–402, 2002; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10029     

On a Relation between Intrinsic and Extrinsic Dirichlet Forms for Interacting Particle Systems

In this paper we extend the result obtained in [AKR98] (see also [AKR96a]) on the representation of the intrinsic pre–Dirichlet form ℰ^Γ of the Poisson measure π_σ in terms of the extrinsic one ℰ^P. More precisely, replacing π_σ by a Gibbs measure μ on the configuration space Γ_X we derive a relation between the intrinsic prend–Dirichlet form ℰ^Γ_μ of the measure μ and the extrinsic one ℰ^P. As a consequence we prove the closability of ℰ^Γ_μ on L²(Γ_X, μ) under very general assumptions on the interaction potential of the Gibbs measures μ.     

On the Lp–Lq maximal regularity for the linear thermoelastic plate equation in a bounded domain

This paper is concerned with the thermoelastic plate equations in a domain Ω: subject to the boundary condition: u|=D_νu|=θ|=0 and initial condition: (u, u_t, θ)|_t=0=(u₀, v₀, θ₀). Here, Ω is a bounded domain in ?ⁿ(n≧2). We assume that the boundary ?Ω of Ω is a C⁴ hypersurface. We obtain an L_p–L_q maximal regularity theorem. Copyright © 2008 John Wiley & Sons, Ltd.     

Parametrizing Over ℤ Integral Values of Polynomials Over ℚ

Given a polynomial f ∈ ?[X] such that f(?) ? ?, we investigate whether the set f(?) can be parametrized by a multivariate polynomial with integer coefficients, that is, the existence of g ∈ ?[X ₁,…, X _m ] such that f(?) = g(? ^m ). We offer a necessary and sufficient condition on f for this to be possible. In particular, it turns out that some power of 2 is a common denominator of the coefficients of f, and there exists a rational β with odd numerator and odd prime-power denominator such that f(X) = f(β ?X). Moreover, if f(?) is likewise parametrizable, then this can be done by a polynomial in one or two variables.     

Universal robustness of scale‐free networks against cascading edge failures

Considering the effect of the local topology structure of an edge on cascading failures, we investigate the cascading reaction behaviors on scale‐free networks with respect to small edge‐based initial attacks. Adopt the initial load of an edge ij in a network to be L_ij = (k_ik_j)^α[(∑k_a)(∑k_b)]^β with k_i and k_j being the degrees of the nodes connected by the edge ij, where α and β are tunable parameters, governing the strength of the edge initial load, and Γ_i and Γ_j are the sets of neighboring nodes of i and j, respectively. Our aim is to explore the relationship between some parameters and universal robustness characteristics against cascading failures on scale‐free networks. We find by the theoretical analysis that the Baraba'si‐Albert (BA) scale‐free networks can reach the strongest robustness level against cascading failures when α + β = 1, where the robustness is quantified by a transition from normal state to collapse. And the network robustness has a positive correlation with the average degree. We furthermore confirm by the numerical simulations these results.     

Improved breakdown criterion for einstein vacuum equations in CMC gauge

Let ${\cal M}_*$ = ∪ Σ_t be a part of vacuum globally hyperbolic space‐time ( M , g ), foliated by constant mean curvature hypersurfaces Σ_t with t₀ < t_* < 0. We improve the existing breakdown criteria for Einstein vacuum equations by showing that the foliation can be extended beyond t_* provided the second fundamental form k and the lapse function n satisfy the weaker condition The proof of this result %in particular relies on the second main result of the paper, which gives a uniform lower bound on the null radius of injectivity. © 2011 Wiley Periodicals, Inc.     

Strong solutions to the Keller‐Segel system with the weak Ln /2 initial data and its application to the blow‐up rate

We shall show an exact time interval for the existence of local strong solutions to the Keller‐Segel system with the initial data u₀ in L^{n /2}_w (?ⁿ), the weak L^{n /2}‐space on ?ⁿ. If ‖u₀‖ is sufficiently small, then our solution exists globally in time. Our motivation to construct solutions in L^{n /2}_w (?ⁿ) stems from obtaining a self‐similar solution which does not belong to any usual L^p(?ⁿ). Furthermore, the characterization of local existence of solutions gives us an explicit blow‐up rate of ‖u (t)‖ for n /2 < p < ∞ as t → T_max, where T_max denotes the maximal existence time (© 2010 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)