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.     

One characterization of symmetry

In this note we present one characterization of symmetry of probability distributions in Euclidean spaces which is formulated as follows. Let X and Y be independent and identically distributed random elements in a separable Euclidean space E. If Ee^h|X|<∞, h>0, then the distribution of X is symmetric if and only if E|(X−Y,t)|^p=E|(X+Y,t)|^p for some 0<p<2 and for any t∈E. The criterion is not correct when at least one of the conditions 0<p<2 or Ee^h|X|<∞ breaks.     

Precise and fast computation of a general incomplete elliptic integral of third kind by half and double argument transformations

This is a continuation of our works to compute the incomplete elliptic integrals of the first and second kind (Fukushima (2010, 2011) [21] and [23]). We developed a method to compute an associate incomplete elliptic integral of the third kind, J(φ,n|m)≡[Π(φ,n|m)−F(φ|m)]/n, by the half argument formulas of the sine and cosine amplitude functions and the double argument transformation of the integral. The relative errors of J(φ,n|m) computed by the new method are sufficiently small as less than 20 machine epsilons. Meanwhile, the simplicity of the adopted algorithm makes the new method run 1.5 to 3.7 times faster than Carlson’s duplication method. The combination of the new method and that to compute simultaneously two other associate incomplete elliptic integrals of the second kind, B(φ|m)≡[E(φ|m)−(1−m)F(φ|m)]/m and D(φ|m)≡[F(φ|m)−E(φ|m)]/m, which we established recently [23], enables a precise and fast computation of arbitrary linear combination of Legendre’s incomplete elliptic integrals of all three kinds, F(φ|m), E(φ|m), and Π(φ,n|m). These new procedures share the same device, the half argument transformations, while the double argument transformation of J(φ,n|m) includes those of B(φ|m) and D(φ|m) as its sub component. As a result, the simultaneous computation of the three associate integrals is significantly faster than computing them separately. In fact, our combined procedure is 2.7 to 5.9 times faster than the combination of Carlson’s duplication method to compute R_D and R_J.     

All spectral dominant norms are stable

A vector norm |·|on the space of n×n complex valued matrices is called stable if for some constant K&>0, not depending upon A or m, we have |A^m|?K|A|^m We show that such a norm is stable if and only if it dominates the spectralradius.     

Distance-restricted matching extension in planar triangulations

A graph G is said to have property E(m,n) if it contains a perfect matching and for every pair of disjoint matchings M and N in G with |M|=m and |N|=n, there is a perfect matching F in G such that M⊆F and N∩F=0?. In a previous paper (Aldred and Plummer 2001) [2], an investigation of the property E(m,n) was begun for graphs embedded in the plane. In particular, although no planar graph is E(3,0), it was proved there that if the distance among the three edges is at least two, then they can always be extended to a perfect matching. In the present paper, we extend these results by considering the properties E(m,n) for planar triangulations when more general distance restrictions are imposed on the edges to be included and avoided in the extension.     

A common property of R(E, F) and B(ℝ n , ℝ m ) and a new method for seeking a path to connect two operators

Given two Banach spaces E, F, let B(E, F) be the set of all bounded linear operators from E into F, and R(E, F) the set of all operators in B(E, F) with finite rank. It is well-known that B(? ⁿ ) is a Banach space as well as an algebra, while B(? ⁿ , ? ^m ) for m ≠ n, is a Banach space but not an algebra; meanwhile, it is clear that R(E, F) is neither a Banach space nor an algebra. However, in this paper, it is proved that all of them have a common property in geometry and topology, i.e., they are all a union of mutual disjoint path-connected and smooth submanifolds (or hypersurfaces). Let Σ _r be the set of all operators of finite rank r in B(E, F) (or B(? ⁿ , ? ^m )). In fact, we have that 1) suppose Σ _r ∈ B(? ⁿ , ? ^m ), and then Σ _r is a smooth and path-connected submanifold of B(? ⁿ , ? ^m ) and dimΣ _r = (n + m)r ? r ², for each r ∈ [0, min{n,m}; if m ≠ n, the same conclusion for Σ _r and its dimension is valid for each r ∈ [0, min{n, m}]; 2) suppose Σ _r ∈ B(E, F), and dimF = ∞, and then Σ _r is a smooth and path-connected submanifold of B(E, F) with the tangent space T _A Σ _r = {B ∈ B(E, F): BN(A) ? R(A)} at each A ∈ Σ _r for 0 ? r ? ∞. The routine methods for seeking a path to connect two operators can hardly apply here. A new method and some fundamental theorems are introduced in this paper, which is development of elementary transformation of matrices in B(? ⁿ ), and more adapted and simple than the elementary transformation method. In addition to tensor analysis and application of Thom’s famous result for transversility, these will benefit the study of infinite geometry.     

Moderate deviations and Erdös-Rényi-Shepp laws for weighted sums

Let X₀,X₁,… be i.i.d. random variables with E(X₀)=0, E(X²₀)=1 and E(exp{tX₀})<∞ for any |t|<t₀. We prove that the weighted sums V(n)=∑_j=0^∞a_j(n)X_j, n?1 obey a moderately large deviation principle if the weights satisfy certain regularity conditions. Then we prove a new version of the Erdös-Rényi-Shepp laws for the weighted sums.     

Restricted matching in graphs of small genus

A graph G with at least 2n+2 vertices is said to be n-extendable if every set of n disjoint edges in G extends to (i.e., is a subset of) a perfect matching. More generally, a graph is said to have property E(m,n) if, for every matching M of size m and every matching N of size n in G such that M∩N=0?, there is a perfect matching F in G such that M⊆F, but F∩N=0?. G is said to have property E(0,0) if it has a perfect matching. The study of the properties E(m,n) is referred to as the study of restricted matching extension.In [M. Porteous, R. Aldred, Matching extensions with prescribed and forbidden edges, Australas. J. Combin. 13 (1996) 163-174; M. Porteous, Generalizing matching extensions, M.A. Thesis, University of Otago, 1995; A. McGregor-Macdonald, The E(m,n) property, M.Sc. Thesis, University of Otago, 2000], Porteous and Aldred, Porteous and McGregor-Macdonald, respectively, studied the possible implications among the properties E(m,n) for various values of m and n. In an earlier paper [R.E.L. Aldred, Michael D. Plummer, On restricted matching extension in planar graphs, in: 17th British Combinatorial Conference (Canterbury 1999), Discrete Math. 231 (2001) 73-79], the present authors completely determined which of the various properties E(m,n) always hold, sometimes hold and never hold for graphs embedded in the plane. In the present paper, we do the same for embeddings in the projective plane, the torus and the Klein bottle.     

A generalization of the Strassen converse

This note is devoted to a generalization of the Strassen converse. Let gn:R^∞→[0,∞], n?1 be a sequence of measurable functions such that, for every n?1, and for all x,y∈R^∞, where 0<C<∞ is a constant which is independent of n. Let be a sequence of i.i.d. random variables. Assume that there exist r?1 and a function ?:[0,∞)→[0,∞) with limt→∞?(t)=∞, depending only on the sequence such that lim supn→∞gn(X₁,X₂,…)=?(Er|X|) a.s. whenever Er|X|<∞ and EX=0. We prove the converse result, namely that lim supn→∞gn(X₁,X₂,…)<∞ a.s. implies Er|X|<∞ (and EX=0 if, in addition, lim supn→∞gn(c,c,…)=∞ for all c≠0). Some applications are provided to illustrate this result.     

On a singular integral on product spaces

We show that if K(x,y)=Ω(x,y)/|x|ⁿ|y|^m is a Calder n-Zygmund kerned on Rⁿ×R^m, where Ω∈L²(Sⁿ⁻¹×S^m−1) and b(x,y) is any bounded function which is radial with x∈Rⁿ and y∈R^m respectively, then b(x,y)K(x,y) is the kernel of a convolution operator which is bounded on L^p(Rⁿ×R^m) for 1<p<∞ and n≧2, m≧2. Project supported by NSFC     

A class of hypergraphs satisfying an inequality of Lovász

The following theorem is proved: Suppose that H = (X; E₁, E₂, …, E_m) is a hypergraph without odd cycles with n vertices and p components, such that any two edges have at most k vertices in common. If for any cycle C in H, there exist two vertices of C contained in at least two common edges of H, then Σ_i=1^m (|E_i| ? k) ≤ n ? pk.     

Forbidden (0,1)-Vectors in Hyperplanes of ℝ n : The Restricted Case

In this paper we continue our investigation on “Extremal problems under dimension constraint” introduced in [2]. Let E(n, k) be the set of (0,1)-vectors in ? ⁿ with k one's. Given 1 ≤ m, w ≤ n let X ? E(n, m) satisfy span (X) ∩ E(n, w) = ?. How big can |X| be? This is the main problem studied in this paper. We solve this problem for all parameters 1 ≤ m, w ≤ n and n > n ₀(m, w).     

Marcinkiewicz–Zygmund Type Strong Law of Large Numbers for Pairwise i.i.d. Random Variables

Etemadi (in Z. Wahrscheinlichkeitstheor. Verw. Geb. 55, 119–122, 1981) proved that the Kolmogorov strong law of large numbers holds for pairwise independent identically distributed (pairwise i.i.d.) random variables. However, it is not known yet whether the Marcinkiewicz–Zygmund strong law of large numbers holds for pairwise i.i.d. random variables. In this paper, we obtain the Marcinkiewicz–Zygmund type strong law of large numbers for pairwise i.i.d. random variables {X _n ,n≥1} under the moment condition E|X ₁| ^p (loglog|X ₁|)^2(p?1)<∞, where 1<p<2.     

On the Burkard-Hammer condition for hamiltonian split graphs

A graph G=(V,E) is called a split graph if there exists a partition V=I∪K such that the subgraphs of G induced by I and K are empty and complete graphs, respectively. In 1980, Burkard and Hammer gave a necessary but not sufficient condition for hamiltonian split graphs with |I|<|K|. In this paper, we show that the Burkard-Hammer condition is also sufficient for the existence of a Hamilton cycle in a split graph G such that 5≠|I|<|K| and the minimum degree δ(G)?|I|-3. For the case 5=|I|<|K|, all split graphs satisfying the Burkard-Hammer condition but having no Hamilton cycles are also described.     

Sparse connectivity certificates via MA orderings in graphs

For an undirected multigraph G=(V,E), let α be a positive integer weight function on V. For a positive integer k, G is called (k,α)-connected if any two vertices u,v∈V remain connected after removal of any pair (Z,E^′) of a vertex subset Z⊆V-{u,v} and an edge subset E^′⊆E such that ∑_v∈Zα(v)+|E^′|<k. The (k,α)-connectivity is an extension of several common generalizations of edge-connectivity and vertex-connectivity. Given a (k,α)-connected graph G, we show that a (k,α)-connected spanning subgraph of G with O(k|V|) edges can be found in linear time by using MA orderings. We also show that properties on removal cycles and preservation of minimum cuts can be extended in the (k,α)-connectivity.     

On the minimum number of disjoint pairs in a family of finite sets

The following conjecture of Katona is proved. Let X be a finite set of cardinality n, 1 ? m ? 2ⁿ. Then there is a family $\text{F}$, |$\text{F}$| = m, such that F ∈ $\text{F}$, G ? X, | G | > | F | implies G ∈ $\text{F}$ and $\text{F}$ minimizes the number of pairs (F₁, F₂), F₁, F₂ ∈ $\text{F}$ F₁ ∩ F₂ = ? over all families consisting of m subsets of X.     

Hölder Continuity of the Green Function and Markov Brothers’ Inequality

Let V _E be the pluricomplex Green function associated with a compact subset E of \(\mathbb{C}^{N}\) . The well-known Hölder continuity property of E means that there exist constants B>0,γ∈(0,1] such that V _E (z)≤B?dist(z,E) ^γ . The main result of this paper says that this condition is equivalent to a Vladimir Markov-type inequality; i.e., ∥D ^α P∥ _E ≤M ^|α|(degP) ^m|α|(|α|!)^1?m ∥P∥ _E , where m,M>0 are independent of the polynomial P of N variables. We give some applications of this equivalence, e.g., for convex bodies in \(\mathbb{R}^{N}\) , for uniformly polynomially cuspidal sets and for some disconnect compact sets.     

The diagnonal multivariate natural exponential families and their classification

A natural exponential family (NEF)F in ? ⁿ ,n>1, is said to be diagonal if there existn functions,a ₁,...,a _n , on some intervals of ?, such that the covariance matrixV _F (m) ofF has diagonal (a ₁(m ₁),...,a _n (m _n )), for allm=(m ₁,...,m _n ) in the mean domain ofF. The familyF is also said to be irreducible if it is not the product of two independent NEFs in ? ^k and ? ^n-k , for somek=1,...,n?1. This paper shows that there are only six types of irreducible diagonal NEFs in ? ⁿ , that we call normal, Poisson, multinomial, negative multinomial, gamma, and hybrid. These types, with the exception of the latter two, correspond to distributions well established in the literature. This study is motivated by the following question: IfF is an NEF in ? ⁿ , under what conditions is its projectionp(F) in ? ^k , underp(x ₁,...,x _n )∶=(x ₁,...,x _k ),k=1,...,n?1, still an NEF in ? ^k ? The answer turns out to be rather predictable. It is the case if, and only if, the principalk×k submatrix ofV _F (m ₁,...,m _n ) does not depend on (m _k+1,...,m _n ).     

Extensions of the Scherk-Kemperman Theorem

Let Γ=(V,E) be a reflexive relation with a transitive automorphism group. Let F be a finite subset of V containing a fixed element v. We prove that the size of Γ(F) (the image of F) is at least

|F|+|Γ(v)|−|Γ⁻(v)∩F|.