Related papers: Critical groups of iterated cones

The abelian sandpile models feature a finite abelian group $G$ generated by the operators corresponding to particle addition at various sites. We study the canonical decomposition of $G$ as a product of cyclic groups $G = Z_{d_1} \times…

In this paper, we introduce the t-graphs defined on finitely-generate groups. We study some general aspects of the t-graphs on 2-generator groups, emphasising establishing necessary conditions for their connectedness. In particular, we…

We study the critical behavior of the dissipative abelian sandpile model on Z with dissipative sites at arbitrary positions (x_k). This is equivalent to studying whether the expected stopping time of a trapped random walk on Z is finite.…

Consider a plane graph G, drawn with straight lines. For every pair a,b of vertices of G, we compare the shortest-path distance between a and b in G (with Euclidean edge lengths) to their actual distance in the plane. The worst-case ratio…

A graph G is 5/2-critical if G has no circular 5/2-coloring (or equivalently, homomorphism to C_5), but every proper subgraph of G has one. We prove that every 5/2-critical graph on n>=4 vertices has at least (5n-2)/4 edges, and list all…

Graph convolutional networks (GCNs) are a widely used method for graph representation learning. To elucidate the capabilities and limitations of GCNs, we investigate their power, as a function of their number of layers, to distinguish…

The {\it prime graph} $\Gamma(G)$ of a finite group $G$ is the graph whose vertex set is the set of prime divisors of $|G|$ and in which two distinct vertices $r$ and $s$ are adjacent if and only if there exists an element of $G$ of order…

Consider a critical random multigraph $\mathcal{G}_n$ with $n$ vertices constructed by the configuration model such that its vertex degrees are independent random variables with the same distribution $\nu$ (criticality means that the second…

In this expository article intended to be accessible to undergraduate students we introduce a finite abelian group that can be associated to any finite connected graph. This group can be defined in an elementary combinatorial way in terms…

We study in detail the profinite group G arising as geometric \'etale iterated monodromy group of an arbitrary quadratic morphism f with an infinite postcritical orbit over a field of characteristic different from two. This is a…

We develop a group graded Morita theory over a G-graded G-acted algebra, where G is a finite group.

Let $G$ be a finite group. A faithful $G$-variety $X$ is called strongly incompressible if every dominant $G$-equivariant rational map of $X$ onto another faithful $G$-variety $Y$ is birational. We settle the problem of existence of…

This paper deals with the classification of groups $G$ such that power graphs and proper power graphs of $G$ are line graphs. In fact, we classify all finite nilpotent groups whose power graphs are line graphs. Also, we categorize all…

An unrefinable chain of a finite group $G$ is a chain of subgroups $G = G_0 > G_1 > \cdots > G_t = 1$, where each $G_i$ is a maximal subgroup of $G_{i-1}$. The length (respectively, depth) of $G$ is the maximal (respectively, minimal)…

The \emph{difference subgroup graph} $D(G)$ of a finite group $G$ is defined as the graph whose vertices are the non-trivial proper subgroups of $G$, with two distinct vertices $H$ and $K$ adjacent if and only if $\langle H, K \rangle = G$…

The prime coprime graph $\Theta(G)$ of a finite group $G$ is the graph whose vertex set is $G$ and any two distinct vertices are adjacent if the greatest common divisor of their orders is either $1$ or a prime. In this paper, we investigate…

We compute the fundamental groups of the complements of the family of real conic-line arrangements with up to two conics which are tangent to each other at two points, with an arbitrary number of tangent lines to both conics. All the…

In this paper we survey a new criteria for solvability of finite groups in terms of number of supersolvable (also known as polycyclic) and non-supersolvable subgroups. In particular, we present original examples of supersolvable groups such…

The non-solvable graph of a finite group G is a simple graph whose vertices are the elements of G and there is an edge between x and y if and only if the subgroup generated by x and y is not solvable. The isolated vertices in the…

Let G be a finite group and S a subset of G\{0}. We call S an additive basis of G if every element of G can be expressed as a sum over a nonempty subset in some order. Let cr(G) be the smallest integer t such that every subset of G\{0} of…