English
Related papers

Related papers: On $Z$-monodromies in embedded graphs

200 papers

Graph embeddings deal with injective maps from a given simple, undirected graph $G=(V,E)$ into a metric space, such as $\mathbb{R}^n$ with the Euclidean metric. This concept is widely studied in computer science, see \cite{ge1}, but also…

Combinatorics · Mathematics 2022-05-04 Dominic van der Zypen

This paper is the second in a series where we attempt to give a complete description of the space of all embedded minimal surfaces of fixed genus in a fixed (but arbitrary) closed 3-manifold. The key for understanding such surfaces is to…

Analysis of PDEs · Mathematics 2007-05-23 Tobias H. Colding , William P. Minicozzi

Given a finite or infinite planar graph all of whose faces have degree 4, we study embeddings in the plane in which all edges have length 1, that is, in which every face is a rhombus. We give a necessary and sufficient condition for the…

Mathematical Physics · Physics 2007-05-23 Richard Kenyon , Jean-Marc Schlenker

We introduce the concept of complete edge-colored permutation graphs as complete graphs that are the edge-disjoint union of "classical" permutation graphs. We show that a graph $G=(V,E)$ is a complete edge-colored permutation graph if and…

Combinatorics · Mathematics 2020-04-16 Tom Hartmann , Max Bannach , Martin Middendorf , Peter F. Stadler , Nicolas Wieseke , Marc Hellmuth

Let $\mathcal{A}$ be a set of positive numbers. A graph $G$ is called an $\mathcal{A}$-embeddable graph in $\mathbb{R}^d$ if the vertices of $G$ can be positioned in $\mathbb{R}^d$ so that the distance between endpoints of any edge is an…

Computational Complexity · Computer Science 2017-10-17 Mikhail Tikhomirov

A detailed proof is given of a theorem describing the centraliser of a transitive permutation group, with applications to automorphism groups of objects in various categories of maps, hypermaps, dessins, polytopes and covering spaces, where…

Group Theory · Mathematics 2018-05-25 Gareth A. Jones

We consider when automorphisms of a graph can be induced by homeomorphisms of embeddings of the graph in a $3$-manifold. In particular, we prove that every automorphism of a graph is induced by a homeomorphism of some embedding of the graph…

Geometric Topology · Mathematics 2021-12-15 Erica Flapan , Song Yu

It is a classical fact that the number of vertices of the graphical zonotope $Z_\Gamma$ is equal to the number of acyclic orientations of a graph $\Gamma$. We show that the $f$-polynomial of $Z_\Gamma$ is obtained as the principal…

Combinatorics · Mathematics 2017-03-28 Vladimir Grujić

Let G be an arbitrary simple graph. The main results are explicit representations of the edge cone of G as a finite intersection of closed halfspaces. If G is bipartite and connected we determine the facets of the edge cone and present a…

Combinatorics · Mathematics 2011-04-05 Carlos E. Valencia , Rafael H. Villarreal

Given an oriented surface of positive genus with finitely many punctures, we classify the finite orbits of the mapping class group action on the moduli space of semisimple complex special linear two dimensional representations of the…

Geometric Topology · Mathematics 2022-06-29 Indranil Biswas , Subhojoy Gupta , Mahan Mj , Junho Peter Whang

This paper considers a simple geometric construction, called the Pentagram map. The pentagram map, performed on N-gons, gives rise to a birational mapping on the space of all N-gons. This paper finds what conjecturally are all the…

Metric Geometry · Mathematics 2007-09-11 Richard Evan Schwartz

We give new characterizations for the class of uniformly dense matroids and study applications of these characterizations to graphic and real representable matroids. We show that a matroid is uniformly dense if and only if its base polytope…

Combinatorics · Mathematics 2026-02-03 Karel Devriendt , Raffaella Mulas

Monodromy in analytic families of smooth complex surfaces yields groups of isotopy classes of orientation preserving diffeomorphisms for each family member X. For all deformation classes of minimal elliptic surfaces with p_g>q=0, we…

Algebraic Geometry · Mathematics 2007-05-23 Michael Lönne

This paper came to existence out of the desire to understand iterations of strictly triangular polynomial maps over finite fields. This resulted in two connected results: First, we give a generalization of $\F_p$-actions on $\F_p^n$ and…

Algebraic Geometry · Mathematics 2013-01-24 Stefan Maubach

Any algebra herein is intended over a field of characteristic 0. Let $E$ denote the infinite dimensional Grassman algebra. Given a power associative finite dimensional {$\mathbb{Z}_2$-graded-central-simple} $A$ and a supertrace algebra $B$,…

Rings and Algebras · Mathematics 2025-06-26 Charles Almeida , Lucio Centrone , Claudemir Fideles

The monopole-dimer model introduced recently is an exactly-solvable signed generalisation of the dimer model. We show that the partition function of the monopole-dimer model on a graph invariant under a fixed-point free involution is a…

Combinatorics · Mathematics 2020-06-16 Arvind Ayyer

In this paper we give a complete topological classification of orientation preserving Morse-Smale diffeomorphisms on orientable closed surfaces. For MS diffeomorphisms with relatively simple behaviour it was known that such a classification…

Dynamical Systems · Mathematics 2017-12-07 V. Z. Grines , O. V. Pochinka , S. van Strien

We give a simplified complete proof for the classification of the selfinjective representation-finite algebras of finite dimension over an algebraically closed field. We explain the relations between the two different approaches and also to…

Representation Theory · Mathematics 2023-05-30 Klaus Bongartz

We suggest a combinatorial classification of metric filtrations in measure spaces; a complete invariant of such a filtration is its combinatorial scheme, a measure on the space of hierarchies of the group~$\mathbb Z$. In turn, the notion of…

Dynamical Systems · Mathematics 2018-12-20 A. Vershik , P. Zatitskiy

In this note we introduce a representation of simple undirected graphs in terms of polynomials and obtain a unique code for a simple undirected graph.

Combinatorics · Mathematics 2013-07-02 Shamik Ghosh , Raibatak Sen Gupta , M. K. Sen