Existence and regularity properties of non-isotropic singular elliptic equations

We establish existence and sharp regularity results for solutions to singular elliptic equations of the order u ^−β , 0 < β < 1, with gradient dependence and involving a forcing term λ f(x, u). Our approach is based on a singularly perturbed technique. We show that if the forcing parameter λ > 0 is large enough, our solution is positive. For λ small solutions vanish on a nontrivial set and therefore they exhibit free boundaries. We also establish regularity results for the free boundary and study the asymptotic behavior of the problem as b\searrow 0{\beta\searrow 0} and b\nearrow 1{\beta\nearrow 1}. In the former, we show that our solutions u _β converge to a C ^1,1 function which is a solution to an obstacle type problem. When b\nearrow 1{\beta\nearrow 1} we recover the Alt-Caffarelli theory.     

MAXIMUM INDEPENDENT,MINIMALLY REDUNDANT SETS IN SERIES-PARALLEL GRAPHS

Abstract

We introduce a new type of graph-theoretic parameter, namely, “single set, prioritized multi-property” parameters. The example described here uses independence as the priority property and redundance as the secondary property, and we consider the problem of minimizing (total) redundance for a maximum independent set S. We show that we have an Np-hard problem but that there exists a linear time algorithm to find such a set S in a series-parallel graph.     

Two Dimensional Incompressible Ideal Flow Around a Small Obstacle

Abstract

In this article we study the asymptotic behavior of incompressible, ideal, time-dependent two dimensional flow in the exterior of a single smooth obstacle when the size of the obstacle becomes very small. Our main purpose is to identify the equation satisfied by the limit flow. We will see that the asymptotic behavior depends on γ, the circulation around the obstacle. For smooth flow around a single obstacle, γ is a conserved quantity which is determined by the initial data. We will show that if γ = 0, the limit flow satisfies the standard incompressible Euler equations in the full plane but, if γ≠ 0, the limit equation acquires an additional forcing term. We treat this problem by first constructing a sequence of approximate solutions to the incompressible 2D Euler equation in the full plane from the exact solutions obtained when solving the equation on the exterior of each obstacle and then passing to the limit on the weak formulation of the equation. We use an explicit treatment of the Green's function of the exterior domain based on conformal maps, a priori estimates obtained by carefully examining the limiting process and the Div-Curl Lemma, together with a standard weak convergence treatment of the nonlinearity for the passage to the limit.     

Comparing two methods of resolving homogeneous differential inclusions

Given a compact set we consider the differential inclusion We show how to use the main idea of the method of convex integration [ N], [G], [K] (to control convergence of the gradients of a sequence of approximate solutions by appropriate selection of the sequence) to obtain an optimal existence result. We compare this result with the ones available by the Baire category approach applied to the set of admissible functions with topology. A byproduct of our result is attainment in the minimization problems with integrands L having quasiaffine quasiconvexification that was, in fact, the reason of our interest to differential inclusions. This result can be considered as a first step towards characterization of those minimization problems which are solvable for all boundary data. This problem was solved in [S1] in the scalar case m=1. Received November 5, 1998 / Accepted July 17, 2000 / Published online December 8, 2000     

The Moment Problem Associated with the q -Laguerre Polynomials

   Abstract. We consider the indeterminate Stieltjes moment problem associated with the q -Laguerre polynomials. A transformation of the set of solutions, which has all the classical solutions as fixed points, is established and we present a method to construct, for instance, continuous singular solutions. The connection with the moment problem associated with the Stieltjes—Wigert polynomials is studied; we show how to come from q -Laguerre solutions to Stieltjes—Wigert solutions by letting the parameter α —> ∞ , and we explain how to lift a Stieltjes—Wigert solution to a q -Laguerre solution at the level of Pick functions. Based on two generating functions, expressions for the four entire functions from the Nevanlinna parametrization are obtained.     

Internal gravity–capillary solitary waves in finite depth

We consider a two‐dimensional inviscid irrotational flow in a two layer fluid under the effects of gravity and interfacial tension. The upper fluid is bounded above by a rigid lid, and the lower fluid is bounded below by a rigid bottom. We use a spatial dynamics approach and formulate the steady Euler equations as a Hamiltonian system, where we consider the unbounded horizontal coordinate x as a time‐like coordinate. The linearization of the Hamiltonian system is studied, and bifurcation curves in the (β,α)‐plane are obtained, where α and β are two parameters. The curves depend on two additional parameters ρ and h, where ρ is the ratio of the densities and h is the ratio of the fluid depths. However, the bifurcation diagram is found to be qualitatively the same as for surface waves. In particular, we find that a Hamiltonian‐Hopf bifurcation, Hamiltonian real 1:1 resonance, and a Hamiltonian 0²‐resonance occur for certain values of (β,α). Of particular interest are solitary wave solutions of the Euler equations. Such solutions correspond to homoclinic solutions of the Hamiltonian system. We investigate the parameter regimes where the Hamiltonian‐Hopf bifurcation and the Hamiltonian real 1:1 resonance occur. In both these cases, we perform a center manifold reduction of the Hamiltonian system and show that homoclinic solutions of the reduced system exist. In contrast to the case of surface waves, we find parameter values ρ and h for which the leading order nonlinear term in the reduced system vanishes. We make a detailed analysis of this phenomenon in the case of the real 1:1 resonance. We also briefly consider the Hamiltonian 0²‐resonance and recover the results found by Kirrmann. Copyright © 2016 John Wiley & Sons, Ltd.     

Global Ill‐Posedness of the Isentropic System of Gas Dynamics

We consider the isentropic compressible Euler system in 2 space dimensions with pressure law p (ρ) = ρ² and we show the existence of classical Riemann data, i.e. pure jump discontinuities across a line, for which there are infinitely many admissible bounded weak solutions (bounded away from the void). We also show that some of these Riemann data are generated by a 1‐dimensional compression wave: our theorem leads therefore to Lipschitz initial data for which there are infinitely many global bounded admissible weak solutions. © 2015 Wiley Periodicals, Inc.     

Second Order Nonlinear Evolution Inclusions Ⅱ： Structure of the Solution Set

We contimle the work initiated in [1] （Second order nonlinear evolution inclusions I： Existence and relaxation results. Acta Mathematics Science, English Series, 21（5）, 977-996 （2005）） and study the structural properties of the solution set of second order evolution inclusions which are defined in the analytic framework of the evolution triple. For the convex problem we show that the solution set is compact Rs, while for the nonconvex problem we show that it is path connected, Also we show that the solution set is closed only if the multivalued nonlinearity is convex valued. Finally we illustrate the results by considering a nonlinear hyperbolic problem with discontinuities.     

A fast heuristic algorithm for the maximum concurrent <Emphasis Type="Italic">k</Emphasis>-splittable flow problem

In this paper, we propose a fast heuristic algorithm for the maximum concurrent k-splittable flow problem. In such an optimization problem, one is concerned with maximizing the routable demand fraction across a capacitated network, given a set of commodities and a constant k expressing the number of paths that can be used at most to route flows for each commodity. Starting from known results on the k-splittable flow problem, we design an algorithm based on a multistart randomized scheme which exploits an adapted extension of the augmenting path algorithm to produce starting solutions for our problem, which are then enhanced by means of an iterative improvement routine. The proposed algorithm has been tested on several sets of instances, and the results of an extensive experimental analysis are provided in association with a comparison to the results obtained by a different heuristic approach and an exact algorithm based on branch and bound rules.     

On Weak Solutions to Stochastic Differential Inclusions Driven by Semimartingales

Abstract

In this paper we consider weak solutions to stochastic inclusions driven by a general semimartingale. We prove the existence of weak solutions and equivalence with the existence of solutions to the martingale problem formulated to such inclusion. Using this we then analyze compactness property of solutions set. Presenting results extend some of those being known for stochastic differential inclusions of Itô's type.     

Constant mean curvature surfaces of annular type

We consider large solutions of annular type to the volume constrained Douglas problem. They are conformally immersed H-surfaces. By rescaling we set the volume functional at one while the boundary curves shrink to the origin. We show that the solutions become spherical in a precise manner. Spherical bubbling may fail if the conformality condition is dropped. We also discuss the rotationally symmetric annular solutions to the H-surface equation and consider some illustrative examples. Received: 2 May 2000 / Accepted: 23 January 2001 / Published online: 4 May 2001     

Computability in structures representing a Scott set

Continuing work begun in [10], we utilize a notion of forcing for which the generic objects are structures and which allows us to determine whether these “generic” structures compute certain sets and enumerations. The forcing conditions are bounded complexity types which are consistent with a given theory and are elements of a given Scott set. These generic structures will “represent” this given Scott set, in the sense that the structure has a certain weak saturation property with respect to bounded complexity types in the Scott set. For example, if ? is a nonstandard model of PA, then ? represents the Scott set ? = n∈ω | ?⊧“the nth prime divides a” | a∈?. The notion of forcing yields two main results. The first characterizes the sets of natural numbers computable in all models of a given theory representing a given Scott set. We show that the characteristic function of such a set must be enumeration reducible to a complete existential type which is consistent with the given theory and is an element of the given Scott set. The second provides a sufficient condition for the existence of a structure ? such that ? represents a countable jump ideal and ? does not compute an enumeration of a given family of sets ?. This second result is of particular interest when the family of sets which cannot be enumerated is ? = Rep[Th(?)]. Under this additional assumption, the second result generalizes a result on TA [6] and on certain other completions of PA [10]. For example, we show that there also exist models of completions of ZF from which one cannot enumerate the family of sets represented by the theory. Received: 8 October 1997 / Published online: 25 January 2001     

Energy criterion of global existence for energy-critical Schrödinger equations with subcritical perturbations

We present a variational approach to study the energy-critical Schrödinger equations with subcritical perturbations. Through analysing the Hamiltonian property we establish two types of invariant evolution flows, and derive a new sharp energy criterion for blowup of solutions for the equation. Furthermore, we answer the question: how small are the initial data such that the solutions of this equation are bounded in H ¹(R ^N )?     

Computing a Minimum Weight Triangulation of a Sparse Point Set*

Investigating the minimum weight triangulation of a point set with constraint is an important approach for seeking the ultimate solution of the minimum weight triangulation problem. In this paper, we consider the minimum weight triangulation of a sparse point set, and present an O(n ⁴) algorithm to compute a triangulation of such a set. The property of sparse point set can be converted into a new sufficient condition for finding subgraphs of the minimum weight triangulation. A special point set is exhibited to show that our new subgraph of minimum weight triangulation cannot be found by any currently known methods.     

Constructing convex solutions via Perron’s method

Abstract In this paper we construct convex solutions for certain elliptic boundary value problems via Perron’s method. The solutions constructed are weak solutions in the viscosity sense, and our construction follows work of Ishii (Duke Math. J., 55 (2) 369–384, 1987). The same general approach appears in work of Andrews and Feldman (J. Differential Equations, 182 (2) 298–343, 2002) in which they show existence for a weak nonlocal parabolic flow of convex curves. The time independent special case of their work leads to a one dimensional elliptic result which we extend to two dimensions. Similar results are required to extend their theory of nonlocal geometric flows to surfaces. The two dimensional case is essentially different from the one dimensional case and involves a regularity result (cf. Theorem 3.1), which has independent interest. Roughly speaking, given an arbitrary convex function (which is not smooth) supported at one point by a smooth function of prescribed Hessian (which is not convex), one must construct a third function that is both convex and smooth and appropriately approximates both of the given functions. Keywords: Viscosity solutions, Elliptic partial differential equations, Perron procedure, Convexity, Regularity, Fully nonlinear, Monge-Ampere Mathematics Subject Classification (2000:) 35J60, 53A05, 52A15, 26B05     

The steady states and convergence to equilibria for a 1‐D chemotaxis model with volume‐filling effect

We consider a chemotaxis model with volume‐filling effect introduced by Hillen and Painter. They also proved the existence of global solutions for a compact Riemannian manifold without boundary. Moreover, the existence of a global attractor in W^{1, p}(Ω??ⁿ), p>n, p?2, was proved by Wrzosek. He also proved that the ω‐limit set consists of regular stationary solutions. In this paper, we prove that the 1‐D stationary problem has at most an infinitely countable number of regular solutions. Furthermore, we show that as t→∞ the solution of the 1‐D evolution problem converges to an equilibrium in W^{1, p}, p?2. Copyright © 2009 John Wiley & Sons, Ltd.     

Investigation of properties of the solutions of hyperbolic stochastic PDEs

In this paper we investigate the compact support property of the solutions of hyperbolic Stochastic PDE (SPDE) providing that initial condition function is deterministic and has compact support property. First, to approach this problem, we consider semi-SPDE. It turns out that in the semi-SPDE case solution u (t, x) preserve compact support property. When we consider SPDE, we use the stochastic differential-difference equations (SDDE) approach. It turns out that in SPDE case solution u (t, x) does not preserve compact support property. So, if we compare the semi-SPDE and SPDE then it becomes obvious that differentiation in space in SPDE plays crucial role and influence the behavior of the solution. (© 2008 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)     

UPPER BOUNDS ON THE LOWER OPEN PACKING NUMBER OF A TREE

Abstract

Let G be a graph and let v be a vertex of G. The open neigbourhood N(v) of v is the set of all vertices adjacent with v in G. An open packing of G is a set of vertices whose open neighbourhoods are pairwise disjoint. The lower open packing number of G, denoted ρ^° _L(G), is the minimum cardinality of a maximal open packing of G while the (upper) open packing number of G, denoted ρ^°(G), is the maximum cardinality among all open packings of G. It is known (see [7]) that if G is a connected graph of order n ≥3, then ρ^°(G) ≤ 2n/3 and this bound is sharp (even for trees). As a consequence of this result, we know that ρ^° _L(G) ≤ 2n/3. In this paper, we improve this bound when G is a tree. We show that if G is a tree of order n with radius 3, then ρ^° _L(G) ≤ n/2 + 2 √n-1, and this bound is sharp, while if G is a tree of order n with radius at least 4, then ρ^° _L(G) is bounded above by 2n/3—O√n).