Related papers: Wang Algebra: From Theory to Practice
The connections in many networks are not merely binary entities, either present or not, but have associated weights that record their strengths relative to one another. Recent studies of networks have, by and large, steered clear of such…
In this paper, we use the twisted regular representation theory of vertex operator algebras to construct bimodules over twisted Zhu algebras, extending Haisheng Li's work in untwisted scenarios. Moreover, a conjecture of Dong and Jiang on…
Graph Neural Networks (GNNs) have emerged as a dominant paradigm for graph classification. Specifically, most existing GNNs mainly rely on the message passing strategy between neighbor nodes, where the expressivity is limited by the…
Due to mutual interference between users, power allocation problems in wireless networks are often non-convex and computationally challenging. Graph neural networks (GNNs) have recently emerged as a promising approach to tackling these…
With the aim of completing the previous study by A. Or{\l}owski and the author concerning intertwining maps between induced representations and conjugation representation, termed here weighted class operators, we compute the latter…
The theory of random graphs goes back to the late 1950s when Paul Erd\H{o}s and Alfr\'ed R\'enyi introduced the Erd\H{o}s-R\'enyi random graph. Since then many models have been developed, and the study of random graph models has become…
Several years ago, it was proposed that the usual solutions of the Yang-Baxter equation associated to Lie groups can be deduced in a systematic way from four-dimensional gauge theory. In the present paper, we extend this picture, fill in…
We quantize pure 2d Yang-Mills theory on an arbitrary Riemann surface in the gauge where the field strength is diagonal. Twisted sectors originate, as in Matrix string theory, from permutations of the eigenvalues around homotopically…
Many complex networks in natural and social phenomena have often been characterized by heavy-tailed degree distributions. However, due to rapidly growing size of network data and concerns on privacy issues about using these data, it becomes…
A fundamental and challenging problem in spectral graph theory is to characterize which graphs are uniquely determined by their spectra. In Wang [J. Combin. Theory, Ser. B, 122 (2017): 438-451], the author proved that an $n$-vertex graph…
Graph theory is a branch of mathematics in which pair-wise relations between objects are studied. My PhD thesis, supervised by David R. Wood, introduces and investigates a new family of graphs, called link graphs, that generalises the…
The extended W-algebra of type sl_2 at positive rational level, denoted by M_{p_+,p_-}, is a vertex operator algebra that was originally proposed in [1]. This vertex operator algebra is an extension of the minimal model vertex operator…
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…
The introduction of relevant physical information into neural network architectures has become a widely used and successful strategy for improving their performance. In lattice gauge theories, such information can be identified with gauge…
We define an integral form of the deformed W-algebra of type gl_r, and construct its action on the K-theory groups of moduli spaces of rank r stable sheaves on a smooth projective surface S, under certain assumptions. Our construction…
We reimplement here the recent approach of Adam Zsolt Wagner [arXiv:2104.14516], which applies reinforcement learning to construct (counter)examples in graph theory, in order to make it more readable, more stable and much faster. The…
Gabor analysis which can be traced back to Dennis Gabor's influential 1946 paper \emph{Theory of communication}, is concerned with both the theory and the applications of the approximation properties of sets of time and frequency shifts of…
The generalized $k$-connectivity $\kappa_k(G)$ of a graph $G$ was introduced by Hager before 1985. As its a natural counterpart, we introduced the concept of generalized edge-connectivity $\lambda_k(G)$, recently. In this paper we summarize…
Spin networks, essentially labeled graphs, are ``good quantum numbers'' for the quantum theory of geometry. These structures encompass a diverse range of techniques which may be used in the quantum mechanics of finite dimensional systems,…
A simple method for breaking gauge groups by orbifolding is presented. We extend the method of Kac and Peterson to include Wilson lines. The complete classification of the gauge group breaking, e.g. from heterotic string, is now possible.…