Related papers: On Sum Graphs over Some Magmas
A combinatorial structure, $\mathcal{F}$, with counting sequence $\{a_n\}_{n\ge 0}$ and ordinary generating function $G_\mathcal{F}=\sum_{n\ge0} a_n x^n$, is positive algebraic if $G_\mathcal{F}$ satisfies a polynomial equation…
We show that if $G$ is a group and $G$ has a graph-product decomposition with finitely-generated abelian vertex groups, then $G$ has two canonical decompositions as a graph product of groups: a unique decomposition in which each vertex…
Symmetric homology is an analog of cyclic homology in which the cyclic groups are replaced by symmetric groups. The foundations for the theory of symmetric homology of algebras are developed in the context of crossed simplicial groups using…
Motivated in part by combinatorial applications to certain sum-product phenomena, we introduce unimodular graphs over finite fields and, more generally, over finite valuation rings. We compute the spectrum of the unimodular graphs, by using…
We find a condition on the acylindrical action of a finitely presented group on a simplicial tree which guarantees that this action will be dominated by an acylindrical action with finitely generated edge stabilisers, and find the first…
A Cayley digraph $\Gamma$ over a finite group $G$ is said to be CI if for every Cayley digraph $\Gamma^\prime$ over $G$ isomorphic to $\Gamma$, there is an isomorphism from $\Gamma$ to $\Gamma^\prime$ which is at the same time an…
Let $G$ be a finite group. The \textit{commuting/nilpotent/solvable conjugacy class graph} ($\Gamma_{CCC}(G)$, $\Gamma_{NCC}(G)$, or $\Gamma_{SCC}(G)$) is a simple graph whose vertex set consists of all non-central conjugacy classes of $G$.…
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…
Strongly regular graphs are regular graphs with a constant number of common neighbours between adjacent vertices, and a constant number of common neighbours between non-adjacent vertices. These graphs have been of great interest over the…
This paper opens and discusses the question originally due to Daniel Herden, who asked for which graph $(\mu,R)$ we can find a family $\{\mathbb G_\alpha: \alpha < \mu\}$ of abelian groups such that for each $\alpha,\beta\in\mu$:…
We construct explicity the automorphism group of the folded hypercube $FQ_n$ of dimension $n>3$, as a semidirect product of $N$ by $M$, where $N$ is isomorphic to the Abelian group $Z_2^n$, and $M$ is isomorphic to $Sym(n+1)$, the symmetric…
The pure braid group \Gamma of a quadruply-punctured Riemann sphere acts on the SL(2,C)-moduli M of the representation variety of such sphere. The points in M are classified into \Gamma-orbits. We show that, in this case, the monodromy…
Consider the family of all finite graphs with maximum degree $\Delta(G)<d$ and matching number $\nu(G)<m$. In this paper we give a new proof to obtain the exact upper bound for the number of edges in such graphs and also characterize all…
We develop a practical algorithm to decide whether a finitely generated subgroup of a solvable algebraic group $G$ is arithmetic. This incorporates a procedure to compute a generating set of an arithmetic subgroup of $G$. We also provide a…
A finite abelian group $G$ of cardinality $n$ is said to be of type III if every prime divisor of $n$ is congruent to 1 modulo 3. We obtain a classification theorem for sum-free subsets of largest possible cardinality in a finite abelian…
A perfect code $C$ in a graph $\Gamma$ is an independent set of vertices of $\Gamma$ such that every vertex outside of $C$ is adjacent to a unique vertex in $C$, and a total perfect code $C$ in $\Gamma$ is a set of vertices of $\Gamma$ such…
This paper examines the issues involved with concretely implementing a sum over conifolds in the formulation of Euclidean sums over histories for gravity. The first step in precisely formulating any sum over topological spaces is that one…
In recent work, we developed a method to construct invertible and non-invertible symmetries of finite-group gauge theories as topological domain walls on the lattice. In the present work, we consider abelian and non-abelian finite-group…
A decomposition of a graph is a set of subgraphs whose edges partition those of $G$. The 3-decomposition conjecture posed by Hoffmann-Ostenhof in 2011 states that every connected cubic graph can be decomposed into a spanning tree, a…
Given a finite, simple, vertex-weighted graph, we construct a graded associative (non-commutative) algebra, whose generators correspond to vertices and whose ideal of relations has generators that are graded commutators corresponding to…