Related papers: Harmonic Galois theory for finite graphs

We define a range of new coarse geometric invariants based on various graph-theoretic measures of complexity for finite graphs, including: treewidth, pathwidth, cutwidth and bandwidth. We prove that, for bounded degree graphs, these…

We introduce the concept of a Galois covering of a pointed coalgebra. The theory developed shows that Galois coverings of pointed coalgebras can be concretely expressed by smash coproducts using the coaction of the automorphism group of the…

We develop the notion of a geometric covering of a rigid space X, which yields a much larger class of covering spaces than that studied previously by de Jong. Geometric coverings of X are closed under disjoint unions and are \'etale local…

Necessary and sufficient conditions for a finite connected graph with a strict partial order on vertices to be a combinatorial invariant of pseudoharmonic function are obtained.

We present a simple proof for the universality of invariant and equivariant tensorized graph neural networks. Our approach considers a restricted intermediate hypothetical model named Graph Homomorphism Model to reach the universality…

This is the first in a series of papers devoted to foundations of topological stacks. We begin developing a homotopy theory for topological stacks along the lines of classical homotopy theory of topological spaces. In this paper we go as…

Let $X$ be a reduced connected $k$-scheme pointed at a rational point $x \in X(k)$. By using tannakian techniques we construct the Galois closure of an essentially finite $k$-morphism $f:Y\to X$ satisfying the condition…

In this article we generalize the theory of subgroup graphs of subgroups of free groups to finite index subgroups $H$ of finitely generated groups $G$. We study and prove various properties of $H$ in relation to its subgroup graph…

We show that, given a finitely generated group $G$ as the coordinate group of a finite system of equations over a torsion-free hyperbolic group $\Gamma$, there is an algorithm which constructs a cover of a canonical solution diagram. The…

We develop a theory of $\times$-homotopy, fundamental groupoids and covering spaces that apply to non-simple graphs, generalizing existing results for simple graphs. We prove that $\times$-homotopies from finite graphs can be decomposed…

We consider constrained variants of graph homomorphisms such as embeddings, monomorphisms, full homomorphisms, surjective homomorpshims, and locally constrained homomorphisms. We also introduce a new variation on this theme which derives…

The authors have used generalised Galois Theory to construct a homotopy double groupoid of a surjective fibration of Kan simplicial sets. Here we apply this to construct a new homotopy double groupoid of a map of spaces, which includes…

The outlines of a "Galois theory" for bimeromorphic geometry is here developed, via the study of model-theoretic definable binding groups in the theory CCM of compact complex spaces. As an application, a structure theorem about principal…

A finite group G is called admissible over a given field if there exists a central division algebra that contains a G-Galois field extension as a maximal subfield. We give a definition of embedding problems of division algebras that extends…

Leighton's graph covering theorem says that two finite graphs with a common cover have a common finite cover. We present a new proof of this using groupoids, and use this as a model to prove two generalisations of the theorem. The first…

Leighton's graph covering theorem states that a pair of finite graphs with isomorphic universal covers have a common finite cover. We provide a new proof of Leighton's theorem that allows generalizations; we prove the corresponding result…

Topos properties of the category of covering groupoids over a fixed groupoid are discussed. A classification result for connected covering groupoids over a fixed groupoid analogous to the fundamental theorem of Galois theory is given.

The aim of this paper is to present a few versions of the Riemann-Hurwitz formula for a regular branched covering of graphs. By a graph, we mean a finite connected multigraph. The genus of a graph is defined as the rank of the first…

Finite-sheeted covering mappings onto compact connected groups are studied. It is shown that a finite-sheeted covering mapping from a connected Hausdorff topological space onto a compact connected abelian group G must be a homeomorphism…

This note presents Galois theory for finite fields. It was written as a handout for the MAT401 course ``Polynomial equations and fields'' taught at the University of Toronto in Spring 2026. We use without proofs some basic properties of…