English
Related papers

Related papers: 2-symmetric transformations for 3-manifolds of gen…

200 papers

A concrete computation -- twelve slidings with sixteen tiles -- reveals that certain commutativity phenomena occur in every double semigroup. This can be seen as a sort of Eckmann-Hilton argument, but it does not use units. The result…

Category Theory · Mathematics 2010-03-09 Joachim Kock

We find all Heegaard diagrams with the property "alternating" or "weakly alternating" on a genus two orientable closed surface. Using these diagrams we give infinitely many genus two 3--manifolds, each admits an automorphism whose…

Geometric Topology · Mathematics 2015-02-04 Chao Wang , Yimu Zhang

We prove that for every closed, connected, orientable, irreducible 3-manifold, there exists an alternating group A_n which is not the topological symmetry group of any graph embedded in the manifold. We also show that for every finite group…

Geometric Topology · Mathematics 2011-08-16 Erica Flapan , Harry Tamvakis

This article focuses on a class of properly edge-colored graphs, which arise from topological combinatorics, and investigates their embeddings onto surfaces. Specifically, these graphs are known as the dual graphs of balanced normal…

Geometric Topology · Mathematics 2025-12-03 Biplab Basak , Sourav Sarkar

We show that for all $n \equiv 0 \pmod{6}$, $n \geq 18$, there is an orientable triangular embedding of the octahedral graph on $n$ vertices that can be augmented with handles to produce a genus embedding of the complete graph of the same…

Combinatorics · Mathematics 2024-12-24 Timothy Sun

A general theory of permutation orbifolds is developed for arbitrary twist groups. Explicit expressions for the number of primaries, the partition function, the genus one characters, the matrix elements of modular transformations and for…

High Energy Physics - Theory · Physics 2009-10-31 P. Bantay

A 2-switch is an edge addition/deletion operation that changes adjacencies in the graph while preserving the degree of each vertex. A well known result states that graphs with the same degree sequence may be changed into each other via…

Combinatorics · Mathematics 2012-08-14 Michael D. Barrus

Two edge colorings of a graph are {\em edge-Kempe equivalent} if one can be obtained from the other by a series of edge-Kempe switches. This work gives some results for the number of edge-Kempe equivalence classes for cubic graphs. In…

Combinatorics · Mathematics 2012-09-11 sarah-marie belcastro , Ruth Haas

The class of the hypercomplex pseudo-Hermitian manifolds is considered. The flatness of the considered manifolds with the 3 parallel complex structures is proved. Conformal transformations of the metrics are introduced. The conformal…

Differential Geometry · Mathematics 2012-03-27 Kostadin Gribachev , Mancho Manev , Stancho Dimiev

Monographs are graph-like structures with directed edges of unlimited length that are freely adjacent to each other. The standard nodes are represented as edges of length zero. They can be drawn in a way consistent with standard graphs and…

Logic in Computer Science · Computer Science 2023-03-03 Thierry Boy de la Tour

$2$-stratifolds are a generalization of $2$-manifolds that occur as objects in applications such as in TDA. These spaces can be described by an associated bicoloured labelled graph. In previous papers we obtained a classification of…

Geometric Topology · Mathematics 2018-12-05 J. C. Gómez-Larrañaga , F. González-Acuña , Wolfgang Heil

The chromatic index of a cubic graph is either 3 or 4. Edge-Kempe switching, which can be used to transform edge-colorings, is here considered for 3-edge-colorings of cubic graphs. Computational results for edge-Kempe switching of cubic…

Combinatorics · Mathematics 2021-05-05 Jan Goedgebeur , Patric R. J. Östergård

We investigate an extended version of the stable Andrews-Curtis transformations, referred to as EAC transformations, and compare it with a notion of equivalence in a family of $3$-manifolds with boundary, called the {\emph{simple balanced…

Geometric Topology · Mathematics 2021-10-25 Neda Bagherifard

We improve and extend to the non-orientable case a recent result of Karabas, Malicki and Nedela concerning the classification of all orientable prime 3-manifolds of Heegaard genus two, triangulated with at most 42 coloured tetrahedra.

Geometric Topology · Mathematics 2012-03-02 Paola Bandieri , Paola Cristofori , Carlo Gagliardi

In this paper, we classify compact simply connected cohomogeneity one manifolds up to equivariant diffeomorphism whose isotropy representation by the connected component of the principal isotropy subgroup has three or less irreducible…

Differential Geometry · Mathematics 2010-06-03 Chenxu He

Many finite groups, including all finite non-abelian simple groups, can be symmetrically generated by involutions. In this paper we give an algorithm to symmetrically represent elements of finite groups and to transform symmetrically…

Group Theory · Mathematics 2007-05-23 Z. Hasan , A. Kasouha

Mutation is an operation on 3-manifolds containing an embedded surface of genus 2. It is defined by cutting along the surface and regluing using the `hyperelliptic' involution, and is known to preserve many 3-manifold invariants. I show…

dg-ga · Mathematics 2007-05-23 Daniel Ruberman

The operation of switching a graph $\Gamma$ with respect to a subset $X$ of the vertex set interchanges edges and non-edges between $X$ and its complement, leaving the rest of the graph unchanged. This is an equivalence relation on the set…

Combinatorics · Mathematics 2015-02-19 Peter J. Cameron , Pablo Spiga

We characterise the set of fundamental groups for which there exist $n$-manifolds that are $h$-cobordant (hence homotopy equivalent) but not simple homotopy equivalent, when $n$ is sufficiently large. In particular, for $n \ge 12$ even, we…

Geometric Topology · Mathematics 2024-09-06 Csaba Nagy , John Nicholson , Mark Powell

In this dissertation, we explore the structure of inversion graphs of permutations--a class of graphs that naturally arises by representing each permutation as a graph, where vertices correspond to entries and edges encode inversions.…

Combinatorics · Mathematics 2025-06-30 Sean Mandrick
‹ Prev 1 2 3 10 Next ›