Related papers: Another Diminimal Map on the Torus
A graph is an apex graph if it contains a vertex whose deletion leaves a planar graph. The family of apex graphs is minor-closed and so it is characterized by a finite list of minor-minimal non-members. The long-standing problem of…
Counting periodic orbits of endomorphisms on the 2-torus is considered, with special focus on the relation between global and local aspects and between the dynamical zeta function on the torus and its analogue on finite lattices. The…
We continue our investigation of the space of geodesic laminations on a surface, endowed with the Hausdorff topology. We determine the topology of this space for the once-punctured torus and the 4-times-punctured sphere. For these two…
We present a unified framework for the quantization of a family of discrete dynamical systems of varying degrees of "chaoticity". The systems to be quantized are piecewise affine maps on the two-torus, viewed as phase space, and include the…
The main purpose this work is to study the minimal fixed point set of fiber-preserving maps for spaces which are fiber bundles over the circle and the fiber is the torus. Using the one-parameter fixed point theory is possible to describe…
We obtain new estimates - both upper and lower bounds - on the mean values of the Weyl sums over a small box inside of the unit torus. In particular, we refine recent conjectures of C. Demeter and B. Langowski (2022), and improve some of…
We enumerate and classify all the semi equivelar maps on the surface of $ \chi=-2 $ with up to 12 vertices. We also determine which of these are vertex-transitive and which are not.
The complete set of minimal obstructions for embedding graphs into the torus is still not determined. In this paper, we present all obstructions for the torus of connectivity 2. Furthermore, we describe the building blocks of obstructions…
Linked-twist maps are area-preserving, piece-wise diffeomorphisms, defined on a subset of the torus. They are non-uniformly hyperbolic generalisations of the well-known Arnold Cat Map. We show that a class of canonical examples have…
In this paper we obtain new estimates of the number of edges in subgraphs of the special distance graph. Bibliography: 21 item.
There exists a smooth foliation with 3 singular points on the two-dimensional torus such that any lifting of a leaf of this foliation on the universal covering of the torus is a dense subset of the covering.
It is known that the number of vertices of a graph of diameter two cannot exceed $d^2+1$. In this contribution we give a new lower bound for orders of Cayley graphs of diameter two in the form $C(d,2)>0.684d^2$ valid for all degrees $d\geq…
We calculate the virtually-cyclic dimension of the mapping class group of a sphere with at most six punctures. As an immediate consequence, we obtain the virtually-cyclic dimension of the mapping class group of the twice-holed torus and of…
We prove that for any weakly convergent sequence of finite graphs with bounded vertex degrees, there exists a topological limit graphing.
In this paper, we give a method to describe the numerical class of a torus invariant surface on a projective toric manifold. As applications, we can classify toric 2-Fano manifolds of Picard number 2 or of dimension at most 4.
We completely characterize the coloring quivers of general torus links by dihedral quandles by first exhausting all possible numbers of colorings, followed by determining the interconnections between colorings in each case. The quiver is…
Halin showed that every edge minimal, k-vertex connected graph has a vertex of degree k. In this note, we prove the analogue to Halin's theorem for edge-minimal, k-edge-connected graphs. We show there are two vertices of degree k in every…
We present a family of finite unit-distance graphs in the plane that are not 4-colourable, thereby improving the lower bound of the Hadwiger-Nelson problem. The smallest such graph that we have so far discovered has 1581 vertices.
A slip on a paper concerning near-vector spaces is fixed. New characterization of near-vector spaces determined by finite fields is provided and the number (up to the isomorphism) of these spaces is exhibited.
A proper vertex-colouring of a simple graph $G$ is said to be odd if, for every non-isolated vertex $v$ of $G$, some colour appears an odd number of times in the neighbourhood of $v$. We show that if $G$ embeds in the torus, then it admits…