Related papers: Holomorphic subgraph reduction of higher-point mod…
Clustering on hypergraphs has been garnering increased attention with potential applications in network analysis, VLSI design and computer vision, among others. In this work, we generalize the framework of modularity maximization for…
Hypergraphs, as a generalization of simplicial complexes, have long been a subject of interest in their geometric interpretation. The subdivision of simplicial complexes can, to some extent, provide insights into the geometry of simplicial…
In this paper, we study classes of discrete convex functions: submodular functions on modular semilattices and L-convex functions on oriented modular graphs. They were introduced by the author in complexity classification of minimum…
When analyzing complex networks a key target is to uncover their modular structure, which means searching for a family of modules, namely node subsets spanning each a subnetwork more densely connected than the average. This work proposes a…
Modular Graph Functions (MGFs) are SL(2,$\mathbb{Z}$)-invariant functions that emerge in the study of the low-energy expansion of the one-loop closed string amplitude. To find the string scattering amplitude, we must integrate MGFs over the…
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 apply the theory of $\alpha$-induction of sectors which we elaborated in our previous paper to several nets of subfactors arising from conformal field theory. The main application are conformal embeddings and orbifold inclusions of SU(n)…
We introduce a formalism to produce several families of spectral sequences involving the derived functors of the limit and colimit functors over a finite partially ordered set. The first type of spectral sequences involves the left derived…
This paper proposes a new algorithm for simultaneous graph matching and clustering. For the first time in the literature, these two problems are solved jointly and synergetically without relying on any training data, which brings advantages…
A new general decomposition theory inspired from modular graph decomposition is presented. This helps unifying modular decomposition on different structures, including (but not restricted to) graphs. Moreover, even in the case of graphs,…
We propose a covariant holographic c-function, defined directly in a top-down background and constructed from the extrinsic curvature of codimension-two slices of the bulk geometry. The definition does not rely on a special choice of…
Holographic displays promise several benefits including high quality 3D imagery, accurate accommodation cues, and compact form-factors. However, holography relies on coherent illumination which can create undesirable speckle noise in the…
Techniques are presented for computing the cohomology of stable, holomorphic vector bundles over elliptically fibered Calabi-Yau threefolds. These cohomology groups explicitly determine the spectrum of the low energy, four-dimensional…
The holomorph of a discrete group $G$ is the universal semi-direct product of $G$. In chapter 1 we describe why it is an interesting object and state main results. In chapter 2 we recall the classical definition of the holomorph as well as…
We present multiscale graph-based reduction algorithms for upscaling heterogeneous and anisotropic diffusion problems. The proposed coarsening approaches begin by constructing a partitioning of the computational domain into a set of…
This monograph is devoted to the theory of vector-valued modular forms for orthogonal groups of signature (2,n). Our purpose is multi-layered: (1) to lay a foundation of the theory of vector-valued orthogonal modular forms; (2) to develop…
We review recent results for heterotic moduli and the Hull--Strominger system. In particular, we discuss mathematical properties of the recently derived deformation operator $\bar D$ associated to the deformation complex of heterotic…
Clustering algorithms for large networks typically use modularity values to test which partitions of the vertex set better represent structure in the data. The modularity of a graph is the maximum modularity of a partition. We consider the…
Let $G=C_{p^n}$ be a finite cyclic p-group, and let $Hol(G)$ denote its holomorph. In this work, we find and characterize the regular subgroups of $Hol(G)$ that are mutually normalizing each other in the permutation group $Sym(G)$. We…
Minimal cellular resolutions of the edge ideals of cointerval hypergraphs are constructed. This class of d-uniform hypergraphs coincides with the complements of interval graphs (for the case d=2), and strictly contains the class of…