Related papers: Shellability is hard even for balls

We prove that if $G$ is the graph of a connected triangulated $(d-1)$-manifold, for $d\geq 3$, then $G$ is generically globally rigid in $\mathbb R^d$ if and only if it is $(d+1)$-connected and, if $d=3$, $G$ is not planar. The special case…

It is shown that any smooth closed orientable manifold of dimension $2k + 1$, $k \geq 2$, admits a smooth polynomially convex embedding into $\mathbb C^{3k}$. This improves by $1$ the previously known lower bound of $3k+1$ on the possible…

It is conjectured that all decomposable (i.e. interior can be triangulated without adding new vertices) polyhedra with vertices in convex position are infinitesimally rigid and only recently has it been shown that this is indeed true under…

It is conjectured that every cusped hyperbolic 3-manifold has a decomposition into positive volume ideal hyperbolic tetrahedra (a "geometric" triangulation of the manifold). Under a mild homology assumption on the manifold we construct…

We consider $d$-dimensional simplicial complexes which can be PL embedded in the $2d$-dimensional euclidean space. In short, we show that in any such complex, for any three vertices, the intersection of the link-complexes of the vertices is…

Normal surface theory, a tool to represent surfaces in a triangulated 3-manifold combinatorially, is ubiquitous in computational 3-manifold theory. In this paper, we investigate a relaxed notion of normal surfaces where we remove the…

We investigate the collapse of three inelastic particles in dimension $d \geq 2$. We obtain general results of convergence and asymptotics concerning the variables of the dynamical system describing a collapsing system of particles. We…

We show that closed arithmetic hyperbolic n-dimensional orbifolds with larger and larger volumes give rise to triangulations of the underlying spaces whose 1-skeletons are harder and harder to embed nicely in Euclidean space. To show this…

Hemaspaandra~et~al.~[JCSS 2010] conjectured that satisfiability for multi-modal logic restricted to the connectives XOR and 1, over frame classes T, S4, and S5, is solvable in polynomial time. We refute this for S5 frames, by proving…

In this paper we analyze the interaction of an incompressible Newtonian fluid with a linearly elastic Koiter shell whose motion is restricted to transverse displacements. The middle surface of the shell constitutes the mathematical boundary…

Shell models have found wide application in the study of hydrodynamic turbulence because they are easily solved numerically even at very large Reynolds numbers. Although bereft of spatial variation, they accurately reproduce the main…

For a property $\cal P$ of simplicial complexes, a simplicial complex $\Gamma$ is an obstruction to $\cal P$ if $\Gamma$ itself does not satisfy $\cal P$ but all of its proper restrictions satisfy $\cal P$. In this paper, we determine all…

A classical theorem of Macbeath states that for any integers $d \geq 2$, $n \geq d+1$, $d$-dimensional Euclidean balls are hardest to approximate, in terms of volume difference, by inscribed convex polytopes with $n$ vertices. In this paper…

Using experiments and simulations, we study the flow of soft particles through quasi-two-dimensional hoppers. The first experiment uses oil-in-water emulsion droplets in a thin sample chamber. Due to surfactants coating the droplets, they…

We show that given a 3-colorable graph, it is NP-hard to find a 3-coloring with $(16/17 + \eps)$ of the edges bichromatic. In a related result, we show that given a satisfiable instance of the 2-to-1 Label Cover problem, it is NP-hard to…

We show that the decision problem of determining whether a given (abstract simplicial) $k$-complex has a geometric embedding in $\mathbb R^d$ is complete for the Existential Theory of the Reals for all $d\geq 3$ and $k\in\{d-1,d\}$. This…

Collapsibility is a combinatorial strengthening of contractibility. We relate this property to metric geometry by proving the collapsibility of any complex that is CAT(0) with a metric for which all vertex stars are convex. This strengthens…

This paper investigates why and when the edge-based districting problem becomes computationally intractable. The overall problem is represented as an exact mathematical programming formulation consisting of an objective function and several…

In this note we give a p-adic proof of Hodge symmetry for smooth, projective threefolds over complex numbers.

While 3-SAT is NP-hard, 2-SAT is solvable in polynomial time. Austrin, Guruswami, and H\r{a}stad roved a result known as "$(2+\varepsilon)$-SAT is NP-hard" [FOCS'14/SICOMP'17]. They showed that the problem of distinguishing k-CNF formulas…