Related papers: Harmonic Galois theory for finite graphs
In combinatorial commutative algebra and algebraic statistics many toric ideals are constructed from graphs. Keeping the categorical structure of graphs in mind we give previous results a more functorial context and generalize them by…
In the preprint we present an outline of the one dimensional version of topological Galois theory. The theory studies topological obstruction to solvability of equations "in finite terms" (i.e. to their solvabilty by radicals, by elementary…
We prove that a connected subcartesian space admits embedding in a Euclidean space. The Whitney Embedding Theorem is then stated as a corollary of our result. Based on the above result together with the theory of distribution on smooth…
A relational structure is (connected-)homogeneous if every isomorphism between finite (connected) substructures extends to an automorphism of the structure. We investigate notions which generalise (connected-)homogeneity, where…
In this paper we study the following problem. Let $A$ be a fixed graph, and let $\hom(G,A)$ denote the number of homomorphisms from a graph $G$ to $A$. Furthermore, let $v(G)$ denote the number of vertices of $G$, and let $\mathcal{G}_d$…
For a finite point set $E\subset \mathbb{R}^d$ and a connected graph $G$ on $k+1$ vertices, we define a $G$-framework to be a collection of $k + 1$ points in E such that the distance between a pair of points is specified if the…
This is an introduction to graph theory, from a geometric and analytic viewpoint. A finite graph $X$ is described by its adjacency matrix $d\in M_N(0,1)$, which can be thought of as being a kind of discrete Laplacian, and we first discuss…
We introduce the notion of differential torsors, which allows the adaptation of constructions from algebraic geometry to differential Galois theory. Using these differential torsors, we set up a general framework for applying patching…
We consider principal bundles as generalized morphisms between topological groupoids. In the category of these generalized morphisms two topological groupoids are isomorphic if and only if they are Morita equivalent. We show that the fibers…
We study the uniqueness of optimal solutions to extremal graph theory problems. Lovasz conjectured that every finite feasible set of subgraph density constraints can be extended further by a finite set of density constraints so that the…
We study harmonic functions on general weighted graphs which allow for a compatible intrinsic metric. We prove an $L^{p}$ Liouville type theorem which is a quantitative integral $L^{p}$ estimate of harmonic functions analogous to Karp's…
We provide an intrinsic definition of the fundamental group of a linear category over a ring as the automorphism group of the fibre functor on Galois coverings. If the universal covering exists, we prove that this group is isomorphic to the…
We prove a refinement of the tree packing theorem by Tutte/Nash-Williams for finite graphs. This result is used to obtain a similar result for end faithful spanning tree packings in certain infinite graphs and consequently to establish a…
A travel groupoid is an algebraic system related with graphs. In this paper, we give an algorithm to construct smooth travel groupoids for any finite graph. This algorithm gives an answer of L.~Nebesk$\acute{\mbox{y}}$'s question, "Does…
Given graphs $F$ and $G$, a perfect $F$-tiling in $G$ is a collection of vertex-disjoint copies of $F$ in $G$ that together cover all the vertices in $G$. The study of the minimum degree threshold forcing a perfect $F$-tiling in a graph $G$…
We consider infinite connected quasi-transitive locally finite graphs and show that every such graph with more than one end is a tree amalgamation of two other such graphs. This can be seen as a graph-theoretical version of Stallings'…
A circle of an infinite locally finite graph $G$ is the imagine of a homeomorphic mapping of the unit circle $S^1$ in $|G|$, the Freudenthal compactification of $G$. A circle of $G$ is Hamiltonian if it meets every vertex (and then every…
For graphs $G$ and $H$, a \emph{homomorphism} from $G$ to $H$ is an edge-preserving mapping from the vertex set of $G$ to the vertex set of $H$. For a fixed graph $H$, by \textsc{Hom($H$)} we denote the computational problem which asks…
Let $F$ be a field of characteristic $0$ containing all roots of unity. We construct a functorial compact Hausdorff space $X_F$ whose profinite fundamental group agrees with the absolute Galois group of $F$, i.e. the category of finite…
We present a novel construction of finite groupoids whose Cayley graphs have large girth even w.r.t. a discounted distance measure that contracts arbitrarily long sequences of edges from the same colour class (sub-groupoid), and only counts…