Related papers: Twists and Twistability
Let $G$ be a finite group and $T(G)$ be the sum of the degrees of its irreducible complex representations. We investigate the relationship between $T(G)$ and the number of twisted involutions $m_\sigma = |\{g \in G \mid \sigma(g) =…
We uncover a connection between two seemingly unrelated notions: lettericity, from structural graph theory, and geometric griddability, from the world of permutation patterns. Both of these notions capture important structural properties of…
The primary interest of this paper is to discuss the role of twisting cochains in the theory of characteristic classes. We begin with the homological description of monodromy map, associated with a connection on a trivial bundle over a…
We construct explicitly the symmetries of the isospectral deformations as twists of Lie algebras and demonstrate that they are isometries of the deformed spectral triples.
A map is a connected topological graph cellularly embedded in a surface and a complete map is a cellularly embedded complete graph in a surface. In this paper, all automorphisms of complete maps of order n are determined by permutations on…
A quandle is an algebraic system originated in knot theory, and can be regarded as a generalization of symmetric spaces. The inner automorphism group of a quandle is defined as the group generated by the point symmetries (right…
We define a notion of quantum automorphism group of Graph C*-algebras for finite, connected graphs. Under the assumption that the underlying graph does not have any multiple edge or loop, the quantum automorphism group of underlying…
We introduce a new class of countably infinite random geometric graphs, whose vertices are points in a metric space, and vertices are adjacent independently with probability p if the metric distance between the vertices is below a given…
Digraphs are generalizations of graphs in which each edge is assigned with a direction or two directions. In this paper, we define discrete Morse functions on digraphs, and prove that the homology of the Morse complex and the path homology…
We extend the notion of 'homomorphism-homogeneity' to a wider class of kinds of maps than previously studied, and we investigate the relations between the resulting notions of homomorphism-homogeneity, giving several examples. We also give…
Given an autohomeomorphism on an ordered topological space or its subspace, we show that it is sometimes possible to introduce a new topology-compatible order on that space so that the same map is monotonic with respect to the new ordering.…
Let $\Gamma$ be a finite, undirected, connected, simple graph. We say that a matching $\mathcal{M}$ is a \textit{permutable $m$-matching} if $\mathcal{M}$ contains $m$ edges and the subgroup of $\text{Aut}(\Gamma)$ that fixes the matching…
A countable graph is ultrahomogeneous if every isomorphism between finite induced subgraphs can be extended to an automorphism. Woodrow and Lachlan showed that there are essentially four types of such countably infinite graphs: the random…
The theory of graphons has proven to be a powerful tool in many areas of graph theory. In this paper, we introduce several foundational aspects of the theory of digraphons -- asymmetric two-variable functions that arise as limits of…
Tension-continuous (shortly TT) mappings are mappings between the edge sets of graphs. They generalize graph homomorphisms. From another perspective, tension-continuous mappings are dual to the notion of flow-continuous mappings and the…
The reconfiguration problem for homomorphisms of digraphs to a reflexive digraph cycle, which amounts to deciding if a `reconfiguration graph' is connected, is known to by polynomially time solvable via a greedy algorithm based on certain…
We consider sequences of graphs and define various notions of convergence related to these sequences: ``left convergence'' defined in terms of the densities of homomorphisms from small graphs into the graphs of the sequence, and ``right…
String diagrams are a powerful tool for reasoning about composite structures in symmetric monoidal categories. By representing string diagrams as graphs, equational reasoning can be done automatically by double-pushout rewriting. !-graphs…
The complexity of the list homomorphism problem for signed graphs appears difficult to classify. Existing results focus on special classes of signed graphs, such as trees and reflexive signed graphs. Irreflexive signed graphs are in a…
We characterize connected tetravalent graphs $\Gamma$ which admit groups $M<H$ of automorphisms such that $\Gamma$ is $M$-half-arc-transitive and $H$-arc-transitive. Examples for each case are constructed, including a counter-example to a…