Related papers: Empire Maps on Surfaces

The first colours photographs were created by a process introduced by Edmond Becquerel in 1848. The nature of these photochromatic images colours motivated a debate between scientists during the 19th century, which is still not settled. We…

We survey some aspects of the theory of elliptic surfaces and give some results aimed at determining the Picard number of such a surface. For the surfaces considered, this will be equivalent to determining the Mordell-Weil rank of an…

In this series of papers we advance Ramsey theory of colorings over partitions. In this part, we concentrate on anti-Ramsey relations, or, as they are better known, strong colorings, and in particular solve two problems from [CKS21]. It is…

In this paper, we study Dehn colorings of spatial graph diagrams, and classify the vertex conditions, equivalently the palettes. We give some example of spatial graphs which can be distinguished by the number of Dehn colorings with…

We present a means of formulating and solving graph coloring problems with probabilistic graphical models. In contrast to the prevalent literature that uses factor graphs for this purpose, we instead approach it from a cluster graph…

Let X be a minimal complex surface of general type such that its image via the canonical map is a surface; we denote by d the degree of the canonical map. In this expository work, first of all we recall the known possibilities for the…

Regular edge-colored graphs encode colored triangulations of pseudo-manifolds. Here we study families of edge-colored graphs built from a finite but arbitrary set of building blocks, which extend the notion of $p$-angulations to arbitrary…

We construct a family of elliptic surfaces with $p_g=q=1$ that arise from base change of the Hesse pencil. We identify explicitly a component of the higher Noether-Lefschetz locus with positive Mordell-Weil rank, and a particular surface…

A $t$-tone coloring of a graph $G$ assigns to each vertex a set of $t$ colors such that any pair of vertices $u, v$ with distance $d$ can share at most $d-1$ colors. In this note, we prove several new results on $t$-tone coloring. For…

Four-Color Theorem has secret in its logical proof and actual operating. In this paper we will give a proof of Four-Color Theorem based on Kuratowski's Theorem using some induction argument and give a description of the most complicated…

An exposition of the 1918 paper of Latt\`es, together with its historical antecedents, and its modern formulations and applications.

There are many extremely challenging problems about existence of monochromatic arithmetic progressions in colorings of groups. Many theorems hold only for abelian groups as results on non-abelian groups are often much more difficult to…

We survey some principal results and open problems related to colorings of algebraic and geometric objects endowed with symmetries.

This work provides a thorough introduction to the field of gammoids and presents new results that are considered helpful for solving the problems of recognizing and coloring gammoids.

Building on recently established enumerative connections between lambda calculus and the theory of embedded graphs (or "maps"), this paper develops an analogy between typing (of lambda terms) and coloring (of maps). Our starting point is…

This paper is a brief overview of recent results by the authors relating colored Jones polynomials to geometric topology. The proofs of these results appear in the papers [arXiv:1002.0256] and [arXiv:1108.3370], while this survey focuses on…

In the paper we prove, in particular, that for any measurable coloring of the euclidian plane into two colours there is a monochromatic triangle with some restrictions on the sides. Also we consider similar problems in finite fields…

We introduce the concept of alternate-edge-colourings for maps, and study highly symmetric examples of such maps. Edge-biregular maps of type $(k,l)$ occur as smooth normal quotients of a particular index two subgroup of $T_{k,l}$, the full…

In this paper, using the classical covering theory, we introduce a generalization of covering maps of a space $X$ with respect to a topology $\tau$ on the fundamental group of $X$. We show that the famous notions, covering, semicovering,…

This thesis is basically devoted to matroids -- fundamental structure of combinatorial optimization -- though some of our results concern simplicial complexes, or Euclidean spaces. We study old and new problems for these structures, with…