相关论文: From modular invariants to graphs: the modular spl…

We study partial supersymmetry breaking in effective $\mathcal{N}=2$ U$ \left( 1\right) ^{n}$ gauge theory coupled to complex hypermultiplets by using the method of \textrm{"{\small arXiv:1501.07842}" to which we refer to as ADFT method}.…

Let $k$, $\lambda$ and $\mu$ be positive integers. A decomposition of a multigraph $ \lambda G$ into edge-disjoint subgraphs $G_1, \ldots , G_k$ is said to be \emph{enclosed} by a decomposition of a multigraph $\mu H$ into edge-disjoint…

Presented approach in polynomial time calculates large number of invariants for each vertex, which won't change with graph isomorphism and should fully determine the graph. For example numbers of closed paths of length k for given starting…

We give $\operatorname{CMSO}$-transductions that, given a graph $G$, output its modular decomposition, its split decomposition and its bi-join decomposition. This improves results by Courcelle [Logical Methods in Computer Science, 2006] who…

We consider the extension of classical 2-dimensional topological quantum field theories to Klein topological quantum field theories which allow unorientable surfaces. We approach this using the theory of modular operads by introducing a new…

We study a class of complex polynomial equations on a finite graph with a view to understanding how holistic phenomena emerge from combinatorial structure. Particular solutions arise from orthogonal projections of regular polytopes,…

Let G be a finite simple graph and let indm(G) and ordm(G) denote the induced matching number and the ordered matching number of G, respectively. We characterize all bipartite graphs G with indm(G) = ordm(G). We establish the…

The modular decomposition of a graph is a canonical representation of its modules. Algorithms for computing the modular decomposition of directed and undirected graphs differ significantly, with the undirected case being simpler, and…

The low-energy expansion of closed-string scattering amplitudes at genus one introduces infinite families of non-holomorphic modular forms called modular graph forms. Their differential and number-theoretic properties motivated Brown's…

In this lecture we explain the intimate relationship between modular invariants in conformal field theory and braided subfactors in operator algebras. Our analysis is based on an approach to modular invariants using braided sector induction…

We introduce the partition function of edge-colored graph homomorphisms, of which the usual partition function of graph homomorphisms is a specialization, and present an efficient algorithm to approximate it in a certain domain. Corollaries…

A module of a graph G is a set of vertices that have the same set of neighbours outside. Modules of a graphs form a so-called partitive family and thereby can be represented by a unique tree MD(G), called the modular decomposition tree.…

We investigate efficient learning from higher-order graph convolution and learning directly from adjacency matrices for node classification. We revisit the scaled graph residual network and remove ReLU activation from residual layers and…

In this paper, we introduce a magneto-spectral invariant for finite graphs. This invariant vanishes on trees and is maximized by complete graphs. We compute this invariant for cycles, complete graphs, wheel graphs, hypercubes, complete…

In this paper we discuss reconstruction problems for graphs. We develop some new ideas like isomorphic extension of isomorphic graphs, partitioning of vertex sets into sets of equivalent points, subdeck property, etc. and develop an…

We consider the symmetric difference of two graphs on the same vertex set $[n]$, which is the graph on $[n]$ whose edge set consists of all edges that belong to exactly one of the two graphs. Let $\mathcal{F}$ be a class of graphs, and let…

Consider a finite connected graph denoted as $G=(V, E)$. This study explores a generalized Chern-Simons Higgs model, characterized by the equation: $$ \Delta u = \lambda e^u (e^u - 1)^{2p+1} + f,$$ where $\Delta$ denotes the graph…

Conformal field theories have been extremely useful in our quest to understand physical phenomena in many different branches of physics, starting from condensed matter all the way up to high energy. Here we discuss applications of…

We discuss two simple but useful observations that allow the construction of modular forms from given ones using invariant theory. The first one deals with elliptic modular forms and their derivatives, and generalizes the Rankin-Cohen…

We constrain the spectrum of $\mathcal{N}=(1, 1)$ and $\mathcal{N}=(2, 2)$ superconformal field theories in two-dimensions by requiring the NS-NS sector partition function to be invariant under the $\Gamma_\theta$ congruence subgroup of the…