Related papers: Galois points for a finite graph

A criterion for the existence of a birational embedding into a projective plane with three collinear Galois points for algebraic curves is presented. The extendability of an automorphism induced by a Galois point to a linear transformation…

We present an algorithm that determines the Galois group of linear difference equations with rational function coefficients.

In [2] a new factorization for infinite Hessenberg banded matrices was introduced. In this note we prove that this kind of factorization can also be used for finite matrices. In addition, a new method for solving banded linear systems is…

This is a collection of examples showing how the GAP system can be used to compute information about the generating graphs of finite groups. It includes all examples that were needed for the computational results in the paper "Hamiltonian…

Barot, Geiss and Zelevinsky define a notion of a ``cyclically orientable graph'' and use it to devise a test for whether a cluster algebra is of finite type. Barot, Geiss and Zelivinsky's work leaves open the question of giving an efficient…

For a differential operator $L$ of order $n$ over $C(z)$ with a finite (differential) Galois group $G\subset {\rm GL}(C^n)$, there is an algorithm, by M. van Hoeij and J.-A.~Weil, which computes the associated evaluation of the invariants…

We introduce a notion of strict complete intersections with respect to Cox rings and we prove Galois descent for this new notion.

We extend the concept of the law of a finite graph to graphings, which are, in general, infinite graphs whose vertices are equipped with the structure of a probability space. By doing this, we obtain a vast array of new unimodular measures.…

We introduce the notion of Galois holomorphic foliation on the complex projective space as that of foliations whose Gauss map is a Galois covering when restricted to an appropriate Zariski open subset. First, we establish general criteria…

A broader definition of generalized truncations of graphs is introduced followed by an exploration of some standard concepts and parameters with regard to generalized truncations.

We generalize toposic Galois theory to higher topoi. We show that locally constant sheaves in a locally (n-1)-connected n-topos are equivalent to representations of its fundamental pro-n-groupoid, and that the latter can be described in…

Inspired by a very recent work of A. {\DH}uri\'c, S. Jev{\dj}eni\'c and N. Stopar, we introduce a new definition of zero-divisor graphs attached to rings, that includes all of the classical definitions already known in the literature. We…

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 prove that there exist functions $f$ and $g$ such that for all positive integers $k$ and $d$, for every graph $G$ and every subset $A$ of the vertices of $G$, either $G$ contains $k$ $A$-paths such that vertices of different $A$-paths…

In infinite graph theory, the notion of ends, first introduced by Freudenthal and Jung for locally finite graphs, plays an important role when generalizing statements from finite graphs to infinite ones. Nash-Willian's Tree-Packing Theorem…

We define cofinite graphs and cofinite groupoids in a unified way that extends the notion of cofinite groups introduced by Hartley. The common underlying structure of all these objects is that they are directed graphs endowed with a certain…

This paper defines, for each graph $G$, a flag vector $fG$. The flag vectors of the graphs on $n$ vertices span a space whose dimension is $p(n)$, the number of partitions on $n$. The analogy with convex polytopes indicates that the linear…

In the theory of divisors on multigraphs, the $r^{th}$ divisorial gonality of a graph is the minimum degree of a rank $r$ divisor on that graph. It was proved by Gijswijt et al. that the first divisorial gonality of a finite graph is…

We study Brill-Noether existence on a finite graph using methods from polyhedral geometry and lattices. We start by formulating analogues of the Brill-Noether conjectures (both the existence and non-existence parts) for…

These are the notes for an undergraduate course at the University of Edinburgh, 2021-2023. Assuming basic knowledge of ring theory, group theory and linear algebra, the notes lay out the theory of field extensions and their Galois groups,…