English
Related papers

Related papers: Inner and outer smooth approximation of convex hyp…

200 papers

Finite convex geometries are combinatorial structures. It follows from a recent result of M.\ Richter and L.G.\ Rogers that there is an infinite set $T_{rr}$ of planar convex polygons such that $T_{rr}$ with respect to geometric convex…

Combinatorics · Mathematics 2016-08-24 Gábor Czédli , János Kincses

Many problems of theoretical and practical interest involve finding a convex or concave function. For instance, optimization problems such as finding the projection on the convex functions in $H^k(\Omega)$, or some problems in economics. In…

Numerical Analysis · Mathematics 2008-04-11 Néstor Aguilera , Pedro Morin

Let $E$ be a real vector space with dual space $E^*$ and let $C\subset E$ be a convex subset with more than one point. Let $f : C\to\mathbb{R}$ be a function satisfying a mild stability property at 'flat' points of the (relative) boundary…

Optimization and Control · Mathematics 2015-04-21 Khanh Pham Duy , Marc Lassonde

The main result is that, for any projective compact analytic subset A of dimension q>0 in a reduced complex space X, there is a neighborhood U of A such that, for any covering space Z of X in which the lifting B of A has no noncompact…

Complex Variables · Mathematics 2007-05-23 Michael Fraboni , Terrence Napier

Optimizing an implicational base of a closure system consists in turning this implicational base into an equivalent one with premises and conclusions as small as possible. This task is known to be hard in general but tractable for a number…

Combinatorics · Mathematics 2026-03-17 Anthony Meunier , Lhouari Nourine , Simon Vilmin

We show that a Lagrangian inclusion in $\mathbb C^2$ with double transverse self-intersection points and standard open Whitney umbrellas is rationally convex. As an application we show that any compact surface $S$, except $S^2$ and $\mathbb…

Complex Variables · Mathematics 2016-11-17 Rasul Shafikov , Alexandre Sukhov

By an influential theorem of Boman, a function $f$ on an open set $U$ in $\mathbb R^d$ is smooth ($\mathcal C^\infty$) if and only if it is arc-smooth, i.e., $f\circ c$ is smooth for every smooth curve $c : \mathbb R \to U$. In this paper…

Classical Analysis and ODEs · Mathematics 2019-03-27 Armin Rainer

Best approximation (BA) is an interesting field in functional analysis that has attracted a lot of attention from many researchers for a very long period of time up-to-date. Of greatest consideration is the characterization of the Chebyshev…

Functional Analysis · Mathematics 2023-02-07 Samson Owiti , Benard Okelo , Julia Owino

Let $\Delta_m$ be the standard $m$-dimensional simplex of non-negative $m+1$ tuples that sum to unity and let $S$ be a nonempty subset of $\Delta_m$. A real valued function $h$ defined on a convex subset of a real vector space is $S$-almost…

Functional Analysis · Mathematics 2007-05-23 S. J. Dilworth , Ralph Howard , James W. Roberts

We prove that in Euclidean space $R^{n+1}$ any compact immersed nonnegatively curved hypersurface $M$ with free boundary on the sphere $S^n$ is an embedded convex topological disk. In particular, when the $m^{th}$ mean curvature of $M$ is…

Differential Geometry · Mathematics 2019-04-02 Mohammad Ghomi , Changwei Xiong

We prove that every continuous mapping from a separable infinite-dimensional Hilbert space $X$ into $\mathbb{R}^{m}$ can be uniformly approximated by $C^\infty$ smooth mappings {\em with no critical points}. This kind of result can be…

Differential Geometry · Mathematics 2007-05-23 Daniel Azagra , Manuel Cepedello Boiso

We prove that every smooth CR manifold $M\subset\subset \C^n$, of hypersurface type, has a complex strip-manifold extension in $\C^n$. If $M$ is, in addition, pseudoconvex-oriented, it is the "exterior" boundary of the strip. In turn, the…

Complex Variables · Mathematics 2012-11-06 Luca Baracco

Many problems of theoretical and practical interest involve finding an optimum over a family of convex functions. For instance, finding the projection on the convex functions in $H^k(\Omega)$, and optimizing functionals arising from some…

Numerical Analysis · Mathematics 2008-04-11 Néstor E. Aguilera , Pedro Morin

In the densest subgraph problem, given an edge-weighted undirected graph $G=(V,E,w)$, we are asked to find $S\subseteq V$ that maximizes the density, i.e., $w(S)/|S|$, where $w(S)$ is the sum of weights of the edges in the subgraph induced…

Data Structures and Algorithms · Computer Science 2021-10-27 Yasushi Kawase , Atsushi Miyauchi

This article shows the existence of a class of closed bounded matrix convex sets which do not have absolute extreme points. The sets we consider are noncommutative sets, $K_X$, formed by taking matrix convex combinations of a single tuple…

Operator Algebras · Mathematics 2022-02-24 Eric Evert

For a positive integer $n$, a graph with at least $n$ vertices is $n$-existentially closed or simply $n$-e.c. if for any set of vertices $S$ of size $n$ and any set $T\subseteq S$, there is a vertex $x\not\in S$ adjacent to each vertex of…

Combinatorics · Mathematics 2024-07-09 Andrea C. Burgess , Robert D. Luther , David A. Pike

We prove a version of the strong half-space theorem between the classes of recurrent minimal surfaces and complete minimal surfaces with bounded curvature of $\mathbb{R}^{3}_{\raisepunct{.}}$ We also show that any minimal hypersurface…

Differential Geometry · Mathematics 2021-04-06 G. Pacelli Bessa , Luquesio P. Jorge , Leandro Pessoa

Given a collection S of subsets of some set U, and M a subset of U, the set cover problem is to find the smallest subcollection C of S such that M is a subset of the union of the sets in C. While the general problem is NP-hard to solve,…

Computational Geometry · Computer Science 2007-05-23 Kenneth L. Clarkson , Kasturi Varadarajan

We find conditions for a smooth nonlinear map $f:U\rightarrow V$ between open subsets of Hilbert or Banach spaces to be locally convex in the sense that for some $c$ and each positive $\varepsilon<c$ the image $% f(B_\varepsilon(x))$ of…

Functional Analysis · Mathematics 2012-05-16 Iryna Banakh , Taras Banakh , Anatolij Plichko , Anatoliy Prykarpatsky

Any solid object can be decomposed into a collection of convex polytopes (in short, convexes). When a small number of convexes are used, such a decomposition can be thought of as a piece-wise approximation of the geometry. This…

Computer Vision and Pattern Recognition · Computer Science 2020-04-14 Boyang Deng , Kyle Genova , Soroosh Yazdani , Sofien Bouaziz , Geoffrey Hinton , Andrea Tagliasacchi