Related papers: Rotor-routing and spanning trees on planar graphs

Let $C_2$ denote the cyclic group of order 2. We compute the $RO(C_2)$-graded cohomology of all $C_2$-surfaces with constant integral coefficients. We show when the action is nonfree, the answer depends only on the genus, the orientability…

Given a square matrix with elements in the group-ring of a group, one can consider the sequence formed by the trace (in the sense of the group-ring) of its powers. We prove that the corresponding generating series is an algebraic…

Let $P$ be a set of $n \geq 5$ points in convex position in the plane. The path graph $G(P)$ of $P$ is an abstract graph whose vertices are non-crossing spanning paths of $P$, such that two paths are adjacent if one can be obtained from the…

Let $G$ be a semiabelian variety defined over an algebraically closed field $K$ of characteristic $0$. Let $\Phi\colon G\dashrightarrow G$ be a dominant rational self-map. Assume that an iterate $\Phi^m \colon G \to G$ is regular for some…

Let G be the separable Galois group of a finite field F of characteristic p, and X/F an imaginary hyperelliptic curve such that G acts transitively on its set W(X) of Weierstrass points. The existence of a G-invariant 2-torsion point on the…

From the point of view of discrete geometry, the class of locally finite transitive graphs is a wide and important one. The subclass of Cayley graphs is of particular interest, as testifies the development of geometric group theory. Recall…

We continue the study of the properties of graphs in which the ball of radius $r$ around each vertex induces a graph isomorphic to the ball of radius $r$ in some fixed vertex-transitive graph $F$, for various choices of $F$ and $r$. This is…

Suppose that a group $G$ acts transitively on the points of a non-Desarguesian plane, $\mathcal{P}$. We prove first that the Sylow 2-subgroups of $G$ are cyclic or generalized quaternion. We also prove that $\mathcal{P}$ must admit an odd…

Consider the random Cayley graph of a finite group $G$ with respect to $k$ generators chosen uniformly at random, with $1 \ll k \lesssim \log |G|$. The results of this article supplement those in the three main papers on random Cayley…

We give a classification of ordered five points in $\mathbb P^3$ under the diagonal action of $GL_4$ over an algebraically closed field of characteristic $0$, by an explicit description of the diagonal action of $GL_4$ on the quintuple of…

We investigate a structural generalisation of treewidth we call $\mathcal{A}$-blind-treewidth where $\mathcal{A}$ denotes an annotated graph class. This width parameter is defined by evaluating only the size of those bags $B$ of…

Let $\mathbb{G}=\left(\mathbb{V},\mathbb{E}\right)$ be the graph obtained by taking the cartesian product of an infinite and connected graph $G=(V,E)$ and the set of integers $\mathbb{Z}$. We choose a collection $\mathcal{C}$ of finite…

Let $G$ be a graph and $T$ be a spanning tree of $G$. We use $Q(G)=D(G)+A(G)$ to denote the signless Laplacian matrix of $G$, where $D(G)$ is the diagonal degree matrix of $G$ and $A(G)$ is the adjacency matrix of $G$. The signless…

We provide a structural description of, and invariants for, maximum spanning tree-packable graphs, i.e. those graphs G for which the edge connectivity of G is equal to the maximum number of edge-disjoint spanning trees in G. These graphs…

In this article we study the transitivity of the group of automorphisms of real algebraic surfaces. We characterize real algebraic surfaces with very transitive automorphism groups. We give applications to the classification of real…

In this paper, we are concerned with mean hitting time $\langle\mathcal{H}\rangle$ for random walks on recursive growth tree networks that are built based on an arbitrary tree as the seed via implementing various primitive graphic…

Motivated by various results on homogeneous geodesics of Riemannian spaces, we study homogeneous trajectories, i.e. trajectories which are orbits of a one-parameter symmetry group, of Lagrangian and Hamiltonian systems. We present criteria…

Let $\mathcal G$ be an infinite graph -- not necessarily one-ended -- on which the simple random walk is transient. We define a variant of the continuous-time random walk on $\mathcal G$ which reaches $\infty$ in finite time and "reflects…

Working with tree graphs is always easier than with loopy ones and spanning trees are the closest tree-like structures to a given graph. We find a correspondence between the solutions of random K-satisfiability problem and those of spanning…

A group action on the input ring or category induces an action on the algebraic $K$-theory spectrum. However, a shortcoming of this naive approach to equivariant algebraic $K$-theory is, for example, that the map of spectra with $G$-action…