Sign changing solutions for elliptic equations  with critical 
growth in cylinder type
domains

Pedro Girão; Miguel Ramos

Displaying similar documents to “Sign changing solutions for elliptic equations with critical growth in cylinder type domains”

Weak Linking Theorems and Schrödinger Equations with Critical Sobolev Exponent

Martin Schechter, Wenming Zou (2010)

ESAIM: Control, Optimisation and Calculus of Variations

Similarity:

In this paper we establish a variant and generalized weak linking theorem, which contains more delicate result and insures the existence of bounded Palais–Smale sequences of a strongly indefinite functional. The abstract result will be used to study the semilinear Schrödinger equation $- Δ u + V (x) u = {K (x) | u |}^{2^{*} - 2} u + g (x, u), u \in W^{1, 2} (𝐑^{N})$ , where ≥ 4; are periodic in x for 1 ≤ ≤ and 0 is in a gap of the spectrum of -Δ + ; . If $0 < g (x, u) u \leq {c | u |}^{2^{*}}$ for an appropriate constant , we show that this equation has a nontrivial solution.

Minimax nonparametric hypothesis testing for ellipsoids and Besov bodies

Yuri I. Ingster, Irina A. Suslina (2010)

ESAIM: Probability and Statistics

Similarity:

We observe an infinitely dimensional Gaussian random vector where is a sequence of standard Gaussian variables and is an unknown mean. We consider the hypothesis testing problem alternatives $H_{ε, τ} : v \in V_{ε}$ for the sets $V_{ε} = V_{ε} (τ, ρ_{ε}) \subset l_{2}$ . The sets are -ellipsoids of semi-axes with -ellipsoid of semi-axes removed or similar Besov bodies with Besov bodies removed. Here $τ = (κ, R)$ or $τ = (κ, h, t, R); κ = (p, q, r, s)$ are the parameters which define the sets for given radii , 0 < ; is the asymptotical...

About the decision of reachability for register machines

Véronique Cortier (2010)

RAIRO - Theoretical Informatics and Applications

Similarity:

We study the decidability of the following problem: given affine functions ƒ,...,ƒ over $ℕ^{k}$ and two vectors $v_{1}, v_{2} \in ℕ^{k}$ , is reachable from by successive iterations of ƒ,...,ƒ (in this given order)? We show that this question is decidable for and undecidable for some fixed .

An improved derandomized approximation algorithm for the max-controlled set problem

Carlos Martinhon, Fábio Protti (2011)

RAIRO - Theoretical Informatics and Applications

Similarity:

A vertex of a graph = () is said to be by $M \subseteq V$ if the majority of the elements of the neighborhood of (including itself) belong to . The set is a in if every vertex $i \in V$ is controlled by . Given a set $M \subseteq V$ and two graphs = ( $V, E_{1}$ ) and = ( $V, E_{2}$ ) where $E_{1} \subseteq E_{2}$ , the consists of deciding whether there exists a sandwich graph = () (, a graph where $E_{1} \subseteq E \subseteq E_{2}$ ) such that is a monopoly in = (). If the answer to the is No, we then consider the , whose objective is to find a sandwich...

An improved derandomized approximation algorithm for the max-controlled set problem

Carlos Martinhon, Fábio Protti (2011)

RAIRO - Theoretical Informatics and Applications

Similarity: