English
Related papers

Related papers: Concave cocirculations in a triangular grid

200 papers

In this work, we introduce a new class of non-convex functions, called implicit concave functions, which are compositions of a concave function with a continuously differentiable mapping. We analyze the properties of their minimization by…

Optimization and Control · Mathematics 2025-10-08 Vittorio Latorre

We study the existence of separable infinite harmonic functions in any cone of R N vanishing on its boundary under the form u(r, $\sigma$) = r --$\beta$ $\omega$($\sigma$). We prove that such solutions exist, the spherical part $\omega$…

Analysis of PDEs · Mathematics 2018-01-22 Marie-Françoise Bidaut-Véron , Marta Garcia-Huidobro , Laurent Véron

Given a graph $G$, we define ${\bf bcg}(G)$ as the minimum $k$ for which $G$ can be contracted to the uniformly triangulated grid $\Gamma_{k}$. A graph class ${\cal G}$ has the SQG${\bf C}$ property if every graph $G\in{\cal G}$ has…

Combinatorics · Mathematics 2022-07-21 Julien Baste , Dimitrios M. Thilikos

We give a Riemannian structure to the set $\Sigma$ of positive invertible unitized Hilbert-Schmidt operators, by means of the trace inner product. This metric makes of $\Sigma$ a nonpositively curved, simply connected and metrically…

Differential Geometry · Mathematics 2008-08-20 Gabriel Larotonda

The $W_v$-Path Conjecture due to Klee and Wolfe states that any two vertices of a simple polytope can be joined by a path that does not revisit any facet. This is equivalent to the well-known Hirsch Conjecture. Klee proved that the…

Combinatorics · Mathematics 2018-03-09 Michael D. Plummer , Dong Ye , Xiaoya Zha

In this paper and in its sequel [BKLV], we investigate the cone ${\rm Pseff}_n(C_d)$ of pseudoeffective $n$-cycles in the symmetric product $C_d$ of a smooth curve $C$. In the present paper, we study the convex-geometric properties of the…

Algebraic Geometry · Mathematics 2023-01-18 Francesco Bastianelli , Alexis Kouvidakis , Angelo Felice Lopez , Filippo Viviani

Given any finite set of nonnegative integers, there exists a closed convex set whose facial dimension signature coincides with this set of integers, that is, the dimensions of its nonempty faces comprise exactly this set of integers. In…

Optimization and Control · Mathematics 2024-08-26 Vera Roshchina , Levent Tunçel

Given a polyhedron (planar, $3$-connected graph) $G$, we investigate its common neighbourhood graph con($G$). For cubic ($3$-regular) polyhedra, we show that the planarity of con($G$) depends on the number of odd faces of $G$, and on their…

Combinatorics · Mathematics 2026-05-18 Riccardo W. Maffucci

A Minkowski symmetral of an $\alpha$-concave function is introduced, and some of its fundamental properties are derived. It is shown that for a given $\alpha$-concave function, there exists a sequence of Minkowski symmetrizations that…

Functional Analysis · Mathematics 2025-05-27 Steven Hoehner

For certain families of compact subsets of the plane, the isomorphism class of the algebra of absolutely continuous functions on a set is completely determined by the homeomorphism class of the set. This is analogous to the…

Functional Analysis · Mathematics 2021-05-31 Shaymaa Al-shakarchi , Ian Doust

In this note, as a particular case of a more general result, we obtain the following theorem: Let $\Omega\subseteq {\bf R}^n$ be a non-empty bounded open set and let $f:\overline {\Omega}\to {\bf R}^n$ be a continuous function which is…

Analysis of PDEs · Mathematics 2016-02-17 Biagio Ricceri

We consider the convex optimization problem P: min {f(x): x in K} where "f" is convex continuously differentiable, and K is a compact convex set in Rn with representation {x: g_j(x) >=0, j=1,;;,m} for some continuously differentiable…

Optimization and Control · Mathematics 2014-01-29 Jean-Bernard Lasserre

An effort has been made to show mathematicians some new ideas applied to image analysis. Gray images are presented as tilings. Based on topological properties of the tiling, a number of gray convex hulls: maximal, minimal, and oriented ones…

Computer Vision and Pattern Recognition · Computer Science 2016-08-31 Igor Polkovnikov

Given a compact and H-convex subset $K$ of the Heisenberg group ${\mathbb H}$, with the origin $e$ in its interior, we are interested in finding a homogeneous H-convex function $f$ such that $f(e)=0$ and $f\bigl|_{\partial K}=1$; we will…

Differential Geometry · Mathematics 2018-07-03 Andrea Calogero , Rita Pini

Given a function $f$ defined on a nonempty and convex subset of the $d$-dimensional Euclidean space, we prove that if $f$ is bounded from below and it satisfies a convexity-type functional inequality with infinite convex combinations, then…

Classical Analysis and ODEs · Mathematics 2025-09-16 Matyas Barczy , Zsolt Páles

We consider a general conic mixed-binary set where each homogeneous conic constraint $j$ involves an affine function of independent continuous variables and an epigraph variable associated with a nonnegative function, $f_j$, of common…

Optimization and Control · Mathematics 2023-12-29 Fatma Kılınç-Karzan , Simge Küçükyavuz , Dabeen Lee , Soroosh Shafieezadeh-Abadeh

It is well-known that the convex and concave envelope of a multilinear polynomial over a box are polyhedral functions. Exponential-sized extended and projected formulations for these envelopes are also known. We consider the convexification…

Optimization and Control · Mathematics 2021-06-14 Yibo Xu , Warren Adams , Akshay Gupte

In many cases the convexity of the image of a linear map with range is $R^n$ is automatic because of the facial structure of the domain of the map. We develop a four step procedure for proving this kind of ``automatic convexity''. To make…

Functional Analysis · Mathematics 2007-05-23 Charles A. Akemann , Nik Weaver

We study the convex hull of the graph of a quadratic function $f(\mathbf{x})=\sum_{ij\in E}x_ix_j$, where the sum is over the edge set of a graph $G$ with vertex set $\{1,\dots,n\}$. Using an approach proposed by Gupte et al. (Discrete…

Optimization and Control · Mathematics 2020-07-14 Mitchell Harris , Thomas Kalinowski

Given a set of disjoint simple polygons $\sigma_1, \ldots, \sigma_n$, of total complexity $N$, consider a convexification process that repeatedly replaces a polygon by its convex hull, and any two (by now convex) polygons that intersect by…

Computational Geometry · Computer Science 2019-12-11 Elias Dahlhaus , Sariel Har-Peled , Alan L. Hu