English
Related papers

Related papers: Ramified rectilinear polygons: coordinatization by…

200 papers

A fullerene graph can be embedded in a piecewise linear 2-manifold with each non-hexagonal carbon ring corresponding to a cone vertex. Adjacent two or three such vertices can be combined as a cluster cut out from a parent cone round a…

Combinatorics · Mathematics 2023-03-15 Shaoqing Li

Rotary maps (orientably regular maps) are highly symmetric graph embeddings on orientable surfaces. This paper classifies all rotary maps whose underlying graphs are Praeger-Xu graphs, denoted $\operatorname{C}(p,r,s)$, for any odd prime…

Combinatorics · Mathematics 2025-07-03 Zhaochen Ding , Zheng Guo , Luyi Liu

Just as knots and links can be algebraically described as certain morphisms in the category of tangles in 3 dimensions, compact surfaces smoothly embedded in R^4 can be described as certain 2-morphisms in the 2-category of `2-tangles in 4…

Quantum Algebra · Mathematics 2007-05-23 John C. Baez , Laurel Langford

We introduce the notion of a polyptych lattice, which encodes a collection of lattices related by piecewise linear bijections. We initiate a study of the new theory of convex geometry and polytopes associated to polyptych lattices. In…

Algebraic Geometry · Mathematics 2024-12-31 Laura Escobar , Megumi Harada , Christopher Manon

We describe computer algorithms that produce the complete set of isohedral tilings by n-omino or n-iamond tiles in which the tiles are fundamental domains and the tilings have 3-, 4-, or 6-fold rotational symmetry. The symmetry groups of…

Computational Geometry · Computer Science 2012-01-17 Hiroshi Fukuda , Chiaki Kanomata , Nobuaki Mutoh , Gisaku Nakamura , Doris Schattschneider

A classic result of Brooks, Smith, Stone and Tutte associates to any finite planar network with distinguished source and sink vertices, a tiling of a rectangle by smaller subrectangles whose aspect ratios are given by the conductances of…

Complex Variables · Mathematics 2025-05-22 Ilia Binder , David Pechersky

A greedily routable region (GRR) is a closed subset of $\mathbb R^2$, in which each destination point can be reached from each starting point by choosing the direction with maximum reduction of the distance to the destination in each point…

Computational Geometry · Computer Science 2017-03-01 Martin Nöllenburg , Roman Prutkin , Ignaz Rutter

Homology groups of spaces of nonsingular polynomial embeddings ${\bf R}^1 \to {\bf R}^n$ of degrees $\le 4$ are calculated. A general algebraic technique of such calculations for spaces of polynomial knots of arbitrary degrees is described.

q-alg · Mathematics 2008-02-03 Victor Vassiliev

Polypolyhedra (after R. Lang) are compounds of edge-transitive 1-skeleta. There are 54 topologically different polypolyhedra, and each has icosidodecahedral, cuboctahedral, or tetrahedral symmetry, all are realizable as modular origami…

Metric Geometry · Mathematics 2016-01-14 Sarah-Marie Belcastro , Thomas C. Hull

The symmetries of complex molecular structures can be modeled by the {\em topological symmetry group} of the underlying embedded graph. It is therefore important to understand which topological symmetry groups can be realized by particular…

Geometric Topology · Mathematics 2018-08-14 Kathleen Hake , Blake Mellor , Matthew Pittluck

It is proved that any smooth manifold $\mathcal M$ of dimension $m$ admits a smooth polynomially convex embedding into $\mathbb C^n$ when $n\geq \lfloor 5m/4\rfloor$. Further, such embeddings are dense in the space of smooth maps from…

Complex Variables · Mathematics 2025-04-03 Purvi Gupta , Rasul Shafikov

Regular colored graphs are dual representations of pure colored D-dimensional complexes. These graphs can be classified with respect to an integer, their degree, much like maps are characterized by the genus. We analyse the structure of…

Combinatorics · Mathematics 2016-02-02 Razvan Gurau , Gilles Schaeffer

This paper presents a mathematical framework for analyzing machine learning models through the geometry of their induced partitions. By representing partitions as Riemannian simplicial complexes, we capture not only adjacency relationships…

Machine Learning · Computer Science 2025-08-05 Pawel Gajer , Jacques Ravel

Regular incidence complexes are combinatorial incidence structures generalizing regular convex polytopes, regular complex polytopes, various types of incidence geometries, and many other highly symmetric objects. The special case of…

Combinatorics · Mathematics 2017-11-08 Egon Schulte

Compact pseudo-Riemannian manifolds that have parallel Weyl tensor without being conformally flat or locally symmetric are known to exist in infinitely many dimensions greater than 4. We prove some general topological properties of such…

Differential Geometry · Mathematics 2011-06-07 Andrzej Derdzinski , Witold Roter

A (complete) matching of the cells of a triangulated manifold can be thought as a combinatorial or discrete version of a nonsingular vector field. We give several methods for constructing such matchings.

Geometric Topology · Mathematics 2021-09-14 Gael Meigniez

We show that all residually finite generalized Baumslag-Solitar groups of rank $n \geq 1$, defined on a finite and connected graph, are self-similar. Furthermore we prove that all residually finite fundamental groups of (finite, connected)…

Group Theory · Mathematics 2026-03-17 Dessislava H. Kochloukova

Starting from compact symmetric spaces of inner type, we provide infinite families of compact homogeneous spaces carrying invariant non-flat Bismut connections with vanishing Ricci tensor. These examples turn out to be generalized symmetric…

Differential Geometry · Mathematics 2025-01-03 Fabio Podestà , Alberto Raffero

There are many different algebraic, geometric and combinatorial objects that one can attach to a complex polynomial with distinct roots. In this article we introduce a new object that encodes many of the existing objects that have…

Geometric Topology · Mathematics 2021-04-16 Michael Dougherty , Jon McCammond

We present two algorithms for unfolding the surface of any polyhedron, all of whose faces are triangles, to a nonoverlapping, connected planar layout. The surface is cut only along polyhedron edges. The layout is connected, but it may have…

Computational Geometry · Computer Science 2010-01-21 Erik D. Demaine , David Eppstein , Jeff Erickson , George W. Hart , Joseph O'Rourke