Search results for "Regular"
showing 10 items of 855 documents
Regularity of renormalized solutions to nonlinear elliptic equations away from the support of measure data
2018
We prove boundedness and continuity for solutions to the Dirichlet problem for the equation $$ - {\rm{div}}(a(x,\nabla u)) = h(x,u) + \mu ,\;\;\;\;\;{\rm{in}}\;{\rm{\Omega }} \subset \mathbb{R}^{N},$$ where the left-hand side is a Leray-Lions operator from $$- {W}^{1,p}_0(\Omega)$$ into W−1,p′(Ω) with 1 < p < N, h(x,s) is a Caratheodory function which grows like ∣s∣p−1 and μ is a finite Radon measure. We prove that renormalized solutions, though not globally bounded, are Holder-continuous far from the support of μ.
Shape optimization for monge-ampére equations via domain derivative
2011
In this note we prove that, if $\Omega$ is a smooth, strictly convex, open set in $R^n$ $(n \ge 2)$ with given measure, the $L^1$ norm of the convex solution to the Dirichlet problem $\det D^2 u=1$ in $\Omega$, $u=0$ on $\partial\Omega$, is minimum whenever $\Omega$ is an ellipsoid.
Radial solutions of Dirichlet problems with concave-convex nonlinearities
2011
Abstract We prove the existence of a double infinite sequence of radial solutions for a Dirichlet concave–convex problem associated with an elliptic equation in a ball of R n . We are interested in relaxing the classical positivity condition on the weights, by allowing the weights to vanish. The idea is to develop a topological method and to use the concept of rotation number. The solutions are characterized by their nodal properties.
Multiple solutions with sign information for a (p,2)-equation with combined nonlinearities
2020
Abstract We consider a parametric nonlinear Dirichlet problem driven by the sum of a p -Laplacian and of a Laplacian (a ( p , 2 ) -equation) and with a reaction which has the competing effects of two distinct nonlinearities. A parametric term which is ( p − 1 ) -superlinear (convex term) and a perturbation which is ( p − 1 ) -sublinear (concave term). First we show that for all small values of the parameter the problem has at least five nontrivial smooth solutions, all with sign information. Then by strengthening the regularity of the two nonlinearities we produce two more nodal solutions, for a total of seven nontrivial smooth solutions all with sign informations. Our proofs use critical p…
On Noncoercive (p, q)-Equations
2021
We consider a nonlinear Dirichlet problem driven by a (p, q)-Laplace differential operator (1 < q < p). The reaction is (p - 1)-linear near +/-infinity and the problem is noncoercive. Using variational tools and truncation and comparison techniques together with critical groups, we produce five nontrivial smooth solutions all with sign information and ordered. In the particular case when q = 2, we produce a second nodal solution for a total of six nontrivial smooth solutions all with sign information.
Longest Motifs with a Functionally Equivalent Central Block
2004
International audience; This paper presents a generalization of the notion of longest repeats with a block of k don't care symbols introduced by [Crochemore et al., LATIN 2004] (for k fixed) to longest motifs composed of three parts: a first and last that parameterize match (that is, match via some symbol renaming, initially unknown), and a functionally equivalent central block. Such three-part motifs are called longest block motifs. Different types of functional equivalence, and thus of matching criteria for the central block are considered, which include as a subcase the one treated in [Crochemore et al., LATIN 2004] and extend to the case of regular expressions with no Kleene closure or …
On the Shuffle of Star-Free Languages
2012
Motivated by the general problem to characterize families of languages closed under shuffle, we investigate some conditions under which the shuffle of two star-free languages is star-free. Some of the special cases here approached give rise to new problems in combinatorics on words.
A smallest irregular oriented graph containing a given diregular one
2004
AbstractA digraph is called irregular if its vertices have mutually distinct ordered pairs of semi-degrees. Let D be any diregular oriented graph (without loops or 2-dicycles). A smallest irregular oriented graph F, F=F(D), is constructed such that F includes D as an induced subdigraph, the smallest digraph being one with smallest possible order and with smallest possible size. If the digraph D is arcless then V(D) is an independent set of F(D) comprising almost all vertices of F(D) as |V(D)|→∞. The number of irregular oriented graphs is proved to be superexponential in their order. We could not show that almost all oriented graphs are/are not irregular.
An Efficient Algorithm for the Generation of Z-Convex Polyominoes
2014
We present a characterization of Z-convex polyominoes in terms of pairs of suitable integer vectors. This lets us design an algorithm which generates all Z-convex polyominoes of size n in constant amortized time.
Partially Square Graphs, Hamiltonicity and Circumference II
2000
Abstract Given a graph G, its partially square graph G∗ is a graph obtained by adding an edge uv for each pair u, v of vertices of G at distance 2 whenever the vertices u and v have a common neighbor x satisfying the condition NG(x) ⊆ NG[u] ∪ NG[v], where NG[x]= NG(x) ∪ {x}. In case G is a claw-free graph, G∗ is equal to G2, We define σ ∗ t = min{ ∑ x∈ d ∗ G (x): S is an independent set in G ∗ and ∣S∣ = t} , where d ∗ G (x) = ∣{y ∈ V∣ xy ∈ E(G∗)}∣ . We give for hamiltonicity and circumference new sufficient conditions depending on and we improve some known results.