English
Related papers

Related papers: p-convexity, p-plurisubharmonicity and the Levi pr…

200 papers

Equivalent conditions that make the normal cone maximal monotone are investigated in the general settings of locally convex spaces. Some consequences such as Bishop Phelps and sum representability results are presented in the last part.

Functional Analysis · Mathematics 2019-01-24 M. D. Voisei

The thesis concentrates on two problems in discrete geometry, whose solutions are obtained by analytic, probabilistic and combinatoric tools. The first chapter deals with the strong polarization problem. This states that for any sequence…

Metric Geometry · Mathematics 2019-07-12 Gergely Ambrus

The set of controllers stabilizing a linear system is generally non-convex in the parameter space. In the case of two-parameter controller design (e.g. PI control or static output feedback with one input and two outputs), we observe however…

Optimization and Control · Mathematics 2008-01-17 Didier Henrion , Michael Sebek

Let $P$ be a planar set of $n$ points in general position. We consider the problem of computing an orientation of the plane for which the Rectilinear Convex Hull of $P$ has minimum area. Bae et al. (Computational Geometry: Theory and…

Computational Geometry · Computer Science 2017-12-29 Carlos Alegría-Galicia , Tzolkin Garduño , Carlos Seara , Areli Rosas-Navarrete , Jorge Urrutia

At a first glance, the problem of illuminating the boundary of a convex body by external light sources and the problem of covering a convex body by its smaller positive homothetic copies appear to be quite different. They are in fact two…

Metric Geometry · Mathematics 2018-11-06 Karoly Bezdek , Muhammad A. Khan

In this paper we discuss a couple of observations related to polynomial convexity. More precisely, (i) We observe that the union of finitely many disjoint closed balls with centres in $\cup_{\theta\in[0,\pi/2]}e^{i\theta}V$ is polynomially…

Complex Variables · Mathematics 2019-09-11 Sushil Gorai

Given a polynomial $x \in {\mathbb R}^n \mapsto p(x)$ in $n=2$ variables, a symbolic-numerical algorithm is first described for detecting whether the connected component of the plane sublevel set ${\mathcal P} = \{x : p(x) \geq 0\}$…

Optimization and Control · Mathematics 2008-01-24 Didier Henrion

Let U be a pseudoconvex open set in a complex manifold M. When is U a Stein manifold? There are classical counter examples due to Grauert, even when U has real-analytic boundary or has strictly pseudoconvex points. We give new criteria for…

Complex Variables · Mathematics 2017-10-17 Nessim Sibony

We provide monotonicity formulas for solutions to the p-Laplace equation defined in the exterior of a convex domain. A number of analytic and geometric consequences are derived, including the classical Minkowski inequality as well as new…

Analysis of PDEs · Mathematics 2018-03-30 Mattia Fogagnolo , Lorenzo Mazzieri , Andrea Pinamonti

The convex rope problem is to find a counterclockwise or clockwise convex rope starting at the vertex a and ending at the vertex b of a simple polygon P, where a is a vertex of the convex hull of P and b is visible from infinity. The convex…

Optimization and Control · Mathematics 2023-05-22 Le Hong Trang , Nguyen Thi Le , Phan Thanh An

A planar point set is in convex position precisely when it has a convex polygonization, that is, a polygonization with maximum interior angle measure at most \pi. We can thus talk about the convexity of a set of points in terms of the…

Computational Geometry · Computer Science 2014-09-16 Danny Rorabaugh

Consider a polyhedral convex cone which is given by a finite number of linear inequalities. We investigate the problem to project this cone into a subspace and show that this problem is closely related to linear vector optimization: We…

Optimization and Control · Mathematics 2014-06-09 Andreas Löhne

We examine the metrics that arise when a finite set of points is embedded in the real line, in such a way that the distance between each pair of points is at least 1. These metrics are closely related to some other known metrics in the…

Combinatorics · Mathematics 2011-08-02 Adam N. Letchford , Hanna Seitz , Dirk Oliver Theis

It is known that we can always 3-triangulate (i.e. divide into tetrahedra) convex polyhedra but not always non-convex ones. Polyhedra topologically equivalent to sphere with $p$ handles, shortly $p$-toroids, could not be convex. So, it is…

Metric Geometry · Mathematics 2019-02-08 Milica Stojanović

This is a survey on algorithmic questions about combinatorial and geometric properties of convex polytopes. We give a list of 35 problems; for each the current state of knowledege on its theoretical complexity status is reported. The…

Combinatorics · Mathematics 2007-05-23 Volker Kaibel , Marc E. Pfetsch

We introduce a notion of p-dimensional cones made of $p$-dimensional subspaces and gauges on these cones, giving rise to a contraction principle which generalizes the one for Birkhoff cones. Using tools on the grassmannian and the exterior…

Dynamical Systems · Mathematics 2017-12-05 Maxence Novel

For the $p$-harmonic function with strictly convex level sets, we find a test function which comes from the combination of the norm of gradient of the $p$-harmonic function and the smallest principal curvature of the level sets of…

Analysis of PDEs · Mathematics 2012-11-06 Kun Huang , Wei Zhang

Reducing the NP-problems to the convex/linear analysis on the Birkhoff polytope.

Discrete Mathematics · Computer Science 2007-11-04 Sergey Gubin

A surface M is called p-minimal if one of the coordinate functions is p-harmonic in the inner metric. We show that in the twodimensional case the Gaussian map of such surfaces is quasiconformal. In the case when the surface is a tube we…

Differential Geometry · Mathematics 2018-04-20 Vladimir G. Tkachev

We show that a realization of a closed connected PL-manifold of dimension n-1 in n-dimensional Euclidean space (n>2) is the boundary of a convex polyhedron (finite or infinite) if and only if the interior of each (n-3)-face has a point,…

Computational Geometry · Computer Science 2007-05-23 Konstantin Rybnikov