English
Related papers

Related papers: Reconstructing Polytopes and Pseudomanifolds

200 papers

We prove that a generic homogeneous polynomial of degree $d$ is determined, up to a nonzero constant multiplicative factor, by the vector space spanned by its partial derivatives of order $k$ whenever $k\leq\frac{d}{2}-1$.

Algebraic Geometry · Mathematics 2020-04-29 Zhenjian Wang

In this paper, we show how regular convex 4-polytopes - the analogues of the Platonic solids in four dimensions - can be constructed from three-dimensional considerations concerning the Platonic solids alone. Via the Cartan-Dieudonne…

Mathematical Physics · Physics 2014-02-19 Pierre-Philippe Dechant

A classical question in PL topology, asked among others by Hudson, Lickorish, and Kirby, is whether every linear subdivision of the d-simplex is simplicially collapsible. The answer is known to be positive for d<4. We solve the problem up…

Combinatorics · Mathematics 2017-09-26 Karim Adiprasito , Bruno Benedetti

We prove a number of new restrictions on the enumerative properties of homology manifolds and semi-Eulerian complexes and posets. These include a determination of the affine span of the fine $h$-vector of balanced semi-Eulerian complexes…

Combinatorics · Mathematics 2007-09-26 Ed Swartz

We present explicit constructions of centrally symmetric polytopes with many faces: first, we construct a d-dimensional centrally symmetric polytope P with about (1.316)^d vertices such that every pair of non-antipodal vertices of P spans…

Metric Geometry · Mathematics 2011-11-21 Alexander Barvinok , Seung Jin Lee , Isabella Novik

We define a centrally symmetric analogue of the cyclic polytope and study its facial structure. We conjecture that our polytopes provide asymptotically the largest number of faces in all dimensions among all centrally symmetric polytopes…

Combinatorics · Mathematics 2007-05-23 Alexander Barvinok , Isabella Novik

Consider the question: Given integers $k<d<n$, does there exist a simple $d$-polytope with $n$ faces of dimension $k$? We show that there exist numbers $G(d,k)$ and $N(d,k)$ such that for $n> N(d,k)$ the answer is yes if and only if…

Combinatorics · Mathematics 2016-09-07 Anders Björner , Svante Linusson

A standard fact about two incompressible surfaces in an irreducible 3-manifold is that one can move one of them by isotopy so that their intersection becomes $\pi_1$-injective. By extending it on the maps of some 3-dimensional…

Geometric Topology · Mathematics 2007-05-23 Alexandra Mozgova

We prove that for every convex body $K$ with the center of mass at the origin and every $\varepsilon\in \left(0,\frac{1}{2}\right)$, there exists a convex polytope $P$ with at most $e^{O(d)}\varepsilon^{-\frac{d-1}{2}}$ vertices such that…

Classical Analysis and ODEs · Mathematics 2017-05-05 Márton Naszódi , Fedor Nazarov , Dmitry Ryabogin

We show that: (1) unimodular simplices in a lattice 3-polytope cover a neighborhood of the boundary of the polytope if and only if the polytope is very ample, (2) the convex hull of lattice points in every ellipsoid in R^3 has a unimodular…

Combinatorics · Mathematics 2021-10-01 Joseph Gubeladze

We prove the "Sullivan Conjecture" on the classification of 4-dimensional complete intersections up to diffeomorphism. Here an $n$-dimensional complete intersection is a smooth complex variety formed by the transverse intersection of $k$…

Geometric Topology · Mathematics 2025-02-11 Diarmuid Crowley , Csaba Nagy

Let S, T be surfaces in P3. Suppose that S intersect T is set-theoretically a smooth curve C of degree d and genus g. Suppose that S and T have no common singular points. Then if C is not a complete intersection, then deg(S), deg(T) < 2d^4.…

alg-geom · Mathematics 2008-02-03 David B. Jaffe

We prove two results on stacked triangulated manifolds in this paper: (a) every stacked triangulation of a connected manifold with or without boundary is obtained from a simplex or the boundary of a simplex by certain combinatorial…

Geometric Topology · Mathematics 2016-06-16 Basudeb Datta , Satoshi Murai

The result of Padrol asserts that for every $d\geq 4$, there exist $2^{\Omega(n\log n)}$ distinct combinatorial types of $\lfloor d/2\rfloor$-neighborly simplicial $(d-1)$-spheres with $n$ vertices. We present a construction showing that…

Combinatorics · Mathematics 2021-10-08 Isabella Novik , Hailun Zheng

We show how a $d$-stress on a piecewise-linear realization of an oriented (non-simplicial, in general) $d$-manifold in \rd naturally induces stresses of lower dimensions on this manifold, and discuss implications of this construction to the…

Metric Geometry · Mathematics 2025-08-24 Robert M. Erdahl , Konstantine Rybnikov , Sergeĭ S. Ryshkov

A (convex) polytope $P$ is said to be $2$-level if for every direction of hyperplanes which is facet-defining for $P$, the vertices of $P$ can be covered with two hyperplanes of that direction. The study of these polytopes is motivated by…

We show that the eigenpolytopes of graphs are universal in the sense that every polytope, up to affine equivalence, appears as the eigenpolytope of some positively weighted graph. We next extend the theory of graphical designs, which are…

Combinatorics · Mathematics 2023-09-07 Catherine Babecki , David Shiroma

The Hirsch Conjecture stated that any $d$-dimensional polytope with n facets has a diameter at most equal to $n - d$. This conjecture was disproved by Santos (A counterexample to the Hirsch Conjecture, Annals of Mathematics, 172(1) 383-412,…

Optimization and Control · Mathematics 2025-04-22 Yaguang Yang

A basic combinatorial invariant of a convex polytope $P$ is its $f$-vector $f(P)=(f_0,f_1,\dots,f_{\dim P-1})$, where $f_i$ is the number of $i$-dimensional faces of $P$. Steinitz characterized all possible $f$-vectors of $3$-polytopes and…

Combinatorics · Mathematics 2018-08-13 Takuya Kusunoki , Satoshi Murai

A link in the 3-sphere is homotopically trivial, according to Milnor, if its components bound disjoint maps of disks in the 4-ball. This paper concerns the question of what spaces give rise to the same class of homotopically trivial links…

Geometric Topology · Mathematics 2010-10-15 Vyacheslav Krushkal