English
Related papers

Related papers: On the sandpile group of regular trees

200 papers

Let $K$ be an algebraic number field with ring of integers $\Cal{O}_{K}$, $p>2$ be a rational prime and $G$ be the cyclic group of order $p $. Let $\Lambda$ denote the order $\Cal{O}_{K}[G].$ Let $Cl(\Lambda)$ denote the locally free class…

Number Theory · Mathematics 2007-05-23 Daniel R. Replogle

We explicitly determine all CI-groups with respect to ternary relational structures that have the form $C \times D$, where $C$ is cyclic and $D$ is either a dicyclic group whose order is not divisible by $3$ or a dihedral group. Such groups…

Combinatorics · Mathematics 2026-02-10 Ted Dobson , Joy Morris , Mikhail Muzychuk , Pablo Spiga

In 1869, Jordan proved that the set $\mathcal{T}$ of all finite group that can be represented as the automorphism group of a tree is containing the trivial group and it is closed under taken direct product of groups of lower order in…

Group Theory · Mathematics 2021-04-07 Somayeh Madani , Ali Reza Ashrafi

Let G be a connected reductive complex algebraic group acting on a smooth complete complex algebraic variety X. We assume that X under the action of G is a regular embedding, a condition satisfied in particular by smooth toric varieties and…

Algebraic Geometry · Mathematics 2015-01-20 Guido Pezzini

A subgroup H of G=(Z/dZ)^* is called balanced if every coset of H is evenly distributed between the lower and upper halves of G, i.e., has equal numbers of elements with representatives in (0,d/2) and (d/2,d). This notion has applications…

Number Theory · Mathematics 2012-05-01 Carl Pomerance , Douglas Ulmer

We consider the parametric representation of the amplitudes of Abelian models in the so-called framework of rank $d$ Tensorial Group Field Theory. These models are called Abelian because their fields live on $U(1)^D$. We concentrate on the…

High Energy Physics - Theory · Physics 2016-02-18 Joseph Ben Geloun , Reiko Toriumi

Let $k$ be a field of characteristic $p$, let $P$ be a finite $p$- group, where $p$ is an odd prime, and let $D(P)$ be the Dade group of endo-permutation $kP$-modules. It is known that $D(P)$ is detected via deflation--restriction by the…

Group Theory · Mathematics 2008-08-29 Serge Bouc , Jacques Thévenaz

For a mixing shift of finite type, the associated automorphism group has a rich algebraic structure, and yet we have few criteria to distinguish when two such groups are isomorphic. We introduce a stabilization of the automorphism group,…

Dynamical Systems · Mathematics 2020-01-28 Yair Hartman , Bryna Kra , Scott Schmieding

The (torsion) complexity of a finite signed graph is defined to be the order of the torsion subgroup of the abelian group presented by its Laplacian matrix. When $G$ is $d$-periodic (i.e., $G$ has a free ${\mathbb Z}^d$-action by graph…

Geometric Topology · Mathematics 2020-08-14 Daniel S. Silver , Susan G. Williams

For the Abelian sandpile model on Sierpinski graphs, we investigate several statistics such as average height, height probabilities and looping constant. In particular, we calculate the expected average height of a recurrent sandpile on the…

Probability · Mathematics 2025-02-07 Nico Heizmann , Robin Kaiser , Ecaterina Sava-Huss

We classify all recurrent configurations of the Abelian sandpile model (ASM) on Ferrers graphs. The classification is in terms of decorations of EW-tableaux, which undecorated are in bijection with the minimal recurrent configurations. We…

Combinatorics · Mathematics 2019-06-27 Mark Dukes , Thomas Selig , Jason P. Smith , Einar Steingrimsson

A new family of groups, called trickle groups, is presented. These groups generalize right-angled Artin and Coxeter groups, as well as cactus groups. A trickle group is defined by a presentation with relations of the form $xy = zx$ and…

Group Theory · Mathematics 2024-12-09 Paolo Bellingeri , Eddy Godelle , Luis Paris

Baker and Wang define the so-called Bernardi action of the sandpile group of a ribbon graph on the set of its spanning trees. This potentially depends on a fixed vertex of the graph but it is independent of the base vertex if and only if…

Combinatorics · Mathematics 2024-08-16 Tamás Kálmán , Seunghun Lee , Lilla Tóthmérész

We study various classes of random processes defined on the regular tree $T_d$ that are invariant under the automorphism group of $T_d$. Most important ones are factor of i.i.d. processes (randomized local algorithms), branching Markov…

Probability · Mathematics 2015-07-28 Ágnes Backhausz , Balázs Szegedy

We consider the structure of a finite groups having a normal series whose factors have bicyclic Sylow subgroups. In particular, we investigated groups of odd order and $A_4$-free groups with this property. Exact estimations of the derived…

Group Theory · Mathematics 2009-12-15 V. S. Monakhov , A. A. Trofimuk

Motivated by the appearance of embeddings in the theory of chip firing and the critical group of a graph, we introduce a version of the critical group (or sandpile group) for combinatorial maps, that is, for graphs embedded in orientable…

Combinatorics · Mathematics 2025-03-19 Criel Merino , Iain Moffatt , Steven Noble

Generalizations of Redfield's master theorem and superposition theorem are proved by using decomposition of the tensor product of several induced monomial representations of the symmetric group $S_d$ into transitive constituents. As direct…

Representation Theory · Mathematics 2007-05-23 Valentin Vankov Iliev

Let $G$ denote a finite abelian group with identity 1 and let $S$ denote an inverse-closed subset of $G \setminus {1}$, which generates $G$ and for which there exists $s \in S$, such that $\la S \setminus \{s,s^{-1}\} \ra \ne G$. In this…

Combinatorics · Mathematics 2012-06-01 Stefko Miklavic , Primoz Sparl

A graph $\G$ with a group $H$ of automorphisms acting semiregularly on the vertices with two orbits is called a {\em bi-Cayley graph} over $H$. When $H$ is a normal subgroup of $\Aut(\G)$, we say that $\G$ is {\em normal} with respect to…

Combinatorics · Mathematics 2016-07-15 Jin-Xin Zhou

A $k$-lift of an $n$-vertex base graph $G$ is a graph $H$ on $n\times k$ vertices, where each vertex $v$ of $G$ is replaced by $k$ vertices $v_1,\cdots{},v_k$ and each edge $(u,v)$ in $G$ is replaced by a matching representing a bijection…

Discrete Mathematics · Computer Science 2016-12-20 Naman Agarwal , Karthekeyan Chandrasekaran , Alexandra Kolla , Vivek Madan