Related papers: Twisted duality for embedded graphs
We define the action of a locally compact group $G$ on a topological graph $E$. This action induces a natural action of $G$ on the $C^*$-correspondence ${\mathcal H}(E)$ and on the graph $C^*$-algebra $C^*(E)$. If the action is free and…
We introduce the notion of continuous twisted partial actions of a locally compact group on a C*-algebra. With such, we construct an associated C*-algebraic bundle called the semidirect product bundle. Our main theorem shows that, given any…
Let $G$ be a group. The directed endomorphism graph, $\dend(G)$ of $G$ is a directed graph with vertex set $G$ and there is a directed edge from the vertex $a$ to the vertex $b$ if $a \neq b$ and there exists an endomorphism on $G$ mapping…
We introduce partial group algebras with relations in a purely algebraic framework. Given a group and a set of relations, we define an algebraic partial action and prove that the resulting partial skew group ring is isomorphic to the…
We develop the theory of transformation semigroups that have degree 2, that is, act by partial functions on a finite set such that the inverse image of points have at most two elements. We show that the graph of fibers of such an action…
We consider partitioned graphs, by which we mean finite strongly connected directed graphs with a partitioned edge set $ {\mathcal E} ={\mathcal E}^- \cup{\mathcal E}^+$. With additionally given a relation $\mathcal R$ between the edges in…
Given a graph and a representation of its fundamental group, there is a naturally associated twisted adjacency operator. The main result of this article is the fact that these operators behave in a controlled way under graph covering maps.…
We study two classes of inverse semigroups built from directed graphs, namely graph inverse semigroups and a new class of semigroups that we refer to as Leavitt inverse semigroups. These semigroups are closely related to graph…
Graph signal processing uses the graph eigenvector basis to analyze signals. However, these graph eigenvectors are typically linearly ordered (by total variation), which may not be reasonable for many graph structures. There have been…
A graph puzzle ${\rm Puz}(G)$ of a graph $G$ is defined as follows. A configuration of ${\rm Puz}(G)$ is a bijection from the set of vertices of a board graph to the set of vertices of a pebble graph, both graphs being isomorphic to some…
We will show the raitonality of some twisted symmetric group actions.
For a graph G embedded in an orientable surface \Sigma, we consider associated links L(G) in the thickened surface \Sigma \times I. We relate the HOMFLY polynomial of L(G) to the recently defined Bollobas-Riordan polynomial of a ribbon…
We extend to infinite graphs the matroidal characterization of finite graph duality, that two graphs are dual iff they have complementary spanning trees in some common edge set. The naive infinite analogue of this fails. The key in an…
Recently, Gross, Mansour, and Tucker introduced the partial Petrial polynomial, which enumerates all partial Petrials of a ribbon graph by Euler genus. They provided formulas or recursions for various families of ribbon graphs, including…
The notion of travel groupoids was introduced by L. Nebesk\'y in 2006 in connection with a study on geodetic graphs. A travel groupoid is a pair of a set $V$ and a binary operation $*$ on $V$ satisfying two axioms. For a travel groupoid, we…
Let $G$ be a graph and let $S(G)$, $M(G)$, and $T(G)$ be the subdivision, the middle, and the total graph of $G$, respectively. Let ${\rm dim}(G)$, ${\rm edim}(G)$, and ${\rm mdim}(G)$ be the metric dimension, the edge metric dimension, and…
We investigate the electromagnetic duality properties of an abelian gauge theory on a compact oriented four-manifold by analysing the behaviour of a generalised partition function under modular transformations of the dimensionless coupling…
Embedding static graphs in low-dimensional vector spaces plays a key role in network analytics and inference, supporting applications like node classification, link prediction, and graph visualization. However, many real-world networks…
The dominating graph of a graph G is a graph whose vertices correspond to the dominating sets of G and two vertices are adjacent whenever their corresponding dominating sets differ in exactly one vertex. Studying properties of dominating…
Topological T-duality is a transformation taking a gerbe on a principal torus bundle to a gerbe on a principal dual-torus bundle. We give a new geometric construction of T-dualization, which allows the duality to be extended in following…