The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying similar documents to “Sets Expressible as Unions of Staircase $n$-Convex Polygons”

The Young inequality and the Δ₂-condition

Philippe Laurençot (2002)

Colloquium Mathematicae

Similarity:

If φ: [0,∞) → [0,∞) is a convex function with φ(0) = 0 and conjugate function φ*, the inequality x y ≤ ε φ ( x ) + C ε φ * ( y ) is shown to hold true for every ε ∈ (0,∞) if and only if φ* satisfies the Δ₂-condition.

Convex integration with constraints and applications to phase transitions and partial differential equations

Stefan Müller, Vladimír Šverák (1999)

Journal of the European Mathematical Society

Similarity:

We study solutions of first order partial differential relations D u ∈ K , where u : Ω ⊂ ℝ n → ℝ m is a Lipschitz map and K is a bounded set in m × n matrices, and extend Gromov’s theory of convex integration in two ways. First, we allow for additional constraints on the minors of D u and second we replace Gromov’s P −convex hull by the (functional) rank-one convex hull. The latter can be much larger than the former and this has important consequences for the existence of ‘wild’ solutions to elliptic systems. Our...

Minimal multi-convex projections

Grzegorz Lewicki, Michael Prophet (2007)

Studia Mathematica

Similarity:

We say that a function from X = C L [ 0 , 1 ] is k-convex (for k ≤ L) if its kth derivative is nonnegative. Let P denote a projection from X onto V = Πₙ ⊂ X, where Πₙ denotes the space of algebraic polynomials of degree less than or equal to n. If we want P to leave invariant the cone of k-convex functions (k ≤ n), we find that such a demand is impossible to fulfill for nearly every k. Indeed, only for k = n-1 and k = n does such a projection exist. So let us consider instead a more general “shape”...

Some characterization of locally nonconical convex sets

Witold Seredyński (2004)

Czechoslovak Mathematical Journal

Similarity:

A closed convex set Q in a local convex topological Hausdorff spaces X is called locally nonconical (LNC) if for every x , y ∈ Q there exists an open neighbourhood U of x such that ( U ∩ Q ) + 1 2 ( y - x ) ⊂ Q . A set Q is local cylindric (LC) if for x , y ∈ Q , x ≠ y , z ∈ ( x , y ) there exists an open neighbourhood U of z such that U ∩ Q (equivalently: b d ( Q ) ∩ U ) is a union of open segments parallel to [ x , y ] . In this paper we prove that these two notions are equivalent. The properties LNC and LC were investigated in [3], where the implication L N C ⇒ L C was proved in...

The vertex detour hull number of a graph

A.P. Santhakumaran, S.V. Ullas Chandran (2012)

Discussiones Mathematicae Graph Theory

Similarity:

For vertices x and y in a connected graph G, the detour distance D(x,y) is the length of a longest x - y path in G. An x - y path of length D(x,y) is an x - y detour. The closed detour interval ID[x,y] consists of x,y, and all vertices lying on some x -y detour of G; while for S ⊆ V(G), I D [ S ] = ⋃ x , y ∈ S I D [ x , y ] . A set S of vertices is a detour convex set if I D [ S ] = S . The detour convex hull [ S ] D is the smallest detour convex set containing S. The detour hull number dh(G) is the minimum cardinality among subsets S of...

Graphs with convex domination number close to their order

Joanna Cyman, Magdalena Lemańska, Joanna Raczek (2006)

Discussiones Mathematicae Graph Theory

Similarity:

For a connected graph G = (V,E), a set D ⊆ V(G) is a dominating set of G if every vertex in V(G)-D has at least one neighbour in D. The distance d G ( u , v ) between two vertices u and v is the length of a shortest (u-v) path in G. An (u-v) path of length d G ( u , v ) is called an (u-v)-geodesic. A set X ⊆ V(G) is convex in G if vertices from all (a-b)-geodesics belong to X for any two vertices a,b ∈ X. A set X is a convex dominating set if it is convex and dominating. The convex domination number γ c o n ( G ) of a...

Smoothing a polyhedral convex function via cumulant transformation and homogenization

Alberto Seeger (1997)

Annales Polonici Mathematici

Similarity:

Given a polyhedral convex function g: ℝⁿ → ℝ ∪ +∞, it is always possible to construct a family g ₜ t > 0 which converges pointwise to g and such that each gₜ: ℝⁿ → ℝ is convex and infinitely often differentiable. The construction of such a family g ₜ t > 0 involves the concept of cumulant transformation and a standard homogenization procedure.

Generalized characterization of the convex envelope of a function

Fethi Kadhi (2002)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

We investigate the minima of functionals of the form ∫ [ a , b ] g ( u ˙ ( s ) ) d s where g is strictly convex. The admissible functions u : [ a , b ] → ℝ are not necessarily convex and satisfy u ≤ f on [ a , b ] , u ( a ) = f ( a ) , u ( b ) = f ( b ) , f is a fixed function on [ a , b ] . We show that the minimum is attained by f ¯ , the convex envelope of f .

The Spaces of Closed Convex Sets in Euclidean Spaces with the Fell Topology

Katsuro Sakai, Zhongqiang Yang (2007)

Bulletin of the Polish Academy of Sciences. Mathematics

Similarity:

Let C o n v F ( ℝ ⁿ ) be the space of all non-empty closed convex sets in Euclidean space ℝ ⁿ endowed with the Fell topology. We prove that C o n v F ( ℝ ⁿ ) ≈ ℝ ⁿ × Q for every n > 1 whereas C o n v F ( ℝ ) ≈ ℝ × .

Poincaré Inequalities and Moment Maps

Bo’az Klartag (2013)

Annales de la faculté des sciences de Toulouse Mathématiques

Similarity:

We discuss a method for obtaining Poincaré-type inequalities on arbitrary convex bodies in ℝ n . Our technique involves a dual version of Bochner’s formula and a certain moment map, and it also applies to some non-convex sets. In particular, we generalize the central limit theorem for convex bodies to a class of non-convex domains, including the unit balls of ℓ p -spaces in ℝ n for 0 < p < 1 .