The hp-adaptive FEM based on continuous Sobolev embeddings: isotropic refinements

The aim of this paper is to present a new class of smoothness testing strategies in the context of hp-adaptive refinements based on continuous Sobolev embeddings. In addition to deriving a modified form of the 1d smoothness indicators introduced in [26], they will be extended and applied to a higher dimensional framework. A few numerical experiments in the context of the hp-adaptive FEM for a linear elliptic PDE will be performed.

Approximate controllability for the semilinear heat equation in RN involving gradient terms

We prove the approximate controllability of the semilinear heat equation in R^N, when the nonlinear term is globally Lipschitz and depends both on the state u and its spatial gradient Ñu. The approximate controllability is viewed as the limit of a sequence of optimal control problems. In order to avoid the difficulties related to the lack of compactness of the Sobolev embeddings, we work with the similarity variables and use weighted Sobolev spaces.

Existence of solutions for p(x)-Laplacian problems on a bounded domain

In this paper we study the following p(x)-Laplacian problem: -div(a(x)&VERBAR;&DEL; u&VERBAR;(p(x)-2)&DEL; u)+b(x)&VERBAR; u&VERBAR;(p(x)-2)u = f(x, u), x ε &UOmega;, u = 0, on &PARTIAL; &UOmega;, where 1< p(1) &LE; p(x) &LE; p(2) < n, &UOmega; &SUB; R-n is a bounded domain and applying the mountain pass theorem we obtain the existence of solutions in W-0(1,p(x)) for the p(x)-Laplacian problems in the superlinear and sublinear cases. © 2004 Elsevier Inc. All rights reserved.

An algorithmic Friedman-Pippenger theorem on tree embeddings and applications

An (n, d)-expander is a graph G = (V, E) such that for every X subset of V with vertical bar X vertical bar <= 2n - 2 we have vertical bar Gamma(G)(X) vertical bar >= (d + 1) vertical bar X vertical bar. A tree T is small if it has at most n vertices and has maximum degree at most d. Friedman and Pippenger (1987) proved that any ( n; d)- expander contains every small tree. However, their elegant proof does not seem to yield an efficient algorithm for obtaining the tree. In this paper, we give an alternative result that does admit a polynomial time algorithm for finding the immersion of any small tree in subgraphs G of (N, D, lambda)-graphs Lambda, as long as G contains a positive fraction of the edges of Lambda and lambda/D is small enough. In several applications of the Friedman-Pippenger theorem, including the ones in the original paper of those authors, the (n, d)-expander G is a subgraph of an (N, D, lambda)-graph as above. Therefore, our result suffices to provide efficient algorithms for such previously non-constructive applications. As an example, we discuss a recent result of Alon, Krivelevich, and Sudakov (2007) concerning embedding nearly spanning bounded degree trees, the proof of which makes use of the Friedman-Pippenger theorem. We shall also show a construction inspired on Wigderson-Zuckerman expander graphs for which any sufficiently dense subgraph contains all trees of sizes and maximum degrees achieving essentially optimal parameters. Our algorithmic approach is based on a reduction of the tree embedding problem to a certain on-line matching problem for bipartite graphs, solved by Aggarwal et al. (1996).

On a semilinear Schrodinger equation with critical Sobolev exponent

We consider the semilinear Schrodinger equation -Deltau+V(x)u= K(x) \u \ (2*-2 u) + g(x; u), u is an element of W-1,W-2 (R-N), where N greater than or equal to4, V, K, g are periodic in x(j) for 1 less than or equal toj less than or equal toN, K>0, g is of subcritical growth and 0 is in a gap of the spectrum of -Delta +V. We show that under suitable hypotheses this equation has a solution u not equal 0. In particular, such a solution exists if K equivalent to 1 and g equivalent to 0.

Embeddings of m-cycle systems and incomplete m-cycle systems: m<=14

In this paper we completely settle the embedding problem for m-cycle systems with m less than or equal to 14. We also solve the more general problem of finding m-cycle systems of K-v - K-u when m is an element of {4,6,7,8,10,12,14}.

A conjecture on small embeddings of partial Steiner triple systems

A well-known, and unresolved, conjecture states that every partial Steiner triple system of order u can be embedded in a Steiner triple system of order v for all v equivalent to 1 or 3 (mod 6), v greater than or equal to 2u + 1. However, some partial Steiner triple systems of order u can be embedded in Steiner triple systems of order v < 2u + 1. A more general conjecture that considers these small embeddings is presented and verified for some cases. (C) 2002 Wiley Periodicals, Inc.