Related papers: Unfolding Polyhedra
A convex polyhedron is Rupert if a hole can be cut into it (making its genus $1$) such that an identical copy of the polyhedron can pass through the hole. Resolving a conjecture of Jerrard-Wetzel-Yuan, Steininger and Yurkevich recently…
Polyfold theory was developed by Hofer-Wysocki-Zehnder by finding commonalities in the analytic framework for a variety of geometric elliptic PDEs, in particular moduli spaces of pseudoholomorphic curves. It aims to systematically address…
We introduce an invariant linked to some foundational questions in geometric measure theory and provide bounds on this invariant by decomposing an arbitrary cycle into uniformly rectifiable pieces. Our invariant measures the difficulty of…
A programming tactic involving polyhedra is reported that has been widely applied in the polyhedral analysis of (constraint) logic programs. The method enables the computations of convex hulls that are required for polyhedral analysis to be…
We revisit a classical theme of (general or translation invariant) valuations on convex polyhedra. Our setting generalizes the classical one, in a ``dual'' direction to previously considered generalizations: while previous research was…
Folding is emerging as a promising manufacturing process to transform flat materials into functional structures, offering efficiency by reducing the need for welding, gluing, and molding, while minimizing waste and enabling automation.…
In recent years extensions of manifold Ricci curvature to discrete combinatorial objects such as graphs and hypergraphs (popularly called as "network shapes"), have found a plethora of applications in a wide spectrum of research areas…
Polytopes are the basic finite data structures for convex sets: they appear as feasible regions in linear optimization, as geometric summaries in algorithms, and as random objects in stochastic geometry. A natural geometric question is…
In this note we consider the problem of manufacturing a convex polyhedral object via casting. We consider a generalization of the sand casting process where the object is manufactured by gluing together two identical faces of parts cast…
Networks and their higher order generalizations, such as hypernetworks or multiplex networks are ever more popular models in the applied sciences. However, methods developed for the study of their structural properties go little beyond the…
There are two well known tasks, related to Newton polyhedra: to study invariants of singularities in terms of their Newton polyhedra, and to describe Newton polyhedra of resultants and discriminants. We introduce so called resultantal…
We investigate the common underlying discrete structures for various smooth and discrete nets. The main idea is to impose the characteristic properties of the nets not only on elementary quadrilaterals but also on larger parameter…
We show that the open problem presented in "Geometric Folding Algorithms: Linkages, Origami, Polyhedra" [DO07] is solved by a theorem of Burago and Zalgaller [BZ96] from more than a decade earlier.
A class of generalized Schr\"{o}dinger elliptic problems involving concave-convex and other types of nonlinearities is studied. A reasonable overview about the set of solutions is provided when the parameters involved in the equation assume…
Unfolding singular points in linear differential equations is a classical technique for studying the properties of irregular singularities by relating them to regular singularities. In this paper, we propose a general framework for…
An orientation preserving diffeomorphism over a surface embedded in a 4-manifold is called extendable, if this diffeomorphism is a restriction of an orientation preserving diffeomorphism on this 4-manifold. In this paper, we investigate…
The Tur\'an hypergraph problem asks to find the maximum number of $r$-edges in a $r$-uniform hypergraph on $n$ vertices that does not contain a clique of size $a$. When $r=2$, i.e., for graphs, the answer is well-known and can be found in…
We approximate boundaries of convex polytopes by smooth hypersurfaces $Y=Y_\varepsilon$ with {\it positive mean curvatures} and, by using basic geometric relations between the scalar curvatures of Riemannin manifolds and the mean curvatures…
We consider the multilinear polytope defined as the convex hull of the feasible region of a linearized binary polynomial optimization problem. We define a relaxation in an extended space for this polytope, which we refer to as the complete…
While there is extensive literature on approximation of convex bodies by inscribed or circumscribed polytopes, much less is known in the case of generally positioned polytopes. Here we give upper and lower bounds for approximation of convex…