Related papers: Sandpile groups for cones over trees

We construct non-isogenous simple ordinary abelian varieties over an algebraic closure of a finite field with isomorphic endomorphism algebras.

We investigate a family of groups acting on a regular tree, defined by prescribing the local action almost everywhere. We study lattices in these groups and give examples of compactly generated simple groups of finite asymptotic dimension…

Consider an infinite tree. A hierarchomorphism (spheromorphism) is a homeomorphism of the absolute which can be extended to the tree except a finite subtree. Examples of groups of hierarchomorphisms: groups of locally analitic…

Although the phenomenon of chirality appears in many investigations of maps and hypermaps no detailed study of chirality seems to have been carried out. Chirality of maps and hypermaps is not merely a binary invariant but can be quantified…

We show that all permutations in $S_n$ can be generated by affine unicritical polynomials. We use the $\operatorname{PGL}$ group structure to compute the cycle structure of permutations with low Carlitz rank. The tree structure of the group…

Closed subgroups of the group of isometries of the regular tree $\treeq$ that fix an end of the tree and are vertex-transitive are shown to correspond, on one hand, to self-replicating groups acting on rooted trees and, on the other hand,…

We investigate the possible structures imposed on a finite group by its possession of an automorphism sending a large fraction of the group elements to their cubes, the philosophy being that this should force the group to be, in some sense,…

Let $G$ be a finite group, $n$ a positive integer. $\pi(n)$ denotes the set of all prime divisors of $n$ and $\pi(G)=\pi(|G|)$. The prime graph $\Gamma(G)$ of $G$, defined by Grenberg and Kegel, is a graph whose vertex set is $\pi(G)$, two…

Let $G$ be a finite insoluble group with soluble radical $ R(G)$. The solubility graph $\Gamma_{\rm S}(G)$ of $G$ is a simple graph whose vertices are the elements of $G\setminus R(G) $ and two distinct vertices $x$ and $y$ are adjacent if…

We use techniques from the theory of electrical networks to give nearly tight bounds for the transience class of the Abelian sandpile model on the two-dimensional grid up to polylogarithmic factors. The Abelian sandpile model is a discrete…

We explicitly determine the automorphism groups of all self-similar trees (a.k.a. trees with finitely many cone types). We show that any such automorphism group is a direct limit of certain finite products of finite symmetric groups, which…

The power graph $\mathcal{P}(G)$ of a finite group $G$ is the graph whose vertex set is $G$, and two elements in $G$ are adjacent if one of them is a power of the other. The purpose of this paper is twofold. First, we find the complexity of…

A finite group is called $\psi$-divisible iff $\psi(H)|\psi(G)$ for any subgroup $H$ of a finite group $G$. Here, $\psi(G)$ is the sum of element orders of $G$. For now, the only known examples of such groups are the cyclic ones of…

A dimension group is an ordered abelian group that is an inductive limit of a sequence of simplicial groups, and a stationary dimension group is such an inductive limit in which the homomorphism is the same at every stage. If a simple…

Traditional clustering identifies groups of objects that share certain qualities. Tangles do the converse: they identify groups of qualities that often occur together. They can thereby discover, relate, and structure types: of behaviour,…

The abelian sandpile serves as a model to study self-organized criticality, a phenomenon occurring in biological, physical and social processes. The identity of the abelian group is a fractal composed of self-similar patches, and its limit…

We introduce a tiling problem between bounded open convex polyforms $\hat{P}\subset\mathbb{R}^2$ with directed and uniquely colored edges. If there exists a tiling of the polyform $\hat{P}_2$ by $\hat{P}_1$, we show that one can construct a…

We give a new simple construction of the sandpile measure on an infinite graph G, under the sole assumption that each tree in the Wired Uniform Spanning Forest on G has one end almost surely. For, the so called, generalized minimal…

A constant spinal group is a subgroup of the automorphism group of a regular rooted tree, generated by a group of rooted automorphisms $A$ and a group of directed automorphisms $B$ whose action on a subtree is equal to the global action. We…

We consider certain groups of tree automorphisms as so-called diffeological groups. The notion of diffeology, due to Souriau, allows to endow non-manifold topological spaces, such as regular trees that we look at, with a kind of a…