Necessary and Sufficient Conditions for the Oscillation of a Second Order Linear Differential Equation

In this paper we give a necessary and sufficient condition for the oscillation of the second order linear differential equation where p is a locally integrable function and either or where We give some applications which show how these results unify and imply some classical results in oscillation theory.     

On (ε,k)‐min‐wise independent permutations

A family of permutations of [n] = {1,2,…,n} is (ε,k)‐min‐wise independent if for every nonempty subset X of at most k elements of [n], and for any x ∈ X, the probability that in a random element π of , π(x) is the minimum element of π(X), deviates from 1/∣X∣ by at most ε/∣X∣. This notion can be defined for the uniform case, when the elements of are picked according to a uniform distribution, or for the more general, biased case, in which the elements of are chosen according to a given distribution D. It is known that this notion is a useful tool for indexing replicated documents on the web. We show that even in the more general, biased case, for all admissible k and ε and all large n, the size of must satisfy as well as This improves the best known previous estimates even for the uniform case. © 2007 Wiley Periodicals, Inc. Random Struct. Alg., 2007     

Second‐order backward stochastic differential equations and fully nonlinear parabolic PDEs

For a d‐dimensional diffusion of the form dX_t = μ(X_t)dt + σ(X_t)dW_t and continuous functions f and g, we study the existence and uniqueness of adapted processes Y, Z, Γ, and A solving the second‐order backward stochastic differential equation (2BSDE) If the associated PDE has a sufficiently regular solution, then it follows directly from Itô's formula that the processes solve the 2BSDE, where ?? is the Dynkin operator of X without the drift term. The main result of the paper shows that if f is Lipschitz in Y as well as decreasing in Γ and the PDE satisfies a comparison principle as in the theory of viscosity solutions, then the existence of a solution (Y, Z,Γ, A) to the 2BSDE implies that the associated PDE has a unique continuous viscosity solution v and the process Y is of the form Y_t = v(t, X_t), t ∈ [0, T]. In particular, the 2BSDE has at most one solution. This provides a stochastic representation for solutions of fully nonlinear parabolic PDEs. As a consequence, the numerical treatment of such PDEs can now be approached by Monte Carlo methods. © 2006 Wiley Periodicals, Inc.     

On the Eigenvalues of Half‐Linear Boundary Value Problems

We consider the half‐linear boundary value problem where and the weight function q is assumed to change sign. We prove the existence of two sequences , of eigenvalues and derive asymptotic estimates for as .     

Analytic aspects of the Toda system: I. A Moser‐Trudinger inequality

In this paper, we analyze solutions of the open Toda system and establish an optimal Moser‐Trudinger type inequality for this system. Let Σ be a closed surface with area 1 and K = (a_ij)_{N × N} the Cartan matrix for SU(N + 1), i.e., We show that has a lower bound in (H¹(Σ))^N if and only if This inequality is optimal. As a direct consequence, if M_j < for 4π for j = 1, 2, …, N, Φ_M has a minimizer u that satisfies © 2001 John Wiley & Sons, Inc.     

A row relaxation method for large ℓp least norm problems

This paper presents a row relaxation method for solving the regularized ?p least norm problem where e and p are positive constants, 1<p<∞ The interest that we have in this problem lies in the observation that for small values of E the minimizer of P (X ) is a good substitute for a minimizer of the unregularized problem It is shown that the dual of the regularized problem has the form where q = p /(p - 1). Moreover, if y solves the dual problem then X = A^Ty/? solves the primal problem and P(A^Ty/?) = D(y). Maximizing the dual objective function by changing one variable at a time results in a row relaxation method that resembles Kaczmarz's method. This feature makes the new method suitable for solving large sparse C, problems that arise in computerized tomography, geophysics, and groundwater hydrology. Numerical experiments illustrate the feasibility of our ideas.     

Radially symmetric Poisson–Boltzmann equation in a domain expanding to infinity

The electric potential u in a solution of an electrolyte around a linear polyelectrolyte of the form of a cylinder satisfies We study the problem when R → ∞.     

Implicit linear time‐dependent differential‐difference equations and applications

The paper deals with the differential‐difference equation in a Banach space. The operator coefficient of the delay‐free derivative is allowed to be degenerate. Existence and uniqueness theorems are proved under the main assumption that for every the point is a polar singularity of the resolvent . The results are applied to evolution problems of microwave circuits. Copyright © 2000 John Wiley & Sons, Ltd.     

Quasilinear degenerate parabolic equations of Kirchhoff type

We investigate the evolution problem where H is a Hilbert space, A is a self‐adjoint linear non‐negative operator on H with domain D(A), and is a continuous function. We prove that if , and , then there exists at least one global solution, which is unique if either m never vanishes, or m is locally Lipschitz continuous. Moreover, we prove that if for all , then this problem is well posed in H. On the contrary, if for some it happens that for all , then this problem has no solution if with β small enough. We apply these results to degenerate parabolic PDEs with non‐local non‐linearities. Copyright © 1999 John Wiley & Sons, Ltd.     

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     

Energy Estimates and Cavity Interaction for a Critical‐Exponent Cavitation Model

We consider the minimization of in a perforated domain of among maps that are incompressible (det ) and invertible, and satisfy a Dirichlet boundary condition u = g on ?Ω. If the volume enclosed by g (?Ω) is greater than |Ω|, any such deformation u is forced to map the small holes B_ε( a _i) onto macroscopically visible cavities (which do not disappear as ε → 0). We restrict our attention to the critical exponent p = n, where the energy required for cavitation is of the order of and the model is suited, therefore, for an asymptotic analysis (v₁,…, v_M denote the volumes of the cavities). In the spirit of the analysis of vortices in Ginzburg‐Landau theory, we obtain estimates for the “renormalized” energy showing its dependence on the size and the shape of the cavities, on the initial distance between the cavitation points a ₁,…, a _M, and on the distance from these points to the outer boundary ?Ω. Based on those estimates we conclude, for the case of two cavities, that either the cavities prefer to be spherical in shape and well separated, or to be very close to each other and appear as a single equivalent round cavity. This is in agreement with existing numerical simulations and is reminiscent of the interaction between cavities in the mechanism of ductile fracture by void growth and coalescence. © 2012 Wiley Periodicals, Inc.     

Blow‐up analysis for a system of heat equations coupled via nonlinear boundary conditions

In this paper, we study a system of heat equations coupled via nonlinear boundary conditions (1) Here p, q>0. We prove that the solutions always blow up in finite time for non‐trivial and non‐negative initial values. We also prove that the blow‐up occurs only on S_R = ?B_R for Ω = B_R = {x ? ?ⁿ:|x|<R}and under some assumptions on the initial values. Copyright © 2007 John Wiley & Sons, Ltd.     

Solutions of symmetry‐constrained least‐squares problems

In this paper, two new matrix‐form iterative methods are presented to solve the least‐squares problem: and matrix nearness problem: where matrices and are given; ??₁ and ??₂ are the set of constraint matrices, such as symmetric, skew symmetric, bisymmetric and centrosymmetric matrices sets and S_XY is the solution pair set of the minimum residual problem. These new matrix‐form iterative methods have also faster convergence rate and higher accuracy than the matrix‐form iterative methods proposed by Peng and Peng (Numer. Linear Algebra Appl. 2006; 13 : 473–485) for solving the linear matrix equation AXB+CYD=E. Paige's algorithms, which are based on the bidiagonalization procedure of Golub and Kahan, are used as the framework for deriving these new matrix‐form iterative methods. Some numerical examples illustrate the efficiency of the new matrix‐form iterative methods. Copyright © 2008 John Wiley & Sons, Ltd.     

Nontrivial periodic solutions of a nonlinear beam equation

We consider the existence of a nontrivial solution of the following equation: where g is a nondecreasing function defined on R¹, satisfies g(O) = O, and some other additional conditions. Our results and methods are quite similar to those associated with recent work on the nonlinear wave equation [1]-[8]: .     

Ryser's embedding problem for Hadamard matrices

What is the minimum order of a Hadamard matrix that contains an a by b submatrix of all 1's? Newman showed that where c^? denotes the smallest order greater than or equal to c for which a Hadamard matrix exists. It follows that if 4 divides both a and b, and if the Hadamard conjecture is true, then . We establish the improved bounds for min {a,b} ≥ 2. The Hadamard conjecture therefore implies that if 4 divides both 2ab and ?a/2? ?b/2?, then (a, b) = 2 · max {?a/2?b, ?b/2?a}. Our lower bound comes from a counting argument, while our upper bound follows from a sub‐multiplicative property of : Improvements in our upper bound occur when suitable conference matrices or Bush‐type Hadamard matrices exist. We conjecture that any (1,?1)‐matrix of size a by b occurs as a submatrix of some Hadamard matrix of order at most . © 2005 Wiley Periodicals, Inc. J Combin Designs     

Comparing Packing Measures to Hausdorff Measures on the Line

For each 0 < s < 1, define where , denote respectively the s‐dimensional packing measure and Hausdorff measure, and the infimum is taken over all the sets E ⊂ R with . In this paper we give a nontrivial estimation of c(s), namely, for each 0 < s < 1, where . As an application, we obtain a lower density theorem for Hausdorff measures.     

Small degree out‐branchings

Using a suitable orientation, we give a short proof of a strengthening of a result of Czumaj and Strothmann 4 : Every 2‐edge‐connected graph G contains a spanning tree T with the property that for every vertex v. As an analogue of this result in the directed case, we prove that every 2‐arc‐strong digraph D has an out‐branching B such that . A corollary of this is that every k‐arc‐strong digraph D has an out‐branching B such that , where . We conjecture that in this case would be the right (and best possible) answer. If true, this would again imply a strengthening of a result from 4 concerning spanning trees with small degrees in k‐connected graphs when k ≥ 2. We prove that for acyclic digraphs the existence of an out‐branching satisfying prescribed bounds on the out‐degrees of each vertex can be checked in polynomial time. A corollary of this is that the existence of arc‐disjoint branchings , , where the first is an out‐branching rooted at s and the second an in‐branching rooted at t, can be checked in polynomial time for the class of acyclic digraphs © 2003 Wiley Periodicals, Inc. J Graph Theory 42: 297–307, 2003     

Eulerian subgraphs in 3‐edge‐connected graphs and Hamiltonian line graphs

In this paper, we show that if G is a 3‐edge‐connected graph with and , then either G has an Eulerian subgraph H such that , or G can be contracted to the Petersen graph in such a way that the preimage of each vertex of the Petersen graph contains at least one vertex in S. If G is a 3‐edge‐connected planar graph, then for any , G has an Eulerian subgraph H such that . As an application, we obtain a new result on Hamiltonian line graphs. © 2003 Wiley Periodicals, Inc. J Graph Theory 42: 308–319, 2003     

Integrability Properties of the Maximal Operator on Partial Sums of Fourier Series in Orlicz Spaces

Let S* (f be the majorant function of the partial sums of the trigonometric Fourier series of f. In this paper we consider the Orlicz space Lπ and give a generalization of Soria's result [S1]. Let π (t) be a concave function with some nice properties and . If there exists a positive constant a₀ < 1 such that then we have .     

Compactness Conditions for the Green Operator in Lp(ℝ) Corresponding to a General Sturm–Liouville Operator

We consider the equation ℝ, where , for ℝ, (ℝ), (ℝ), (ℝ), (ℝ) := C(ℝ)). We give necessary and sufficient conditions under which, regardless of , the following statements hold simultaneously: I) For any (ℝ) Equation (0.1) has a unique solution (ℝ) where $\int ^{\infty}_{-\infty}$ ℝ. II) The operator (ℝ) → (ℝ) is compact. Here is the Green function corresponding to (0.1). This result is applied to study some properties of the spectrum of the Sturm–Liouville operator.