Related papers: Critical groups of simplicial complexes
We establish an upper bound on the cardinality of a minimal generating set for the fundamental group of a large family of connected, balanced simplicial complexes and, more generally, simplicial posets.
A number of authors have studied the question of when a graph can be represented as a Cayley graph on more than one nonisomorphic group. The work to date has focussed on a few special situations: when the groups are $p$-groups; when the…
We propose various problems about Borel complexity of characterized subgroups of compact abelian groups, inspired by our forthcoming paper \cite{DI3}.
In this talk we introduce several topics in combinatorial number theory which are related to groups; the topics include combinatorial aspects of covers of groups by cosets, and also restricted sumsets and zero-sum problems on abelian…
Let $R_{n}$ denote the graph with vertex set consisting of the squares of an $n \times n$ grid, with two squares of the grid adjacent when they lie in the same row or column. This is the square rook's graph, and can also be thought of as…
Graphs with given k vertices generate an (acyclic) simplicial complex. We describe the homology of its quotient complex, formed by all connected graphs, and demonstrate its applications to the topology of braid groups, knot theory,…
Given a graph $G=(V, E)$, its generalized Laplacian matrix is given by \[ L(G,X_G)_{u,v}= \begin{cases} x_u&\text{if }u=v,\\ -m_{uv}&\text{if }u\neq v, \end{cases} \] where $X_G=\{x_u\, | \, u\in V(G)\}$ is a set of indeterminates and…
The graph Laplacian is a fundamental object in the analysis of and optimization on graphs. This operator can be extended to a simplicial complex $K$ and therefore offers a way to perform ``signal processing" on $p$-(co)chains of $K$.…
Two classes of avalanche-finite matrices and their critical groups (integer cokernels) are studied from the viewpoint of chip-firing/sandpile dynamics, namely, the Cartan matrices of finite root systems and the McKay-Cartan matrices for…
We describe the complete spectra of Laplacian, signless Laplacian, and adjacency matrices associated with the commuting graphs of a finite group using group theoretic information. We provide a method to find the center of a group by only…
Higher-order networks encode the many-body interactions existing in complex systems, such as the brain, protein complexes, and social interactions. Simplicial complexes are higher-order networks that allow a comprehensive investigation of…
The critical ideals of a graph are the determinantal ideals of the generalized Laplacian matrix associated to a graph. In this article we provide a set of minimal forbidden graphs for the set of graphs with at most three trivial critical…
In this paper we describe the fundamental group-scheme of a proper variety fibered over an abelian variety with rationally connected fibers over an algebraically closed field. We use old and recent results for the Nori fundamental…
We show that any action of a finite group on a finitely presentable group arises as the action of the group of self-homotopy equivalences of a space on its fundamental group. In doing so, we prove that any finite connected (abstract)…
The sandpile group of a graph is a well-studied object that combines ideas from algebraic graph theory, group theory, dynamical systems, and statistical physics. A graph's sandpile group is part of a larger algebraic structure on the graph,…
Regular groups and fields are common generalizations of minimal and quasi-minimal groups and fields, so the conjectures that minimal or quasi-minimal fields are algebraically closed have their common generalization to the conjecture that…
We present simple graph-theoretic characterizations of Cayley graphs for left-cancellative monoids, groups, left-quasigroups and quasigroups. We show that these characterizations are effective for the end-regular graphs of finite degree.
We give a classification of maximal elements of the set of finite groups that can be realized as the automorphism groups of polarized abelian threefolds over finite fields.
We introduce and investigate bucolic complexes, a common generalization of systolic complexes and of CAT(0) cubical complexes. They are defined as simply connected prism complexes satisfying some local combinatorial conditions. We study…
In this paper, we prove that the fundamental group of a simplicial complex is isomorphic to the algebraic fundamental group of its incidence algebra, and we derive some applications.