中文
相关论文

相关论文: Strongly involutive self-dual polyhedra

200 篇论文

It is known that strongly involutive polyhedra are closely related to self-dual maps where the antipodal function acts as duality isomorphism. Such a family of polyhedra appears in different combinatorial, topological and geometric…

We present new examples of topologically convex edge-ununfoldable polyhedra, i.e., polyhedra that are combinatorially equivalent to convex polyhedra, yet cannot be cut along their edges and unfolded into one planar piece without overlap.…

计算几何 · 计算机科学 2020-07-30 Erik D. Demaine , Martin L. Demaine , David Eppstein

The dual of a polyhedron is a polyhedron -- or in graph theoretical terms: the dual of a 3-connected plane graph is a 3-connected plane graph. Astonishingly, except for sufficiently large facewidth, not much is known about the connectivity…

组合数学 · 数学 2021-10-20 Drago Bokal , Gunnar Brinkmannb , Carol T. Zamfirescu

We define an abstract regular polytope to be internally self-dual if its self-duality can be realized as one of its symmetries. This property has many interesting implications on the structure of the polytope, which we present here. Then,…

群论 · 数学 2016-10-11 Gabe Cunningham , Mark Mixer

A self-dual map $G$ is said to be \emph{antipodally self-dual} if the dual map $G^*$ is antipodal embedded in $\mathbb{S}^2$ with respect to $G$. In this paper, we investigate necessary and/or sufficient conditions for a map to be…

组合数学 · 数学 2024-01-01 Luis Montejano , Jorge L. Ramírez Alfonsín , Ivan Rasskin

We define a simple orthogonal polyhedron to be a three-dimensional polyhedron with the topology of a sphere in which three mutually-perpendicular edges meet at each vertex. By analogy to Steinitz's theorem characterizing the graphs of…

计算几何 · 计算机科学 2016-08-12 David Eppstein , Elena Mumford

We find all polyhedral graphs such that their complements are still polyhedral. These turn out to be all self-complementary.

组合数学 · 数学 2021-02-24 Riccardo Walter Maffucci

Given vertex valencies admissible for a self-dual polyhedral graph, we describe an algorithm to explicitly construct such a polyhedron. Inputting in the algorithm permutations of the degree sequence can give rise to non-isomorphic graphs.…

组合数学 · 数学 2021-08-03 Riccardo W. Maffucci

We propose a classification of polyhedra (planar, $3$-connected graphs) according to their type i.e., their set of quantities of common neighbours for each pair of distinct vertices. For every (finite) set of non-negative integers, we…

组合数学 · 数学 2025-08-05 Riccardo W. Maffucci

This article aims to study the class of strongly self-dual polytopes (ssd-polytopes for short), defined in a paper by Lov\'asz \cite{lovasz}. He described a series of such polytopes (called $L$-type polytopes), which he used to solve a…

组合数学 · 数学 2025-01-28 Ákos G. Horváth , István Prok

We explore several families of flip-graphs, all related to polygons or punctured polygons. In particular, we consider the topological flip-graphs of once-punctured polygons which, in turn, contain all possible geometric flip-graphs of…

组合数学 · 数学 2018-09-10 Hugo Parlier , Lionel Pournin

A family of closed manifolds is called cohomologically rigid if a cohomology ring isomorphism implies a diffeomorphism for any two manifolds in the family. We establish cohomological rigidity for large families of 3-dimensional and…

Any convex polytope whose combinatorial automorphism group has two orbits on the flags is isomorphic to one whose group of Euclidean symmetries has two orbits on the flags (equivalently, to one whose automorphism group and symmetry group…

度量几何 · 数学 2016-03-09 Nicholas Matteo

The mapping class group of a closed surface of genus $g$ is an extension of the Torelli group by the symplectic group. This leads to two natural problems: (a) compute (stably) the symplectic decomposition of the lower central series of the…

几何拓扑 · 数学 2017-12-12 Stavros Garoufalidis , Ezra Getzler

Every regular map on a closed surface gives rise to generally six regular maps, its "Petrie relatives", that are obtained through iteration of the duality and Petrie operations (taking duals and Petrie-duals). It is shown that the skeletal…

组合数学 · 数学 2012-10-09 Anthony M. Cutler , Egon Schulte , Jorg M. Wills

A classic theorem by Steinitz states that a graph G is realizable by a convex polyhedron if and only if G is 3-connected planar. Zonohedra are an important subclass of convex polyhedra having the property that the faces of a zonohedron are…

计算几何 · 计算机科学 2008-11-04 Muhammad Abdullah Adnan , Masud Hasan

Topology and geometry are deeply intertwined in the study of surfaces, though their interaction manifests differently in smooth and discrete settings. In the smooth category, a classical result asserts that any closed smooth surface…

微分几何 · 数学 2025-12-23 Soto Hisakawa , Shizuo Kaji , Ryo Kawai

Two single parameter families of polyhedra $P(\psi)$ are constructed in three dimensional spaces of constant curvature $C(\psi)$. Identification of the faces of the polyhedra via isometries results in cone manifolds $M(\psi)$ which are…

几何拓扑 · 数学 2007-05-23 A Aalam

Graph manifolds form important classes of $3$-dimensional closed and orientable manifolds. For example, {\it Seifert} manifolds are graph manifolds where hyperbolic manifolds are not. In applying singularity theory of differentiable maps to…

几何拓扑 · 数学 2022-08-16 Naoki Kitazawa

A self-dual algebras is one isomorphic as a module to the opposite of its dual; a quasi self-dual algebra is one whose cohomology with coefficients in itself is isomorphic to that with coefficients in the opposite of its dual. For these…

K理论与同调 · 数学 2011-11-03 Murray Gerstenhaber
‹ 上一页 1 2 3 10 下一页 ›