Absence of collapse in a parabolic chemotaxis system with signal‐dependent sensitivity

We consider the chemotaxis system under homogeneous Neumann boundary conditions in a smooth bounded domain Ω ? ?ⁿ. The chemotactic sensitivity function is assumed to generalize the prototype It is proved that no chemotactic collapse occurs in the sense that for any choice of nonnegative initial data (with some r > n), the corresponding initial‐boundary value problem possesses a unique global solution that is uniformly bounded (© 2010 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Multiple impulse solutions to McKean's caricature of the nerve equation. I—existence

McKean's caricature of the nerve equation: is considered. The H in (1) is the Heaviside function. We prove the existence of multiple impulse solutions consisting of any finite number of pulses. These solutions are referred to as n-ple impulse solutions, where n is an arbitrary positive integer.     

Classification of solutions for an integral equation

Let n be a positive integer and let 0 < α < n. Consider the integral equation We prove that every positive regular solution u(x) is radially symmetric and monotone about some point and therefore assumes the form with some constant c = c(n, α) and for some t > 0 and x₀ ? ?ⁿ. This solves an open problem posed by Lieb 12 . The technique we use is the method of moving planes in an integral form, which is quite different from those for differential equations. From the point of view of general methodology, this is another interesting part of the paper. Moreover, we show that the family of well‐known semilinear partial differential equations is equivalent to our integral equation (0.1), and we thus classify all the solutions of the PDEs. © 2005 Wiley Periodicals, Inc.     

Explicit sparse almost‐universal graphs for ${\bf {{\cal G}(n, {k \over n})}}$

For any integer n, let be a probability distribution on the family of graphs on n vertices (where every such graph has nonzero probability associated with it). A graph Γ is ‐almost‐universal if Γ satisifies the following: If G is chosen according to the probability distribution , then G is isomorphic to a subgraph of Γ with probability 1 ‐ . For any p ∈ [0,1], let (n,p) denote the probability distribution on the family of graphs on n vertices, where two vertices u and v form an edge with probability p, and the events {u and v form an edge}; u,v ∈ V (G) are mutually independent. For k ≥ 4 and n sufficiently large we construct a ‐almost‐universal‐graph on n vertices and with O(n)polylog(n) edges, where q = ? ? for such k ≤ 6, and where q = ? ? for k ≥ 7. The number of edges is close to the lower bound of Ω( ) for the number of edges in a universal graph for the family of graphs with n vertices and maximum degree k. © 2010 Wiley Periodicals, Inc. Random Struct. Alg., 2010     

Tauberian theorem for m‐spherical transforms on the Heisenberg group

In this paper we prove a Tauberian type theorem for the space L ( H _n ). This theorem gives sufficient conditions for a L ( H _n ) submodule J ? L ( H _n ) to make up all of L ( H _n ). As a consequence of this theorem, we are able to improve previous results on the Pompeiu problem with moments on the Heisenberg group for the space L^∞( H _n ). In connection with the Pompeiu problem, given the vanishing of integrals ∫ z ^m L _g f ( z , 0) dσ ( z ) = 0 for all g ∈ H _n and i = 1, 2 for appropriate radii r₁ and r₂, we now have the (improved) conclusion f ≡ 0, where = · · · and form the standard basis for T^(0,1)( H _n ). (© 2007 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Random partitions with restricted part sizes

For a subset of positive integers let Ω(n, ) be the set of partitions of n into summands that are elements of . For every λ ∈ Ω(n, ), let M _n(λ) be the number of parts, with multiplicity, that λ has. Put a uniform probability distribution on Ω(n, ), and regard M _n as a random variable. In this paper the limiting density of the (suitably normalized) random variable M _n is determined for sets that are sufficiently regular. In particular, our results cover the case = {Q(k) : k ≥ 1}, where Q(x) is a fixed polynomial of degree d ≥ 2. For specific choices of Q, the limiting density has appeared before in rather different contexts such as Kingman's coalescent, and processes associated with the maxima of Brownian bridge and Brownian meander processes. © 2007 Wiley Periodicals, Inc. Random Struct. Alg., 2008     

Extending the Erdős–Ko–Rado theorem

Let be a k‐uniform hypergraph on n vertices. Suppose that holds for all . We prove that the size of is at most if satisfies and n is sufficiently large. © 2005 Wiley Periodicals, Inc. J Combin Designs     

Global solutions in a fully parabolic chemotaxis system with singular sensitivity

The Neumann boundary value problem for the chemotaxis system is considered in a smooth bounded domain Ω??ⁿ, n?2, with initial data and v₀∈W^{1, ∞}(Ω) satisfying u₀?0 and v₀>0 in . It is shown that if then for any such data there exists a global‐in‐time classical solution, generalizing a previous result which asserts the same for n=2 only. Furthermore, it is seen that the range of admissible χ can be enlarged upon relaxing the solution concept. More precisely, global existence of weak solutions is established whenever . Copyright © 2010 John Wiley & Sons, Ltd.     

On planar intersection graphs with forbidden subgraphs

Let be a family of n compact connected sets in the plane, whose intersection graph has no complete bipartite subgraph with k vertices in each of its classes. Then has at most n times a polylogarithmic number of edges, where the exponent of the logarithmic factor depends on k. In the case where consists of convex sets, we improve this bound to O(n log n). If in addition k = 2, the bound can be further improved to O(n). © 2008 Wiley Periodicals, Inc. J Graph Theory 59: 205–214, 2008     

Multi solitary waves for nonlinear Schrödinger equations

We consider the nonlinear Schrödinger equation in for any d1, with a nonlinearity such that solitary waves exist and are stable. Let R_k(t,x) be K arbitrarily given solitary waves of the equation with different speeds v₁,v₂,…,v_K. In this paper, we prove that there exists a solution u(t) of the equation such that

     

Law of large numbers for increasing subsequences of random permutations

Let the random variable Z_n,k denote the number of increasing subsequences of length k in a random permutation from S_n, the symmetric group of permutations of {1,…,n}. We show that Var(Z) = o((EZ)²) as n → ∞ if and only if . In particular then, the weak law of large numbers holds for Z if ; that is, We also show the following approximation result for the uniform measure U_n on S_n. Define the probability measure μ on S_n by where U denotes the uniform measure on the subset of permutations that contain the increasing subsequence {x₁,x₂,…,x}. Then the weak law of large numbers holds for Z if and only if where ∣∣˙∣∣ denotes the total variation norm. In particular then, (*) holds if . In order to evaluate the asymptotic behavior of the second moment, we need to analyze occupation times of certain conditioned two‐dimensional random walks. © 2005 Wiley Periodicals, Inc. Random Struct. Alg., 2006     

A refinement of Vietoris' inequality for sine polynomials

Let where In 1958, Vietoris proved that σ_n (x) is positive for all n ≥ 1 and x ∈ (0, π). We establish the following refinement. The inequalities hold for all natural numbers n and real numbers n ≥ 1 and x ∈ (0, π) if and only if      

A limiting distribution for the number of cuts needed to isolate the root of a random recursive tree

Let X_n be the number of cuts needed to isolate the root in a random recursive tree with n vertices. We provide a weak convergence result for X_n. The basic observation for its proof is that the probability distributions of are recursively defined by , where D_n is a discrete random variable with ? , which is independent of . This distributional recursion was not studied previously in the sense of weak convergence. © 2008 Wiley Periodicals, Inc. Random Struct. Alg., 2009     

Correlations for paths in random orientations of G(n,p) and G(n,m)

We study random graphs, both G( n,p) and G( n,m), with random orientations on the edges. For three fixed distinct vertices s,a,b we study the correlation, in the combine probability space, of the events $\{a\to s\}$ and $\{s\to b\}$ . For G(n,p), we prove that there is a $pc = 1/2$ such that for a fixed $p < pc$ the correlation is negative for large enough n and for $p > pc$ the correlation is positive for large enough n. We conjecture that for a fixed $n \ge 27$ the correlation changes sign three times for three critical values of p. For G(n,m) it is similarly proved that, with $p=m/({{n}\atop {2}})$ , there is a critical pc that is the solution to a certain equation and approximately equal to 0.7993. A lemma, which computes the probability of non existence of any $\ell$ directed edges in G(n,m), is thought to be of independent interest. We present exact recursions to compute \input amssym $\Bbb{P}(a\to s)$ and \input amssym $\Bbb{P}(a\to s, s\to b)$ . We also briefly discuss the corresponding question in the quenched version of the problem. © 2011 Wiley Periodicals, Inc. Random Struct. Alg., 2011     

Random coloring method in the combinatorial problem of Erdős and Lovász

The work deals with a combinatorial problem of P. Erd?s and L. Lovász concerning simple hypergraphs. Let denote the minimum number of edges in an n‐uniform simple hypergraph with chromatic number at least . The main result of the work is a new asymptotic lower bound for . We prove that for large n and r satisfying the following inequality holds where . This bound improves previously known bounds for . The proof is based on a method of random coloring. We have also obtained results concerning colorings of h‐simple hypergraphs. © 2011 Wiley Periodicals, Inc. Random Struct. Alg., 2012     

A generalization of the Oberwolfach problem

Let n > 1 be an integer and let a₂,a₃,…,a_n be nonnegative integers such that . Then can be factored into ‐factors, ‐factors,…, ‐factors, plus a 1‐factor. © 2002 Wiley Periodicals, Inc. J Graph Theory 41: 151–161, 2002     

On the multi‐colored Ramsey numbers of cycles

For a graph L and an integer k≥2, R_k(L) denotes the smallest integer N for which for any edge‐coloring of the complete graph K_N by k colors there exists a color i for which the corresponding color class contains L as a subgraph. Bondy and Erdos conjectured that, for an odd cycle C_n on n vertices, They proved the case when k = 2 and also provided an upper bound R_k(C_n)≤(k+ 2)!n. Recently, this conjecture has been verified for k = 3 if n is large. In this note, we prove that for every integer k≥4, When n is even, Sun Yongqi, Yang Yuansheng, Xu Feng, and Li Bingxi gave a construction, showing that R_k(C_n)≥(k?1)n?2k+ 4. Here we prove that if n is even, then © 2011 Wiley Periodicals, Inc. J Graph Theory 69: 169‐175, 2012     

A topological degree counting for some Liouville systems of mean field type

Let A = (a_ij)_{n × n} be an invertible matrix and A⁻¹ = (a^ij)_{n × n} be the inverse of A. In this paper, we consider the generalized Liouville system (0.1) where 0 < h_j ∈ C¹(M) and \input amssym $\rho_j \in \Bbb R^+$ , and prove that, under the assumptions of (H₁) and (H₂) (see Introduction), the Leray‐Schauder degree of (0.1) is equal to if ρ = (ρ₁, …, ρ_n) satisfies Equation (0.1) is a natural generalization of the classic Liouville equation and is the Euler‐Lagrangian equation of the nonlinear function Φ_ρ: The Liouville system (0.1) has arisen in many different research areas in mathematics and physics. Our counting formulas are the first result in degree theory for Liouville systems. © 2010 Wiley Periodicals, Inc.     

Data Based Regularization Matrices for the Tikhonov-Phillips Regularization

In Tikhonov-Phillips regularization of general form the given ill-posed linear system is replaced by a Least Squares problem including a minimization of the solution vector x, relative to a seminorm with some regularization matrix L. Based on the finite difference matrix L_k, given by a discretization of the first or second derivative, we introduce the seminorm where the diagonal matrix and is the best available approximate solution to x. (© 2012 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Nonlinear Eigenvalue Problem for p-Laplacian in IRN

The nonlinear eigenvalue problem for p-Laplacian is considered. We assume that 1 < p < N and that the function f is of subcritical growth with respect to the variable u. The existence and C^1,α-regularity of the weak solution is proved.