ﻻ يوجد ملخص باللغة العربية
We consider genera of polyhedra (finite cell complexes) in the stable homotopy category. Namely, the genus of a polyhedron X is the class of polyhedra Y such that all localizations of Y are stably isomorphic to the corresponding localizations of X. We prove that Y is in the genus of X if and only if the wedge XvB is stably isomorphic to YvB, where B is the wedge of all spheres S^n such that the n-th stable homotopy group of X is not torsion. We also prove that if XvX and XvY are stably isomorphic, so are also X and Y. Several examples of calculations of genera are considered.
We introduce a new link invariant called the algebraic genus, which gives an upper bound for the topological slice genus of links. In fact, the algebraic genus is an upper bound for another version of the slice genus proposed here: the minimal genus
We prove that every positively-weighted tree T can be realized as the cut locus C(x) of a point x on a convex polyhedron P, with T weights matching C(x) lengths. If T has n leaves, P has (in general) n+1 vertices. We show there are in fact a continuu
Let C be a simple, closed, directed curve on the surface of a convex polyhedron P. We identify several classes of curves C that live on a cone, in the sense that C and a neighborhood to one side may be isometrically embedded on the surface of a cone
Starting with the unsolved Durers problem of edge-unfolding a convex polyhedron to a net, we specialize and generalize (a) the types of cuts permitted, and (b) the polyhedra shapes, to highlight both advances established and which problems remain open.
A spectral convex set is a collection of symmetric matrices whose range of eigenvalues form a symmetric convex set. Spectral convex sets generalize the Schur-Horn orbitopes studied by Sanyal-Sottile-Sturmfels (2011). We study this class of convex bod