English
Related papers

Related papers: Facial structure of matrix convex sets

200 papers

We investigate convergence of point processes associated with critical faces for a \v{C}ech filtration built over a homogeneous Poisson point process in the $d$-dimensional flat torus. The convergence of our point process is established in…

Probability · Mathematics 2023-09-25 Zifu Wei , Takashi Owada , D. Yogeshwaran

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

We consider fixed-point models for topological phases of matter formulated as discrete path integrals in the language of tensor networks. Such zero-correlation length models with an exact notion of topological invariance are known in the…

Strongly Correlated Electrons · Physics 2022-09-27 Andreas Bauer , Jens Eisert , Carolin Wille

We propose a new formulation for integrating over smooth curves and surfaces that are described by their closest point mappings. Our method is designed for curves and surfaces that are not defined by any explicit parameterization and is…

Numerical Analysis · Mathematics 2015-10-16 Catherine Kublik , Richard Tsai

The proper parts of face lattices of convex polytopes are shown to satisfy a strong form of the Cohen--Macaulay property, namely that removing from their Hasse diagram all edges in any closed interval results in a Cohen--Macaulay poset of…

Combinatorics · Mathematics 2015-11-11 Christos A. Athanasiadis , Myrto Kallipoliti

We study a global theory of affine maximal surfaces with singularities, which are called affine maximal maps and defined by Aledo--Mart\' inez--Mil\' an. In this paper, we define a special subclass of such surfaces other than improper…

Differential Geometry · Mathematics 2025-07-15 Jun Matsumoto

Convex geometries form a subclass of closure systems with unique criticals, or $UC$-systems. We show that the $F$-basis introduced in [1] for $UC$-systems, becomes optimum in convex geometries, in two essential parts of the basis: right…

Optimization and Control · Mathematics 2016-02-02 Kira Adaricheva

The degree of a point configuration is defined as the maximal codimension of its interior faces. This concept is motivated from a corresponding Ehrhart-theoretic notion for lattice polytopes and is related to neighborly polytopes and the…

Combinatorics · Mathematics 2013-08-28 Benjamin Nill , Arnau Padrol

Compact polyhedra of cubic point symmetry Oh, exhibit surfaces of planar sections (facets) characterized by normal vector families {abc} with up to 48 members each, compatible with Oh symmetry. We focus first on polyhedra confined by facets…

Atomic and Molecular Clusters · Physics 2022-09-20 KLaus E. Hermann

A convex partition of a point set P in the plane is a planar partition of the convex hull of P with empty convex polygons or internal faces whose extreme points belong to P. In a convex partition, the union of the internal faces give the…

Computational Geometry · Computer Science 2020-12-16 Hadrien Cambazard , Nicolas Catusse

Let $A$ be an integral matrix and let $P$ be the convex hull of its columns. By a result of Gelfand, Kapranov and Zelevinski, the so-called principal $A$-determinant locus is equal to the union of the closures of the discriminant loci of…

Algebraic Geometry · Mathematics 2026-02-16 Špela Špenko , Michel Van den Bergh

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

We consider variants of the classical Frank-Wolfe algorithm for constrained smooth convex minimization, that instead of access to the standard oracle for minimizing a linear function over the feasible set, have access to an oracle that can…

Optimization and Control · Mathematics 2022-02-10 Dan Garber , Noam Wolf

The node-opening technique, originally designed for constructing minimal surfaces, is adapted to construct a rich variety of new maxfaces of high genus that are embedded outside a compact set and have arbitrarily many catenoid or planar…

Differential Geometry · Mathematics 2024-06-27 Hao Chen , Anu Dhochak , Pradip Kumar , Sai Rasmi Ranjan Mohanty

We study various convex functions on $R^n$ associated with positive definite matrices. This yiels some exotic Holder matrix inequalities.

Functional Analysis · Mathematics 2019-09-27 Jean-Christophe Bourin , Jingjing Shao

Solving a long-standing open question in convex geometry, we will show that typical convex surfaces contain points of infinite curvature in all tangent directions. To prove this, we use an easy curvature definition imitating the idea of…

Metric Geometry · Mathematics 2011-09-13 Karim Adiprasito

In this paper we address the basic geometric question of when a given convex set is the image under a linear map of an affine slice of a given closed convex cone. Such a representation or 'lift' of the convex set is especially useful if the…

Optimization and Control · Mathematics 2013-06-10 João Gouveia , Pablo A. Parrilo , Rekha Thomas

We lay the foundations of convex hypersurface theory in contact topology, extending the work of Giroux in dimension three. Specifically, we prove that any closed hypersurface in a contact manifold can be $C^0$-approximated by a convex one.…

Symplectic Geometry · Mathematics 2026-04-30 Joseph Breen , Austin Christian , Ko Honda , Yang Huang

The present work considers the properties of generally convex sets in the $n$-dimensional real Euclidean space $\mathbb{R}^n$, $n>1$, known as weakly $m$-convex, $m=1,2,\ldots,n-1$. An open set of $\mathbb{R}^n$ is called weakly $m$-convex…

Metric Geometry · Mathematics 2021-11-03 Tetiana Osipchuk

A unified matrix-vector representation is developed of such solution concepts as the core, the uncovered, the uncaptured, the minimal weakly stable, the minimal undominated, the minimal dominant and the untrapped sets. We also propose…

Economics · Quantitative Finance 2016-07-11 Fuad Aleskerov , Andrey Subochev
‹ Prev 1 8 9 10 Next ›