Related papers: The critical group of a combinatorial map
A rational map $f:\widehat{\mathbb{C}}\to\widehat{\mathbb{C}}$ on the Riemann sphere $\widehat{\mathbb{C}}$ is called critically fixed if each critical point of $f$ is fixed under $f$. In this article, we study the properties of a…
We propose a new family of combinatorial inference problems for graphical models. Unlike classical statistical inference where the main interest is point estimation or parameter testing, combinatorial inference aims at testing the global…
A maximal minor $M$ of the Laplacian of an $n$-vertex Eulerian digraph $\Gamma$ gives rise to a finite group $\mathbb{Z}^{n-1}/\mathbb{Z}^{n-1}M$ known as the sandpile (or critical) group $S(\Gamma)$ of $\Gamma$. We determine $S(\Gamma)$ of…
Given a number field K, we consider families of critically separable rational maps of degree d over K possessing a certain fixed-point and multiplier structure. With suitable notions of isomorphism and good reduction between rational maps…
This paper investigates the critical group of a faithful representation of a finite group. It computes the order of the critical group in terms of the character values, and gives some restrictions on its subgroup structure. It also computes…
To any nodal curve $C$ is associated the degree class group, a combinatorial invariant which plays an important role in the compactification of the generalised Jacobian of $C$ and in the construction of the N\'eron model of the Picard…
Critical nets in $\mathbb{R}^k$ (sometimes called geodesic nets) are embedded graph with the property that their embedding is a critical point of the total (edge) length functional and under the constraint that certain 1-valent vertices…
A harmonic cover of graphs $p:\widetilde{X}\to X$ induces a surjective pushforward morphism $p_*:\operatorname{Jac}(\widetilde{X})\to \operatorname{Jac}(X)$ on the critical groups. In the case when $p$ is Galois with abelian Galois group,…
The sandpile group of a connected graph is a finite abelian group whose cardinality is the number of spanning trees in the graph. We compute the spanning tree number and sandpile group structure for the cone over a bi-coconut tree,…
We consider the critical group of a hypothetical Moore graph of diameter $2$ and valency $57$. Determining this group is equivalent to finding the Smith normal form of the Laplacian matrix of such a graph. We show that all of the Sylow…
The majority of graphs whose sandpile groups are known are either regular or simple. We give an explicit formula for a family of non-regular multi-graphs called thick cycles. A thick cycle graph is a cycle where multi-edges are permitted.…
We determine the critical groups of the generalized de Bruijn graphs DB$(n,d)$ and generalized Kautz graphs Kautz$(n,d)$, thus extending and completing earlier results for the classical de Bruijn and Kautz graphs. Moreover, for a prime $p$…
Every graph has a canonical finite abelian group attached to it. This group has appeared in the literature under a variety of names including the sandpile group, critical group, Jacobian group, and Picard group. The construction of this…
We define a class of finite groups based on the properties of the closed twins of their power graphs and study the structure of those groups. As a byproduct, we obtain results about finite groups admitting a partition by cyclic subgroups.
This work introduces the concept of \emph{upper-critical graphs}, in a complementary way of the conventional (lower)critical graphs: an element $x$ of a graph $G$ is called \emph{critical} if $\chi(G-x)<\chi(G)$. It is said that $G$ is a…
We construct combinatorial Hubbard trees for all unicritical polynomials, and for all exponential maps, for which the critical (singular) value does not escape. More precisely, out of an external angle, or more generally a kneading…
Answering a question posed by Adam Epstein, we show that the collection of conjugacy classes of polynomials admitting a parabolic fixed point and at most one infinite critical orbit is a set of bounded height in the relevant moduli space.…
We give a combinatorial classification for the class of postcritically fixed Newton maps of polynomials as dynamical systems. This lays the foundation for classification results of more general classes of Newton maps. A fundamental…
With every matching in a graph we associate a group called the matching group. We study this group using the theory of non-positively curved cubed complexes. Our approach is formulated in terms of so-called gliding systems.
A popular theory of self-organized criticality relates the critical behavior of driven dissipative systems to that of systems with conservation. In particular, this theory predicts that the stationary density of the abelian sandpile model…