Related papers: Chip-Firing Games and Critical Groups

In this paper, we introduce a new function related to the sum of element orders of finite groups. It is used to give some criteria for a finite group to be cyclic, abelian, nilpotent, supersolvable and solvable, respectively.

The critical group of a graph is a finite abelian group whose order is the number of spanning forests of the graph. For a graph G with a certain reflective symmetry, we generalize a result of Ciucu-Yan-Zhang factorizing the spanning tree…

We study chip-firing on a signed graph $G_\phi$, employing a general theory of chip-firing on invertible matrices introduced by Guzm\'an and Klivans. Here a negative edge designates an adversarial relationship, so that firing a vertex…

This article continues a prior investigation of the authors with the goal of extending characterization results of convolutional tight frames from the context of cyclic groups to general finite abelian groups. The collections studied are…

In this paper, firstly, we provide some necessary and sufficient conditions for generalized Cayley graphs on abelian groups to be bipartite. Secondly, we deduce several necessary and sufficient conditions for generalized Cayley graphs on…

The power graph of a group $G$ is a simple and undirected graph with vertex set $G$ and two distinct vertices are adjacent if one is a power of the other. In this article, we characterize (non-cyclic) finite groups of prime exponent and…

A subgroup $H$ of a group $G$ is said to be an $IC\Phi$-subgroup of $G$ if $H \cap [H,G] \le \Phi(H)$. We analyze the structure of a finite group $G$ under the assumption that some given subgroups of $G$ are $IC\Phi$-subgroups of $G$. A new…

In these notes we will survey recent results on various finitary approximation properties of infinite groups. We will discuss various restrictions on groups that are approximated for example by finite solvable groups or finite-dimensional…

By an $\ell$-group $G$ we mean a lattice-ordered abelian group. This paper is concerned with the category $\FP$ of finitely presented {\it unital} $\ell$-groups, those $\ell$-groups having a distinguished order-unit $u$. Using the duality…

We study a class of finite groups $G$ which behave similarly to elementary abelian $p$-groups with $p$ prime, that is, there exists a subgroup $N$ such that all elements of $G\setminus N$ are conjugate or inverse-conjugate under $\Aut(G)$.…

We characterize the fundamental group of a locally finite graph G with ends combinatorially, as a group of infinite words. Our characterization gives rise to a canonical embedding of this group in the inverse limit of the (free) fundamental…

This is an introduction to the finite groups, with focus on the groups of permutations and reflections, and more generally, on the finite groups of unitary matrices. We first discuss the basics of group theory, featuring the cyclic,…

In this paper we study the description of the functional graphs associated with the power maps over finite groups. We present a structural result which describes the isomorphism class of these graphs for abelian groups and also for flower…

We present an exposition of our ongoing project in a new area of applicable mathematics: practical computation with finitely generated linear groups over infinite fields. Methodology and algorithms available for practical computation in…

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,…

Many open conjectures in the representation theory of finite groups can be studied by reducing them to related questions about quasi-simple groups. In such studies, $p$-radical subgroups typically play a critical role. To classify the…

This paper develops some general results about actions of finite groups on (infinite) abelian groups in the finite Morley rank category. They are linked to a range of problems on groups of finite Morley rank discussed in [16]. Crucially,…

There are various results in the literature which are part of the general philosophy that a finite group for which a certain parameter (for example, the number of conjugacy classes or the maximum number of elements inverted, squared or…

A group G is a cn-group if for each subgroup H of G there exists a normal subgroup N of G such that the index of both H and N in HN is finite. The class of cn-groups contains properly the classes of core- finite groups and that of groups in…

This paper describes a quantum algorithm for efficiently decomposing finite Abelian groups. Such a decomposition is needed in order to apply the Abelian hidden subgroup algorithm. Such a decomposition (assuming the Generalized Riemann…