相关论文: Dual equivalence graphs II: Transformations on loc…
Two signed graphs are called switching isomorphic if one of them is isomorphic to a switching equivalent of the other. To determine the number of switching non-isomorphic signed graphs on a specific graph, we will establish a method based…
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…
An analogue of the Schur-Weyl duality for the group of automorphisms of the approximately finite dimensional (AFD) ${\rm II}_1$-factor is produced. Keywords: AFD ${\rm II}_1$-factor, automorphisms group of factor, Schur-Weyl duality.
Motivated by the connection between 4-manifolds and 2d N=(0,2) theories, we study the dynamics of a fairly large class of 2d N=(0,2) gauge theories. We see that physics of such theories is very rich, much as the physics of 4d N=1 theories.…
Originating from spectral graph theory, cospectrality is a powerful generalization of exchange symmetry and can be applied to all real-valued symmetric matrices. Two vertices of an undirected graph with real edge weights are cospectral iff…
Graph neural networks (GNNs) are commonly described as being permutation equivariant with respect to node relabeling in the graph. This symmetry of GNNs is often compared to the translation equivariance of Euclidean convolution neural…
The degree matrix of a graph is the diagonal matrix with diagonal entries equal to the degrees of the vertices of $X$. If $X_1$ and $X_2$ are graphs with respective adjacency matrices $A_1$ and $A_2$ and degree matrices $D_1$ and $D_2$, we…
We study the complexity of the Graph Isomorphism problem on graph classes that are characterized by a finite number of forbidden induced subgraphs, focusing mostly on the case of two forbidden subgraphs. We show hardness results and develop…
We define an equivalence relation on integer compositions and show that two ribbon Schur functions are identical if and only if their defining compositions are equivalent in this sense. This equivalence is completely determined by means of…
We consider multivariate two-sample tests of means, where the location shift between the two populations is expected to be related to a known graph structure. An important application of such tests is the detection of differentially…
We define graph products of families of pairs of groups and study the question when two such graph products are commensurable. As an application we prove linearity of certain graph products.
A graph $H$ is \emph{common} if the number of monochromatic copies of $H$ in a 2-edge-colouring of the complete graph $K_n$ is asymptotically minimised by the random colouring, or equivalently, $t_H(W)+t_H(1-W)\geq 2^{1-e(H)}$ holds for…
We introduce a diagramatic notation for supersymmetric gauge theories. The notation is a tool for exploring duality and helps to present the field content of more complicated models in a simple visual way. We introduce the notation with a…
A graph with a semiregular group of automorphisms can be thought of as the derived cover arising from a voltage graph. Since its inception, the theory of voltage graphs and their derived covers has been a powerful tool used in the study of…
Homomorphically full graphs are those for which every homomorphic image is isomorphic to a subgraph. We extend the definition of homomorphically full to oriented graphs in two different ways. For the first of these, we show that…
Reiner, Shaw and van Willigenburg showed that if two skew Schur functions s_A and s_B are equal, then the skew shapes A and B must have the same "row overlap partitions." Here we show that these row overlap equalities are also implied by a…
Quantum graphs and their experimental counterparts, microwave networks, are ideally suited to study the spectral statistics of chaotic systems. The graph spectrum is obtained from the zeros of a secular determinant derived from energy and…
We explore the connections between the linear algebra of symmetric matrices over GF(2) and the circuit theory of 4-regular graphs. In particular, we show that the equivalence relation on simple graphs generated by local complementation can…
We introduce and study a generalization $s_{(\mu|\lambda)}$ of the Schur functions called the almost symmetric Schur functions. These functions simultaneously generalize the finite variable key polynomials and the infinite variable Schur…
We describe how the chromatic symmetric function of two graphs glued at a single vertex can be expressed as a matrix multiplication using certain information of the two individual graphs. We then prove new $e$-positivity results by using a…