English
Related papers

Related papers: Not all simplicial polytopes are weakly vertex-dec…

200 papers

We give explicit polynomial-sized (in $n$ and $k$) semidefinite representations of the hyperbolicity cones associated with the elementary symmetric polynomials of degree $k$ in $n$ variables. These convex cones form a family of…

Optimization and Control · Mathematics 2016-11-17 James Saunderson , Pablo A. Parrilo

In this article we prove the following version of the Weak-BAB conjecture for $3$-folds in char $p>5$: Fix a DCC set $I\subset [0, 1)$ and an algebraically closed field $k$ of characteristic $p>5$. Let $\mathfrak{D}$ be a collection of klt…

Algebraic Geometry · Mathematics 2019-02-22 Omprokash Das

We provide a ZFC example of a compact space K such that C(K)* is w*-separable but its closed unit ball is not w*-separable. All previous examples of such kind had been constructed under CH. We also discuss the measurability of the supremum…

Functional Analysis · Mathematics 2014-06-30 Antonio Avilés , Grzegorz Plebanek , José Rodríguez

For a simplicial complex K on m vertices and simplicial complexes K1,...,Km a composed simplicial complex K(K1,...,Km) is introduced. This construction generalizes an iterated simplicial wedge construction studied by A. Bahri, M. Bendersky,…

Combinatorics · Mathematics 2015-05-08 Ayzenberg Anton

The Dushnik-Miller dimension of a poset $\le$ is the minimal number $d$ of linear extensions $\le_1, \ldots , \le_d$ of $\le$ such that $\le$ is the intersection of $\le_1, \ldots , \le_d$. Supremum sections are simplicial complexes…

Discrete Mathematics · Computer Science 2018-05-07 Balthazar Bauer , Lucas Isenmann

Finite dimensional linear spaces (both complex and real) with indefinite scalar product [.,.] are considered. Upper and lower bounds are given for the size of an indecomposable matrix that is normal with respect to this scalar product in…

Functional Analysis · Mathematics 2007-05-23 Olga Holtz

We introduce and study the notion of "surface decomposable" variety, and discuss the possibility that any projective hyper-K\"ahler manifold is surface decomposable, which would produce new evidence for Beauville's weak splitting…

Algebraic Geometry · Mathematics 2018-10-30 Claire Voisin

We provide polynomial upper bounds for the minimal sizes of distal cell decompositions in several kinds of distal structures, particularly weakly $o$-minimal and $P$-minimal structures. The bound in general weakly $o$-minimal structures…

Logic · Mathematics 2026-02-11 Aaron Anderson

We introduce the notion of weak reduciblity for Dupin submanifolds with arbitrary codimension. We give a complete characterization of all weakly reducible Dupin submanifolds, as a consequence of a general result on a broader class of…

Differential Geometry · Mathematics 2007-05-23 Marcos Dajczer , Luis A. Florit , Ruy Tojeiro

Our main result is that every n-dimensional polytope can be described by at most (2n-1) polynomial inequalities and, moreover, these polynomials can explicitly be constructed. For an n-dimensional pointed polyhedral cone we prove the bound…

Metric Geometry · Mathematics 2007-05-23 Hartwig Bosse , Martin Groetschel , Martin Henk

A renowned theorem of Blind and Mani, with a constructive proof by Kalai and an efficiency proof by Friedman, shows that the whole face lattice of a simple polytope can be determined from its graph. This is part of a broader story of…

Combinatorics · Mathematics 2020-06-05 Margaret M. Bayer

The problem of decomposing non-manifold object has already been studied in solid modeling. However, the few proposed solutions are limited to the problem of decomposing solids described through their boundaries. In this thesis we study the…

Graphics · Computer Science 2019-04-03 Franco Morando

Blind and Mani, and later Kalai, showed that the face lattice of a simple polytope is determined by its graph, namely its $1$-skeleton. Call a vertex of a $d$-polytope \emph{nonsimple} if the number of edges incident to it is more than $d$.…

Combinatorics · Mathematics 2018-03-16 Joseph Doolittle , Eran Nevo , Guillermo Pineda-Villavicencio , Julien Ugon , David Yost

The main goal of this paper is proving the fixed point theorem for finite groups acting on weakly systolic complexes. As corollaries we obtain results concerning classifying spaces for the family of finite subgroups of weakly systolic…

Group Theory · Mathematics 2012-09-26 Victor Chepoi , Damian Osajda

We compute the weak$^*$-dentability index of the spaces $C(K)$ where $K$ is a countable compact space. Namely ${Dz}(C([0,\omega^{\omega^\alpha}])) = \omega^{1+\alpha+1}$, whenever $0\le\alpha<\omega_1$. More generally,…

Functional Analysis · Mathematics 2009-01-10 Petr Hajek , Gilles Lancien , Antonin Prochazka

The paper presents geometric models for the set WO of weak orders on a finite set. In particulary, WO is modeled as a set of vertices of a cubical subdivision of a permutahedron. This approach is an alternative to the usual representation…

Combinatorics · Mathematics 2007-05-23 Sergei Ovchinnikov

We study several variants of decomposing a symmetric matrix into a sum of a low-rank positive semidefinite matrix and a diagonal matrix. Such decompositions have applications in factor analysis and they have been studied for many decades.…

Optimization and Control · Mathematics 2023-10-02 Levent Tunçel , Stephen A. Vavasis , Jingye Xu

We classify all the possible $delta$-vectors of d-dimensional integral convex polytopes whose volumes are less than or equal to 3/(d!).

Combinatorics · Mathematics 2009-04-24 Takayuki Hibi , Akihiro Higashitani , Yuuki Nagazawa

Many special classes of simplicial sets, such as the nerves of categories or groupoids, the 2-Segal sets of Dyckerhoff and Kapranov, and the (discrete) decomposition spaces of G\'{a}lvez, Kock, and Tonks, are characterized by the property…

Category Theory · Mathematics 2024-03-05 Carmen Constantin , Tobias Fritz , Paolo Perrone , Brandon Shapiro

A polytope is inscribable if there is a realization where all vertices lie on the sphere. In this paper, we provide a necessary and sufficient condition for a polytope to be inscribable. Based on this condition, we characterize the problem…

Combinatorics · Mathematics 2026-05-14 Yiwen Chen , João Gouveia , Warren Hare , Amy Wiebe