Related papers: Twisted duality for embedded graphs
A biased graph consists of a graph $G$ together with a collection of distinguished cycles of $G$, called balanced cycles, with the property that no theta subgraph contains exactly two balanced cycles. Perhaps the most natural biased graphs…
Simple drawings are drawings of graphs in which the edges are Jordan arcs and each pair of edges share at most one point (a proper crossing or a common endpoint). We introduce a special kind of simple drawings that we call generalized…
We study self-similar groupoid actions on arbitrary directed graphs together with $\mathbb{T}$-valued twists that exhaust the second cohomology group of the associated Zappa-Sz\'ep product category. We define and analyse the associated…
We derive a partial electric-magnetic (PEM) duality transformation of the twisted quantum double (TQD) model TQD$(G,\alpha)$---discrete Dijkgraaf-Witten model---with a finite gauge group $G$, which has an Abelian normal subgroup $N$, and a…
We introduce a notion of entropy for automorphisms of discrete groups which admit amenable actions on a compact space. This entropy is dual to classical topological entropy in the sense that if G is discrete and abelian then our notion of…
This paper develops a fundamental theory of realizations of linear and group codes on general graphs using elementary group theory, including basic group duality theory. Principal new and extended results include: normal realization…
The median of a graph $G$ with weighted vertices is the set of all vertices $x$ minimizing the sum of weighted distances from $x$ to the vertices of $G$. For any integer $p\ge 2$, we characterize the graphs in which, with respect to any…
For a given group $G$ the orientably regular maps with orientation-preserving automorphism group $G$ are used as the vertices of a graph $\O(G)$, with undirected and directed edges showing the effect of duality and hole operations on these…
In this article, we introduce the concept of partial actions of a group $G$ on quivers and demonstrate that for any given partial action of G on a quiver $\Gamma$, there exists another quiver, $\Gamma'$ with a full $G$-action. This is an…
We show that Verdier duality for certain sheaves on the moduli spaces of graphs associated to Koszul operads corresponds to Koszul duality of operads. This in particular gives a conceptual explanation of the appearance of graph cohomology…
A graph $\G$ with a group $H$ of automorphisms acting semiregularly on the vertices with two orbits is called a {\em bi-Cayley graph} over $H$. When $H$ is a normal subgroup of $\Aut(\G)$, we say that $\G$ is {\em normal} with respect to…
Associated to a graph $G$ is a set $\mathcal{S}(G)$ of all real-valued symmetric matrices whose off-diagonal entries are nonzero precisely when the corresponding vertices of the graph are adjacent, and the diagonal entries are free to be…
Path and boundary-path groupoids of finitely aligned higher-rank graphs are often constructed using either filters or graph morphisms. We generalise the graph morphism approach to finitely aligned P-graphs where (Q, P) is a weakly…
Graph embedding is a transformation of nodes of a network into a set of vectors. A good embedding should capture the underlying graph topology and structure, node-to-node relationship, and other relevant information about the graph, its…
The commuting graph of a group $G$ is the graph whose vertices are the elements of $G$, two distinct vertices joined if they commute. Our purpose in this paper is twofold: we discuss the computational problem of deciding whether a given…
We study duality-twisted dimensional reductions on a group manifold G, where the twist is in a group \tilde{G} and examine the conditions for consistency. We find that if the duality twist is introduced through a group element \tilde{g} in…
Our purpose is to study the family of simple undirected graphs whose toric ideal is a complete intersection from both an algorithmic and a combinatorial point of view. We obtain a polynomial time algorithm that, given a graph $G$, checks…
We follow up on previous work which found that commonly used graph evolution moves lead to conserved quantities that can be expressed in terms of the braiding of the graph in its embedding space. We study non-embedded graphs under three…
Let $G$ be a cubic graph and $\Pi$ be a polyhedral embedding of this graph. The extended graph, $G^{e},$ of $\Pi$ is the graph whose set of vertices is $V(G^{e})=V(G)$ and whose set of edges $E(G^{e})$ is equal to $E(G) \cup \mathcal{S}$,…
The purpose of this note is to define a graph whose vertex set is a finite group $G$, whose edge set is contained in that of the commuting graph of $G$ and contains the enhanced power graph of $G$. We call this graph the deep commuting…