English
Related papers

Related papers: Unfolding cubes: nets, packings, partitions, chord…

200 papers

This note establishes that every polyhedron that has a Hamiltonian quasigeodesic can be edge-unfolded to a net, and shows that the class of such polyhedra is infinite.

Computational Geometry · Computer Science 2025-06-24 Joseph O'Rourke

Finite-order invariants of knots in arbitrary 3-manifolds (including non-orientable ones) are constructed and studied by methods of the topology of discriminant sets. Obstructions to the integrability of admissible weight systems to…

Geometric Topology · Mathematics 2016-09-07 Victor A. Vassiliev

We study the confluence property of abstract rewriting systems internal to cubical categories. We introduce cubical contractions, a higher-dimensional generalisation of reductions to normal forms, and employ them to construct cubical…

Logic in Computer Science · Computer Science 2025-12-12 Philippe Malbos , Tanguy Massacrier , Georg Struth

A perfect matching cut is a perfect matching that is also a cutset, or equivalently a perfect matching containing an even number of edges on every cycle. The corresponding algorithmic problem, Perfect Matching Cut, is known to be…

Computational Complexity · Computer Science 2023-02-24 Édouard Bonnet , Dibyayan Chakraborty , Julien Duron

The notion of a quaternionic gerbe is presented as a new way of bundling algebraic structures over a four manifold. The structure groupoid of this fibration is described in some detail. The Euclidean conformal group R*SO(4) appears…

Differential Geometry · Mathematics 2007-05-23 Finlay Thompson

Topological classification of the 4-manifolds bridges computation theory and physics. A proof of the undecidability of the homeomorphy problem for 4-manifolds is outlined here in a clarifying way. It is shown that an arbitrary Turing…

General Relativity and Quantum Cosmology · Physics 2007-05-23 James R. van Meter

In the present paper we introduce and study finite point subsets of a special kind, called optimum distributions, in the n-dimensional unit cube. Such distributions are closely related with known (delta,s,n)-nets of low discrepancy. It…

Combinatorics · Mathematics 2007-07-16 M. M. Skriganov

We apply combinatorial methods to a geometric problem: the classification of polytopes, in terms of Minkowski decomposability. Various properties of skeletons of polytopes are exhibited, each sufficient to guarantee indecomposability of a…

Combinatorics · Mathematics 2016-07-05 Krzysztof Przesławski , David Yost

We prove the following 30-year old conjecture of Gy\H{o}ri and Tuza: the edges of every $n$-vertex graph $G$ can be decomposed into complete graphs $C_1,\ldots,C_\ell$ of orders two and three such that $|C_1|+\cdots+|C_\ell|\le…

Combinatorics · Mathematics 2019-04-03 Daniel Král' , Bernard Lidický , Taísa L. Martins , Yanitsa Pehova

A knot is an an embedding of a circle into three-dimensional space. We say that a knot is unknotted if there is an ambient isotopy of the embedding to a standard circle. By representing knots via planar diagrams, we discuss the problem of…

Geometric Topology · Mathematics 2011-11-08 Allison Henrich , Louis H. Kauffman

Band theory provides the foundation for understanding electronic structure in crystalline materials, but its reliance on exact translational symmetry limits its applicability to systems with defects, disorder, incommensurate modulations, or…

Materials Science · Physics 2026-05-08 Christopher A. Bairnsfather , Ralph M. Kaufmann , Terry A. Loring , Alexander Cerjan

Graph matching consists of aligning the vertices of two unlabeled graphs in order to maximize the shared structure across networks; when the graphs are unipartite, this is commonly formulated as minimizing their edge disagreements. In this…

Machine Learning · Statistics 2021-04-13 Jesús Arroyo , Carey E. Priebe , Vince Lyzinski

We present a characterisation of blenders based on mapping properties of certain sets of curves that can be rigorously verified by computer-assisted methods. We develop an algorithm to construct these sets of curves that requires only a…

Dynamical Systems · Mathematics 2026-03-30 Andy Hammerlindl , Natalia McAlister , Warwick Tucker

We develop a general theory of "bisets": sets with two commuting group actions. They naturally encode topological correspondences. Just as van Kampen's theorem decomposes into a graph of groups the fundamental group of a space given with a…

Group Theory · Mathematics 2015-12-31 Laurent Bartholdi , Dzmitry Dudko

For each positive integer $n$, let $G_n$ be the graph of integer partitions of $n$, where two partitions are adjacent if one is obtained from the other by an elementary transfer of a cell in the Ferrers diagram, followed by reordering.…

General Mathematics · Mathematics 2026-04-02 Fedor B. Lyudogovskiy

We prove that every embedding of $K_{2n+1,2n+1}$ into $\R^3$ contains a non-split link of $n$-components. Further, given an embedding of $K_{2n+1,2n+1}$ in $\R^3$, every edge of $K_{2n+1,2n+1}$ is contained in a non-split $n$-component link…

Geometric Topology · Mathematics 2007-05-23 Danielle O'Donnol

A solution to the problem of topological classification of real cubic fourfolds is presented. It is shown that the real locus of a real non-singular cubic fourfold is obtained from a projective 4-space either by adding several trivial one-…

Algebraic Geometry · Mathematics 2014-02-26 S. Finashin , V. Kharlamov

A stacking operation adds a $d$-simplex on top of a facet of a simplicial $d$-polytope while maintaining the convexity of the polytope. A stacked $d$-polytope is a polytope that is obtained from a $d$-simplex and a series of stacking…

Computational Geometry · Computer Science 2017-03-03 Erik D. Demaine , Andre Schulz

We consider quotients of complete flag manifolds in Cn and Rn by an action of the symmetric group on n objects. We compute their cohomology with field coefficients of any characteristic. Specifically, we show that these topological spaces…

Algebraic Topology · Mathematics 2023-12-20 Lorenzo Guerra , Santanil Jana

All previously published work on isomorphic grid embeddings into n-cubes has been restricted to binary n-cubes. This paper describes a straightforward method for embedding a A x B grid isomorphically into a k-ary n-cube with k>2.

Combinatorics · Mathematics 2007-05-23 Garrison W. Greenwood