Related papers: Critical groups of simplicial complexes
We obtain a complete classification of graph products of finite abelian groups whose Cayley graphs with respect to the standard presentations are planar.
We give a new explicit construction for the simplicial group $K(A,n)$. We explain the topological interpretation and discuss some possible applications.
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…
We generalize cellular sheaf Laplacians on an ordered finite abstract simplicial complex to the set of simplices of a symmetric simplicial set. We construct a functor from the category of hypergraphs to the category of finite symmetric…
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…
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…
The \textbf{Co-Prime Order Graph} $\Theta (G)$ of a given finite group is a simple undirected graph whose vertex set is the group $G$ itself, and any two vertexes x,y in $\Theta (G)$ are adjacent if and only if $gcd(o(x),o(y))=1$ or prime.…
We show how the framework of crossed simplicial groups may be used to provide a classification of topological field theories on open cobordism categories defined by reductions of the structure group to a planar Lie group. Such theories are…
In this paper we introduce the concept of a Cayley graph automatic group (CGA group or graph automatic group, for short) which generalizes the standard notion of an automatic group. Like the usual automatic groups graph automatic ones enjoy…
We extend fundamental results of small cancellation theory to groups whose presentations satisfy the generalizations of the classical C(6) and C(7) conditions in graphical small cancellation theory. Using these graphical small cancellation…
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.
We study Laplacians on general countable weighted simplicial complexes from a conceptual point of view. These operators will first be introduced formally before showing that those formal operators coincide with self-adjoint realizations of…
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$…
Simplicial complexes constitute the underlying topology of interacting complex systems including among the others brain and social interaction networks. They are generalized network structures that allow to go beyond the framework of…
Simplicial complexes are a popular tool used to model higher-order interactions between elements of complex social and biological systems. In this paper, we study some combinatorial aspects of a class of simplicial complexes created by a…
The \emph{critical} group of a finite connected graph is an abelian group defined by the Smith normal form of its Laplacian. Let $q$ be a power of a prime and $H$ be a multiplicative subgroup of $K=\mathbb{F}_{q}$. By $\mathrm{Cay}(K,H)$ we…
In this paper we discuss large cardinals and compactness theorems in abelian group theory. More specifically, we generalize two classical compactness results for free abelian groups to the broader context of direct sums of cyclic groups.
Network topology is a flourishing interdisciplinary subject that is relevant for different disciplines including quantum gravity and brain research. The discrete topological objects that are investigated in network topology are simplicial…
In this paper we consider the critical group of finite connected graphs which admit harmonic actions by the dihedral group $D_n$. In particular, we show that if the orbits of the $D_n$-action all have either $n$ or $2n$ points then the…
The theorem of the title is deduced from the equivalence between crossed complexes and cubical $\omega$-groupoids with connections proved by the authors in 1981. In fact we prove the equivalence of five categories defined internally to an…