Related papers: Pluripolar hulls and convergence sets

Given an iterated function system of affine dilations with fixed points the vertices of a regular polygon, we characterize which points in the limit set lie on the boundary of its convex hull.

We study functions defined on a closed segment of the real line that belong to the class of Gonchar. We show that the graphs of such functions are pluripolar. We also discuss the generalizations of our result to functions defined on a…

We study the complexity of computing the mixed-integer hull $\operatorname{conv}(P\cap\mathbb{Z}^n\times\mathbb{R}^d)$ of a polyhedron $P$. Given an inequality description, with one integer variable, the mixed-integer hull can have…

Let $G=(V, E)$ be an undirected graph. The spanning trees polytope $P(G)$ is the convex hull of the characteristic vectors of all spanning trees of $G$. In this paper, we describe all facets of $P(G)$ as a consequence of the facets of the…

As the main theorem, it is proved that a collection of minimal $PI$-flows with a common phase group and satisfying a certain algebraic condition is multiply disjoint if and only if the collection of the associated maximal equicontinuous…

We introduce the notion of quadratic hull of a linear code, and give some of its properties. We then show that any symmetric bilinear multiplication algorithm for a finite-dimensional algebra over a field can be obtained by…

A set $S$ of vertices of a graph $G$ is \emph{monophonic convex} if $S$ contains all the vertices belonging to any induced path connecting two vertices of $S$. The cardinality of a maximum proper monophonic convex set of $G$ is called the…

We determine the extreme points and facets of the convex hull of all dual degree partitions of simple graphs on $n$ vertices.

We identify a family of $O(|E(G)|^2)$ nontrivial facets of the connected matching polytope of a graph $G$, that is, the convex hull of incidence vectors of matchings in $G$ whose covered vertices induce a connected subgraph. Accompanying…

For positive integers $m$ and $n$, the partial permutohedron $\mathcal{P}(m,n)$ is a certain integral polytope in $\mathbb{R}^m$, which can be defined as the convex hull of the vectors from $\{0,1,\ldots,n\}^m$ whose nonzero entries are…

Let $S_\epsilon$ be a set of $N$ points in a bounded hyperconvex domain in $C^n$, all tending to 0 as$\epsilon$ tends to 0. To each set $S_\epsilon$ we associate its vanishing ideal $I_\epsilon$ and the pluricomplex Green function…

Let $(M,\omega)$ be a Kahler manifold. An integrable function on M is called $\omega^q$-plurisubharmonic if it is subharmonic on all q-dimensional complex subvarieties. We prove that a smooth $\omega^q$-plurisubharmonic function is…

We study $\mathbb{R}^2\oplus\mathbb{R}$-separately convex hulls of finite sets of points in $\mathbb{R}^3$, as in KirchheimMullerSverak2003. This notion of convexity, which we call $2+1$ convexity, corresponds to rank-one convex convexity,…

A poset ${\mathbb{P}}$ is called reversible iff every bijective homomorphism $f:{\mathbb{P}} \rightarrow {\mathbb{P}}$ is an automorphism. Let ${\mathcal{W}}$ and ${\mathcal{W}} ^*$ denote the classes of well orders and their inverses…

The study of pinnacle sets has been a recent area of interest in combinatorics. Given a permutation, its pinnacle set is the set of all values larger than the values on either side of it. Largely inspired by conjectures posed by Davis,…

In this note, we mainly concern the set $U_f$ of $c\in\mathbb{C}$ such that the power deformation $z(f(z)/z)^c$ is univalent in the unit disk $|z|<1$ for a given analytic univalent function $f(z)=z+a_2z^2+\cdots$ in the unit disk. We will…

In this paper, we investigate the polyhedral structure of two submodular sets with generalized upper bound (GUB) constraints, which arise as important substructures in various real-world applications. We derive a class of strong valid…

We describe the norm-closures of the set $\mathfrak{C}_{\mathfrak{E}}$ of commutators of idempotent operators and the set $\mathfrak{E} - \mathfrak{E}$ of differences of idempotent operators acting on a finite-dimensional complex Hilbert…

For a planar point set $P$, its convex hull is the smallest convex polygon that encloses all points in $P$. The construction of the convex hull from an array $I_P$ containing $P$ is a fundamental problem in computational geometry. By…

It is known from the Runge approximation theorem that every function which is holomorphic in a neighborhood of a compact polynomially convex set $K\subset \complexes^{n}$ can be approximated uniformly on $K$ by analytic polynomials. We…