English
Related papers

Related papers: Reversible Nets of Polyhedra

200 papers

We show that every orthogonal polyhedron homeomorphic to a sphere can be unfolded without overlap while using only polynomially many (orthogonal) cuts. By contrast, the best previous such result used exponentially many cuts. More precisely,…

Computational Geometry · Computer Science 2011-12-21 Mirela Damian , Erik Demaine , Robin Flatland

The Hessian map is the rational map that sends a homogeneous polynomial to the determinant of its Hessian matrix. We prove that the Hessian map is birational on its image for ternary forms of degree $d\ge 4$, $d\neq 5$, by considering the…

Algebraic Geometry · Mathematics 2025-03-13 Ciro Ciliberto , Giorgio Ottaviani , Jerson Caro , Juanita Duque-Rosero

This paper investigates topological reconstruction, related to the reconstruction conjecture in graph theory. We ask whether the homeomorphism types of subspaces of a space $X$ which are obtained by deleting singletons determine $X$…

General Topology · Mathematics 2013-12-02 Max F. Pitz , Rolf Suabedissen

The shiftable Heffter arrays are naturally generalized to the shiftable Heffter spaces. We present a recursive construction which starting from a single shiftable Heffter space leads to infinitely many other shiftable Heffter spaces of the…

Combinatorics · Mathematics 2024-12-23 Marco Buratti , Anita Pasotti

We present two universal hinge patterns that enable a strip of material to fold into any connected surface made up of unit squares on the 3D cube grid--for example, the surface of any polycube. The folding is efficient: for target surfaces…

Computational Geometry · Computer Science 2020-07-20 Nadia M. Benbernou , Erik D. Demaine , Martin L. Demaine , Anna Lubiw

We prove that deciding if a diagram of the unknot can be untangled using at most $k$ Riedemeister moves (where $k$ is part of the input) is NP-hard. We also prove that several natural questions regarding links in the $3$-sphere are NP-hard,…

Geometric Topology · Mathematics 2018-10-09 Arnaud de Mesmay , Yo'av Rieck , Eric Sedgwick , Martin Tancer

In 1958, S. \'Swierczkowski proved that there cannot be a closed loop of congruent interior-disjoint regular tetrahedra that meet face-to-face. Such closed loops do exist for the other four regular polyhedra. It has been conjectured that,…

Metric Geometry · Mathematics 2016-11-09 Michael Elgersma , Stan Wagon

The complete sets of irreducible triangulations are known for the orientable surfaces with genus of 0, 1, or 2 and for the nonorientable surfaces with genus of 1, 2, 3, or 4. By examining these sets we determine some of the properties of…

Combinatorics · Mathematics 2007-05-23 Thom Sulanke

We study mechanical structures composed of spatial four-bar linkages that are bistable, that is, they allow for two distinct configurations. They have an interpretation as quad nets in the Study quadric which can be used to prove existence…

Metric Geometry · Mathematics 2026-04-02 Gudrun Szewieczek , Daniel Huczala , Martin Pfurner , Hans-Peter Schröcker

In arXiv:1905.08311, the author and Rohatgi proved a shuffling theorem for doubly-dented hexagons. In particular, we showed that shuffling removed unit triangles along a horizontal axis in a hexagon only changes the tiling number by a…

Combinatorics · Mathematics 2019-07-09 Tri Lai

If one erects regular hexagons upon the sides of a triangle $T$, several surprising properties emerge, including: (i) the triangles which flank said hexagons have an isodynamic point common with $T$, (ii) the construction can be extended…

Metric Geometry · Mathematics 2022-05-27 Peter Moses , Dan Reznik

The graph reconstruction conjecture states that all graphs on at least three vertices are determined up to isomorphism by their deck. In this paper, a general framework for this problem is proposed to simply explain the reconstruction of…

Combinatorics · Mathematics 2018-10-26 Ameneh Farhadian

This paper proposes a novel algorithm to reassemble an arbitrarily shredded image to its original status. Existing reassembly pipelines commonly consist of a local matching stage and a global compositions stage. In the local stage, a key…

Computer Vision and Pattern Recognition · Computer Science 2019-07-24 Canyu Le , Xin Li

Petri nets are a well-known model of concurrency and provide an ideal setting for the study of fundamental aspects in concurrent systems. Despite their simplicity, they still lack a satisfactory causally reversible semantics. We develop…

Logic in Computer Science · Computer Science 2023-06-22 Hernán Melgratti , Claudio Antares Mezzina , Irek Ulidowski

An embedding of chaotic data into a suitable phase space creates a diffeomorphism of the original attractor with the reconstructed attractor. Although diffeomorphic, the original and reconstructed attractors may not be topologically…

Chaotic Dynamics · Physics 2009-11-13 Robert Gilmore , Christophe Letellier , Nicola Romanazzi

It is shown that any irreducible analytic 1-flat $G$-structure as well as any analytic torsion-free affine connection with irreducibly acting holonomy group can, in principle, be contstructed by twistor methods.

dg-ga · Mathematics 2016-08-31 Sergey A. Merkulov

Multidimensional Heisenberg algebras, whose creation and annihilation operators are the N-dimensional vectors, can be injected into simple Lie algebras g. It is demonstrated that the spectrum of their deformations can be investigated using…

Quantum Algebra · Mathematics 2016-11-23 Vladimir D. Lyakhovsky

In this paper we answer positively a question of whether it is possible for a circle diffeomorphism with breaks to be smoothly conjugate to a rigid rotation in the case when its breaks are lying on pairwise distinct trajectories. An example…

Dynamical Systems · Mathematics 2020-11-02 Alexey Teplinsky

We show that a circle and square of the same area in $\mathbb{R}^2$ are equidecomposable by translations using $\mathbf{\Delta}^0_2$ pieces. That is, pieces which are simultaneously $F_\sigma$ and $G_\delta$ sets. This improves a result of…

Logic · Mathematics 2026-02-27 Spencer Unger , Narmada Varadarajan , Felix Weilacher

Much of social network analysis is - implicitly or explicitly - predicated on the assumption that individuals tend to be more similar to their friends than to strangers. Thus, an observed social network provides a noisy signal about the…

Social and Information Networks · Computer Science 2014-08-18 Ittai Abraham , Shiri Chechik , David Kempe , Aleksandrs Slivkins
‹ Prev 1 4 5 6 7 8 10 Next ›