Related papers: Another Diminimal Map on the Torus

We create the unlabeled or vertex-labeled graphs with up to 10 edges and up to 10 vertices and classify them by a set of standard properties: directed or not, vertex-labeled or not, connectivity, presence of isolated vertices, presence of…

We study the behavior of diffeomorphisms, contained in the closure $\bar {\A_\a}$ (in the inductive limit topology) of the set $\A_\a$ of real-analytic diffeomorphisms of the torus $\Bbb T^2$, conjugated to the rotation $R_\a:(x,y)\mapsto…

For a continuous map on a topological graph containing a unique loop S, it is possible to define the degree and, for a map of degree 1, rotation numbers. It is known that the set of rotation numbers of points in S is a compact interval and…

We develop a purely combinatorial framework for the systematic enumeration of knot and link diagrams supported on the thickened torus $T^2\times I$. Using the theory of maps on surfaces, cellular $4$--regular torus projections are encoded…

In this paper, we give definitions of three kinds of minimal charts, and we investigate properties of minimal charts and establish fundamental theorems characterizing minimal charts. To classify charts with two or three crossings we use the…

In this paper, all finite groups whose commuting (non-commuting) graphs can be embed on the plane, torus or projective plane are classified.

The question: "How many different trajectories are there on a single invariant torus within the phase space of an integrable Hamiltonian system?" is posed. A rigorous answer to the question is found both for the rational and the irrational…

We investigate how Viro's integral calculus applies for the study of the topology of stable maps. We also discuss several applications to Morin maps and complex maps.

Our main result is a sharp bound for the number of vertices in a minimal forbidden subgraph for the graphs having minimum rank at most 3 over the finite field of order 2. We also list all 62 such minimal forbidden subgraphs. We conclude by…

This is a very brief report on recent developments on the Dirichlet problem for the minimal surface system and minimal cones in Euclidean spaces. We shall mainly focus on two directions: (1) Further systematic developments after…

Distortion maps are a useful tool for pairing based cryptography. Compared with elliptic curves, the case of hyperelliptic curves of genus g > 1 is more complicated since the full torsion subgroup has rank 2g. In this paper we prove that…

Let $T$ be a tree with $t$ edges. We show that the number of isomorphic (labeled) copies of $T$ in a graph $G = (V,E)$ of minimum degree at least $t$ is at least \[2|E| \prod_{v \in V} (d(v) - t + 1)^{\frac{(t-1)d(v)}{2|E|}}.\]…

Given a graph $G$ we consider sequentially placing dimers on it, namely choosing a maximal independent subset of edges, i.e. edges that do not share common vertices. We study the number of vertices that do not belong to any edge found in…

We give a complete classsification of reduced sextics of torus type with configurations of the singularities and the geometry of the components.

A Hamiltonian cycle of a graph is a closed path that visits every vertex once and only once. It has been difficult to count the number of Hamiltonian cycles on regular lattices with periodic boundary conditions, e.g. lattices on a torus,…

We show that an $(n+1)$-bridge sphere for the unknot is a topologically minimal surface of index at most $n$.

This brief note gives a survey on results relating to existence of closed points on schemes, including an elementary topological characterization of the schemes with (at least one) closed point.

Let $G=(V,E)$ be a connected simple graph. The distance $d(u,v)$ between vertices $u$ and $v$ from $V$ is the number of edges in the shortest $u-v$ path. If $e=uv \in E$ is an edge in $G$ than distance $d(w,e)$ where $w$ is some vertex in…

We describe computer searches that prove the graph reconstruction conjecture for graphs with up to 13 vertices and some limited classes on larger sizes. We also investigate the reconstructibility of tournaments up to 13 vertices, digraphs…

This paper considers how many conjugacy classes of reflections a map can have, under various transitivity conditions. It is shown that for vertex- and for face-transitive maps there is no restriction on their number or size, whereas…