相关论文: Rotor-routing and spanning trees on planar graphs

The rotor walk on a graph is a deterministic analogue of random walk. Each vertex is equipped with a rotor, which routes the walker to the neighbouring vertices in a fixed cyclic order on successive visits. We consider rotor walk on an…

For every group $G$, we show that either $G$ has a topologically transitive action on the line $\mathbb R$ by orientation-preserving homeomorphisms, or every orientation-preserving action of $G$ on $\mathbb R$ has a wandering interval.…

We consider the quantity $P(G)$ associated with a graph $G$ that is defined as the probability that a randomly chosen subtree of $G$ is spanning. Motivated by conjectures due to Chin, Gordon, MacPhee and Vincent on the behaviour of this…

D. Wilson~\cite{[Wi]} in the 1990's described a simple and efficient algorithm based on loop-erased random walks to sample uniform spanning trees and more generally weighted trees or forests spanning a given graph. This algorithm provides a…

Let $G$ be a connected finite graph. Backman, Baker, and Yuen have constructed a family of explicit and easy-to-describe bijections $g_{\sigma,\sigma^*}$ between spanning trees of $G$ and $(\sigma,\sigma^*)$-compatible orientations, where…

We study actions of finitely generated groups on $\bbR$-trees under some stability hypotheses. We prove that either the group splits over some controlled subgroup (fixing an arc in particular), or the action can be obtained by gluing…

Recently there has been renewed interest in the mapping-class group of a compact surface of genus $g \ge 2$ and also in its finite order elements. A finite order element of the mapping-class group will be a conformal automorphisms on some…

For each $p\geq 1$, the star automaton group $\mathcal{G}_{S_p}$ is an automaton group which can be defined starting from a star graph on $p+1$ vertices. We study Schreier graphs associated with the action of the group $\mathcal{G}_{S_p}$…

This paper uses combinatorics and group theory to answer questions about the assembly of icosahedral viral shells. Although the geometric structure of the capsid (shell) is fairly well understood in terms of its constituent subunits, the…

The discrete Green's function (without boundary) $\mathbb{G}$ is a pseudo-inverse of the combinatorial Laplace operator of a graph $G=(V,E)$. We reveal the intimate connection between Green's function and the theory of exact stopping rules…

This paper explores a previously uncharted automaton group generated by a 5-state automaton $(\Pi, A)$ acts by self-similarity on the regular rooted tree $A^{*}$ over a 2-letter alphabet set $A$. Group $G$ has been subjected to several…

Given a global field K and a rational function phi defined over K, one may take pre-images of 0 under successive iterates of phi, and thus obtain an infinite rooted tree T by assigning edges according to the action of phi. The absolute…

We study spanning trees on Sierpinski graphs (i.e., finite approximations to the Sierpinski gasket) that are chosen uniformly at random. We construct a joint probability space for uniform spanning trees on every finite Sierpinski graph and…

In this paper we initiate the study of racks from the combined perspective of combinatorics and finite group theory. A rack R is a set with a self-distributive binary operation. We study the combinatorics of the partially ordered set {\cal…

The classical matrix-tree theorem relates the determinant of the combinatorial Laplacian on a graph to the number of spanning trees. We generalize this result to Laplacians on one- and two-dimensional vector bundles, giving a combinatorial…

If $G$ is a strongly connected finite directed graph, the set $\mathcal{T}G$ of rooted directed spanning trees of $G$ is naturally equipped with a structure of directed graph: there is a directed edge from any spanning tree to any other…

Let G be an affine algebraic group and let R be an associative algebra with a rational action of G by algebra automorphisms. We study the induced G-action on the spectrum Spec R of all prime ideals of R, viewed as a topological space with…

We generalize a theorem of Knuth relating the oriented spanning trees of a directed graph G and its directed line graph LG. The sandpile group is an abelian group associated to a directed graph, whose order is the number of oriented…

Let $\mathcal{O}_K$ be a complete discrete valuation ring with field of fractions $K$ and algebraically closed residue field $k.$ Let $G$ be a smooth connected commutative algebraic group over $K$ which does not contain a copy of…

The nonsingular variety G_T parametrizes all graded ideals I of R=k[x,y] for which the Hilbert function H(R/I)=T. The variety G_T has a natural cellular decomposition: each cell V(E) corresponds to a monomial ideal E for which H(R/E)=T.…