LIOUVILLE RESULTS FOR STABLE SOLUTIONS OF QUASILINEAR EQUATIONS WITH WEIGHTS

This paper is devoted to the quasilinear equation ■where p 2,Ω is a(bounded or unbounded) domain of R~N,w_1,w_2 are nonnegative continuous functions and f is an increasing function. We establish a Liouville type theorem for nontrivial stable solutions of the equation under some mild assumptions on Ω,w_1, w_2 and f, which extends and unifies several results on this topic.     

Clique-cutsets beyond chordal graphs

Truemper configurations (thetas, pyramids, prisms, and wheels) have played an important role in the study of complex hereditary graph classes (eg, the class of perfect graphs and the class of even-hole-free graphs), appearing both as excluded configurations, and as configurations around which graphs can be decomposed. In this paper, we study the structure of graphs that contain (as induced subgraphs) no Truemper configurations other than (possibly) universal wheels and twin wheels. We also study several subclasses of this class. We use our structural results to analyze the complexity of the recognition, maximum weight clique, maximum weight stable set, and optimal vertex coloring problems for these classes. Furthermore, we obtain polynomial -bounding functions for these classes.     

The Obstacle Version of the Geometric Dynamic Programming Principle: Application to the Pricing of American Options Under Constraints

We provide an obstacle version of the Geometric Dynamic Programming Principle of Soner and Touzi (J. Eur. Math. Soc. 4:201–236, 2002) for stochastic target problems. This opens the doors to a wide range of applications, particularly in risk control in finance and insurance, in which a controlled stochastic process has to be maintained in a given set on a time interval [0,T]. As an example of application, we show how it can be used to provide a viscosity characterization of the super-hedging cost of American options under portfolio constraints, without appealing to the standard dual formulation from mathematical finance. In particular, we allow for a degenerate volatility, a case which does not seem to have been studied so far in this context.     

Uniform Regularity in a Wedge and Regularity of Traces of CR Functions

We discuss in Sect. 1 the property of regularity at the boundary of separately holomorphic functions along families of discs and apply, in Sect. 2, to two situations. First, let W\mathcal{W} be a wedge of ℂ ⁿ with C ^ω , generic edge ℰ: a holomorphic function f on W\mathcal{W} has always a generalized (hyperfunction) boundary value bv(f) on ℰ, and this coincides with the collection of the boundary values along the discs which have C ^ω transversal intersection with ℰ. Thus Sect. 1 can be applied and yields the uniform continuity at ℰ of f when bv(f) is (separately) continuous. When W\mathcal{W} is only smooth, an additional property, the temperateness of f at ℰ, characterizes the existence of boundary value bv(f) as a distribution on ℰ. If bv(f) is continuous, this operation is consistent with taking limits along discs (Theorem 2.8). By Sect. 1, this yields again the uniform continuity at ℰ of tempered holomorphic functions with continuous bv. This is the theorem by Rosay (Trans. Am. Math. Soc. 297(1):63–72, 1986), in whose original proof the method of “slicing” by discs is not used.     

An Initial-Boundary Value Problem for the Korteweg–de Vries Equation with Dominant Surface Tension

We consider the initial-boundary value problem (IBVP) for the Korteweg–de Vries equation with zero boundary conditions at x=0 and arbitrary smooth decreasing initial data. We prove that the solution of this IBVP can be found by solving two linear inverse scattering problems (SPs) on two different spectral planes. The first SP is associated with the KdV equation. The second SP is self-conjugate and its scattering function is found in terms of entries of the scattering matrix s(k) for the first SP. Knowing the scattering function, we solve the second inverse SP for finding the potential self-conjugate matrix. Consequently, the unknown object entering coefficients in the system of evolution equations for s(k,t) is found. Then, the time-dependent scattering matrix s(k,t) is expressed in terms of s(k)=s(k,0) and of solutions of the self-conjugate SP. Knowing s(k,t), we find the solution of the IBVP in terms of the solution of the Gelfand–Levitan–Marchenko equation in the first inverse SP.     

A discrete convolution involving Fourier sine and cosine series and its applications

ABSTRACT

In this paper, we introduce a discrete convolution involving both the Fourier sine and cosine series. We study Young's type inequality and a discrete transform related to this convolution and solve in closed form a class of discrete Toeplitz plus Hankel equations.     

A simple spectral theory of polynomially bounded solutions and applications to differential equations

Semigroup Forum - In this paper we present a simple spectral theory of polynomially bounded functions on the half line, and then apply it to study the asymptotic behavior of solutions of fractional...     

Identifying defective sets using queries of small size

We examine the following version of a classic combinatorial search problem introduced by Rényi: Given a finite set $X$ of $n$ elements we want to identify an unknown subset $Y$ of $X$, which is known to have exactly $d$ elements, by means of testing, for as few as possible subsets $A$ of $X$, whether $A$ intersects $Y$ or not. We are primarily concerned with the non-adaptive model, where the family of test sets is specified in advance, in the case where each test set is of size at most some given natural number $k$. Our main results are nearly tight bounds on the minimum number of tests necessary when $d$ and $k$ are fixed and $n$ is large enough.     

Primitive symmetric designs with up to 2500 points

By this article we conclude the construction of all primitive ( v, k,λ ) symmetric designs with v < 2500 , up to a few unsolved cases. Complementary to the designs with prime power number of points published previously, here we give 55 primitive symmetric designs with v ≠ p ^m , p prime and m positive integer, together with the analysis of their full automorphism groups. The research involves programming and wide‐range computations. We make use of the software package GAP and the library of primitive groups which it contains. © 2011 Wiley Periodicals, Inc. J Combin Designs 19:463‐474, 2011