English
Related papers

Related papers: Facially exposed cones are not always nice

200 papers

It is shown that the graph obtained by merging two vertices of two 4-cycles is not a $\Theta$-graceful partial cube, thus answering in the negative a question by Bre\v{s}ar and Klav\v{z}ar from [1], who asked whether every partial cube is…

Combinatorics · Mathematics 2020-01-07 Nathann Cohen , Matjaž Kovše

This article investigates the notions of exposed points and (exposed) faces in the matrix convex setting. Matrix exposed points in finite dimensions were first defined by Kriel in 2019. Here this notion is extended to matrix convex sets in…

Functional Analysis · Mathematics 2022-10-05 Igor Klep , Tea Štrekelj

Given n >= 4 positive real numbers, we prove in this note that they are the face areas of a convex polyhedron if and only if the largest number is not more than the sum of the others.

Discrete Mathematics · Computer Science 2011-01-06 Joseph O'Rourke

An open set in C^n is pseudoconvex if and only if its intersection with every affine subspace of complex dimension two as seen as an open set in C^2 is pseudoconvex.

Complex Variables · Mathematics 2009-07-10 Robert Jacobson

An alternative, geometrical proof of a known theorem concerning the decomposition of positive maps of the matrix algebra $M_{2}(\mathbb{C})$ has been presented. The premise of the proof is the identification of positive maps with operators…

Mathematical Physics · Physics 2015-06-04 Marek Miller , Robert Olkiewicz

Slater's condition -- existence of a "strictly feasible solution" -- is a common assumption in conic optimization. Without strict feasibility, first-order optimality conditions may be meaningless, the dual problem may yield little…

Optimization and Control · Mathematics 2017-06-13 Dmitriy Drusvyatskiy , Henry Wolkowicz

We discuss a weak constraint qualification for conic linear programs and its applications for a few classes of cones. This constraint qualification is used to give a solution to a problem proposed by Shapiro and Z\v{a}linescu and show that…

Optimization and Control · Mathematics 2015-04-24 Bruno F. Lourenço

Building on work of Segre and Koll'ar on cubic hypersurfaces, we construct over imperfect fields of characteristic p\geq 3 particular hypersurfaces of degree p, which show that geometrically rational schemes that are regular and whose…

Algebraic Geometry · Mathematics 2020-02-24 Keiji Oguiso , Stefan Schröer

We present counterexamples to Fujita's conjecture in positive characteristics. Precisely, we show that over any algebraically closed field $k$ of characteristic $p>0$ and for any positive integer $m$, there exists a smooth projective…

Algebraic Geometry · Mathematics 2022-01-06 Yi Gu , Lei Zhang , Yongming Zhang

We show that if a cubic hypersurface with positive dual defect over the complex number field is not a cone, then either the hypersurface coincides with the secant variety of the singular locus, or the hypersurface contains a linear…

Algebraic Geometry · Mathematics 2018-10-19 Katsuhisa Furukawa

We show that a capillary surface in a solid cone, that is, a surface that has constant mean curvature and the boundary of surface meets the boundary of the cone with a constant angle, is radially graphical if the mean curvature is…

Differential Geometry · Mathematics 2015-06-23 Rafael López , Juncheol Pyo

We address a problem posed in [1] by demonstrating through an example that, in the absence of separability, the property of sequential cone compactness does not generally imply cone compactness.

Functional Analysis · Mathematics 2025-01-10 Marius Durea , Elena-Andreea Florea

The perception of facial beauty is a complex phenomenon depending on many, detailed and global facial features influencing each other. In the machine learning community this problem is typically tackled as a problem of supervised inference.…

The Unfriendly Partition Conjecture posits that every countable graph admits a 2-colouring in which for each vertex there are at least as many bichromatic edges containing that vertex as monochromatic ones. This is not known in general, but…

Combinatorics · Mathematics 2023-03-22 John Haslegrave

The second-order cone plays an important role in convex optimization and has strong expressive abilities despite its apparent simplicity. Second-order cone formulations can also be solved more efficiently than semidefinite programming in…

Optimization and Control · Mathematics 2016-10-18 Hamza Fawzi

If a convex body C has modular and irreducible face lattice (and is not strictly convex), there is a face-preserving homeomorphism from C to a section of a cone of hermitian matrices or C has dimension 8, 14 or 26.

Geometric Topology · Mathematics 2009-03-05 D. Labardini-Fragoso , M. Neumann-Coto , M. Takane

Derangements are a popular topic in combinatorics classes. We study a generalization to face derangements of the n-dimensional hypercube. These derangements can be classified as odd or even, depending on whether the underlying isometry is…

Combinatorics · Mathematics 2009-06-24 Gary Gordon , Elizabeth McMahon

A long-standing Conjecture of S. Negami states that a connected graph has a finite planar cover if and only if it embeds in the projective plane. It is known that the Conjecture is equivalent to the fact that \emph{the graph $K_{1,2, 2, 2}$…

Combinatorics · Mathematics 2024-12-30 Dickson Annor , Yuri Nikolayevsky , Michael Payne

We prove that every closed oriented 3-manifold admits a hyperbolic cone-manifold structure with cone-angle arbitrarily close to 2pi.

Geometric Topology · Mathematics 2014-11-11 Juan Souto

We prove that if a pure simplicial complex of dimension d with n facets has the least possible number of (d-1)-dimensional faces among all complexes with n faces of dimension d, then it is vertex decomposable. This answers a question of J.…

Combinatorics · Mathematics 2013-02-19 Michał Lasoń