Related papers: Harmonic Galois theory for finite graphs

We supply an upper bound on the distinguishing chromatic number of certain infinite graphs satisfying an adjacency property. Distinguishing proper $n$-colourings are generalized to the new notion of distinguishing homomorphisms. We prove…

We study integral points on varieties with infinite \'etale fundamental groups. More precisely, for a number field $F$ and $X/F$ a smooth projective variety, we prove that for any geometrically Galois cover $\varphi\colon Y \to X$ of degree…

We develop a gauge theory or theory of bundles and connections on them at the level of braids and tangles. Extending recent algebraic work, we provide now a fully diagrammatic treatment of principal bundles, a theory of global gauge…

If K is an odd-dimensional flag closed manifold, flag generalized homology sphere or a more general flag weak pseudomanifold with sufficiently many vertices, then the maximal number of edges in K is achieved by the balanced join of cycles.…

Given any pointed CW complex (X,x), it is well known that the fondamental group of X pointed at x is naturally isomorphic to the automorphism group of the functor which associates to a locally constant sheaf on X its fibre at x. The purpose…

We extend finite embedding problems over fields, a central notion in inverse Galois theory, to the situation of a skew field $H$ of finite dimension over its center $h$. First, we show that solving a finite embedding problem over $H$ is…

We present a geometric setting for the differential Galois theory of $G$-invariant connections with parameters. As an application of some classical results on differential algebraic groups and Lie algebra bundles, we see that the Galois…

Given a graph $G$, the (graph theory) general position problem is to find the maximum number of vertices such that no three vertices lie on a common geodesic. This graph invariant is called the general position number (gp-number for short)…

We develop an explicit covering theory for complexes of groups, parallel to that developed for graphs of groups by Bass. Given a covering of developable complexes of groups, we construct the induced monomorphism of fundamental groups and…

Let $Z \to X$ be a finite branched Galois cover of normal projective geometrically integral varieties of dimension $d \geq 2$ over a perfect field $k$. For such a cover, we prove a Chebotarev-type density result describing the decomposition…

Let $p:\Sigma'\to\Sigma$ be a finite Galois cover, possibly branched, with Galois group $G$. We are interested in the structure of the cohomology of $\Sigma'$ as a module over $G$. We treat the cases of branched and unbranched covers…

The recently introduced A-homotopy groups for graphs are investigated. The main concern of the present article is the construction of an infinite cell complex, the homotopy groups of which are isomorphic to the A-homotopy groups of the…

We prove the existence of a Galois closure for towers of torsors under finite group schemes over a proper, geometrically connected and geometrically reduced algebraic stack $X$ over a field $k$. This is done by describing the Nori…

The number of homomorphisms from a finite graph $F$ to the complete graph $K_n$ is the evaluation of the chromatic polynomial of $F$ at $n$. Suitably scaled, this is the Tutte polynomial evaluation $T(F;1-n,0)$ and an invariant of the cycle…

Lattice-based cryptography is not only for thwarting future quantum computers, and is also the basis of Fully Homomorphic Encryption. Motivated from the advantage of graph homomorphisms we combine graph homomorphisms with graph total…

This note presents a new, elementary proof of a generalization of a theorem of Halin to graphs with unbounded degrees, which is then applied to show that every connected, countably infinite graph G with a subdegree-finite, infinite…

For a finite connected graph $\mathcal{E}$ with set of edges $E$, a finite $E$-generated group $G$ is constructed such that the set of relations $p=1$ satisfied by $G$ (with $p$ a word over $E\cup E^{-1}$) is closed under deletion of…

We present a canonical way to decompose finite graphs into highly connected local parts. The decomposition depends only on an integer parameter whose choice sets the intended degree of locality. The global structure of the graph, as…

We define a covering of a profinite graph to be a projective limit of a system of covering maps of finite graphs. With this notion of covering, we develop a covering theory for profinite graphs which is in many ways analogous to the…

We introduce a graded homology theory for graded \'etale groupoids. For $\mathbb Z$-graded groupoids, we establish an exact sequence relating the graded zeroth-homology to non-graded one. Specialising to the arbitrary graph groupoids, we…