Related papers: Sandpiles, spanning trees, and plane duality

The notion of an upward plane graph in graph theory and that of a progressive plane graph (or plane string diagram) in category theory are essentially the same thing. In this paper, we combine the ideas in graph theory and category theory…

In this paper, a question due to Heckenberger, Shareshian and Welker on racks in [7] is positively answered. A rack is a set together with a selfdistributive bijective binary operation. We show that the lattice of subracks of every finite…

For a connected labelled graph $G$, a {\em spanning tree} $T$ is a connected and an acyclic subgraph that spans all vertices of $G$. In this paper, we consider a classical combinatorial problem which is to list all spanning trees of $G$. A…

The braid group $B_g$ is embedded in the ribbon braid group that is defined to be the mapping class group $\Gamma_{0,(g),1}$. By gluing two copies of surface $S_{0,g+2}$ along $g+1$ holes, we get surface $S_{g,1}$. A pillar switching is a…

In this paper, we introduce two families of planar and self-similar graphs which have small-world properties. The constructed models are based on an iterative process where each step of a certain formulation of modules results in a final…

With every nontrivial connected algebraic group $G$ we associate a positive integer ${\rm gtd}(G)$ called the generic transitivity degree of $G$ and equal to the maximal $n$ such that there is a nontrivial action of $G$ on an irreducible…

We study groups acting vertex-transitively on connected, trivalent graphs such that stabilizers of vertices are infinite. If the action is edge-transitive, we prove that the graph has to be a tree. We analyze the case where the action is…

Let $\Gamma$ be a simple undirected graph on a finite vertex set and let $A$ be its adjacency matrix. Then $\Gamma$ is {\it singular} if $A$ is singular. The problem of characterising singular graphs is easy to state but very difficult to…

Let $G$ be a symplectic or special orthogonal group, let $H$ be a connected reductive subgroup of $G$, and let $X$ be a flag variety of $G$. We classify all triples $(G,H,X)$ such that the natural action of $H$ on $X$ is spherical. For each…

Let $G$ be a connected reductive group. In a previous paper, arxiv:1702.08264, is was shown that the dual group $G^\vee_X$ attached to a $G$-variety $X$ admits a natural homomorphism with finite kernel to the Langlands dual group $G^\vee$…

We explicitly construct the C*-algebras arising in the formalism of Topological T-duality due to Mathai and Rosenberg from string-theoretic data in several key examples. We construct a continuous-trace algebra with an action of ${\mathbb…

A graph $G$ is said to be Hamiltonian if it contains a spanning cycle. In this work, we investigate the Hamiltonian completeness of certain classes of caterpillar graphs, which are trees with a central path to which all other vertices are…

Distributive subsets of the group of all invertible continuous binary operations on a topological space are considered, and it is proved that the subgroups generated by them are also distributive. A criterion for the distributivity of a…

A spanning tree of a graph is a connected subgraph on all vertices with the minimum number of edges. The number of spanning trees in a graph $G$ is given by Matrix Tree Theorem in terms of principal minors of Laplacian matrix of $G$. We…

Let $G$ be a finite non-solvable group with solvable radical $Sol(G)$. The solvable graph $\Gamma_s(G)$ of $G$ is a graph with vertex set $G\setminus Sol(G)$ and two distinct vertices $u$ and $v$ are adjacent if and only if $\langle u, v…

Let $G$ and $H$ be acyclic, upward bipolarly oriented plane graphs with the same number $n$ of edges. While $G$ can symbolize a flow network, $H$ has only a controlling role. Let $\phi$ and $\psi$ be bijections from $\{1, \dots, n\}$ to the…

Arboreal networks are a generalization of rooted trees, defined by keeping the tree-like structure, but dropping the requirement for a single root. Just as the class of cographs is precisely the class of undirected graphs that can be…

A $1-$factorization of a complete graph on $2n$ vertices is said to be $G-$regular if it posseses an automorphism group $G$ acting sharply transitively on the vertex-set. The problem of determining which groups can realize such a situation…

Given a bounded valence, bushy tree T, we prove that any cobounded quasi-action of a group G on T is quasiconjugate to an action of G on another bounded valence, bushy tree T'. This theorem has many applications: quasi-isometric rigidity…

In 2022 Kim showed when a graph $G$ is ternary (without induced cycles of length divisible by three), its independence complex $\text{Ind}(G)$ is either contractible or homotopy equivalent to a sphere. In this paper, we show that when…