Related papers: Twisted duality for embedded graphs
Twisted links are a generalization of virtual links. As virtual links correspond to abstract links on orientable surfaces, twisted links correspond to abstract links on (possibly non-orientable) surfaces. In this paper, we introduce the…
Edge ideals of finite simple graphs $G$ on $n$ vertices are the ideals $I(G)$ of the polynomial ring $S$ in $n$ variables generated by the quadratic monomials associated with the edges of $G$. In this paper, we consider the possible pairs…
The simplest way to make a dynamical system out of a finite connected graph $G$ is to give it a polarization, that is to say a cyclic ordering of the edges incident to a vertex, for each vertex. The phase space $\mathcal{P}(G)$ then…
Graph embedding techniques are pivotal in real-world machine learning tasks that operate on graph-structured data, such as social recommendation and protein structure modeling. Embeddings are mostly performed on the node level for learning…
Recently, one has seen a surge of interest in developing such methods including ones for learning such representations for (undirected) graphs (while preserving important properties). However, most of the work to date on embedding graphs…
We investigate the structure of conformally rigid graphs. Graphs are conformally rigid if introducing edge weights cannot increase (decrease) the second (last) eigenvalue of the Graph Laplacian. Edge-transitive graphs and distance-regular…
The Temperley-Lieb and Brauer algebras and their cyclotomic analogues, as well as the partition algebra, are all examples of twisted semigroup algebras. We prove a general theorem about the cellularity of twisted semigroup algebras of…
We propose a description of T-duality between general geometric and non-geometric backgrounds as higher groupoid bundles with connections. Our description extends the previous observation by Nikolaus and Waldorf that the topological aspects…
Let $G=(V,E)$ be a multigraph (it has multiple edges, but no loops). The edge connectivity, denoted by $\lambda(G)$, is the cardinality of a minimum edge-cut of $G$. We call $G$ maximally edge-connected if $\lambda(G)=\delta(G)$, and $G$…
We prove the following result: If $G$ be a connected graph on $n \ge 6$ vertices, then there exists a set of vertices $D$ with $|D| \le \frac{n}{3}$ and such that $V(G) \setminus N[D]$ is an independent set, where $N[D]$ is the closed…
Duality symmetries of supergravity theories are powerful tools to restrict the number of possible actions, to link different dimensions and number of supersymmetries and might help to control quantisation. (Hodge-Dirac-)Dualisation of gauge…
Twisted graph diagrams are virtual graph diagrams with bars on edges. A bijection between abstract graph diagrams and twisted graph diagrams is constructed. Then a polynomial invariant of Yamada-type is developed which provides a lower…
We prove that the set of subgroups of the automorphism group of a two-sided full shift is closed under countable graph products. We introduce the notion of a group action without $A$-cancellation (for an abelian group $A$), and show that…
Duality is an indispensable tool for describing the strong-coupling dynamics of gauge theories. However, its actual realization is often quite subtle: quantities such as the partition function can transform covariantly, with degrees of…
We introduce the notion of the action of a group on a labeled graph and the quotient object, also a labeled graph. We define a skew product labeled graph and use it to prove a version of the Gross-Tucker theorem for labeled graphs. We then…
Gross, Mansour, and Tucker [European J. Combin., 95 (2021): 103329] introduced the \emph{partial Petrial polynomial} of a ribbon graph $G$, denoted by $^{\partial}{\varepsilon^{\times}_{G}}(z)$. Beck and Mellor proved, in both orientable…
In one of our previous papers we generalized the Buscher T-dualization procedure. Here we will investigate the application of this procedure to the theory of a bosonic string moving in the weakly curved background. We obtain the complete…
In this paper, we introduce the notion of a dual topological graph of a given topological graph, and show that it defines a C*-algebra isomorphic to the C*-algebra of the given one. Repeating to take a dual, and taking a projective limit,…
We extend the duality between acyclic orientations and totally cyclic orientations on planar graphs to dualities on graphs on orientable surfaces by introducing boundary acyclic orientations and totally bi-walkable orientations. In…
Let $G$ be a finite group, and let $X$ be a smooth, orientable, connected, closed 4-dimensional $G$-manifold. Let $\mathcal{S}$ be a smooth, embedded, $G$-invariant surface in $X$. We introduce the concept of a $G$-equivariant trisection of…