Related papers: Compactified Webs and Domain Wall Partition Functi…
We present a compact matrix formulation of the modularity, a commonly used quality measure for the community division in a network. Using this formulation we calculate the density of modularities, a statistical measure of the probability of…
We develop the technique of weight truncation in the context of wall-crossings in birational cobordisms, parallel to that in [HL15, BFK19]. More precisely, for each such wall-crossing, we embed the bounded above derived category of coherent…
The ALE partition functions of a 6d (1,0) SCFT are interesting observables which are able to detect the global structure of the SCFT. They are defined to be the equivariant partition functions of the SCFT on a background with the topology…
We analyze the space of bivariate functions that are piecewise polynomial of bi-degree \textless{}= (m, m') and of smoothness r along the interior edges of a planar T-mesh. We give new combinatorial lower and upper bounds for the dimension…
This paper gives an exposition of well known results on vector partition functions. The exposition is based on works of M. Brion, A. Szenes and M. Vergne and is geared toward explicit computer realizations. In particular, the paper presents…
We study the partition function associated with the democratic formulation of M-theory, focusing on its global definition and quantum properties. Using a path-integral representation that makes manifest the underlying cohomological…
The conjugate function method is an algorithm for numerical computation of conformal mappings for simply and doubly connected domains. In this paper the conjugate function method is generalized for multiply connected domains. The key…
It is shown that many of the conjectured dualities involving orbifold compactification of M-theory follow from the known dualities involving M-theory and string theory in ten dimensions, and the ansatz that orbifolding procedure commutes…
One-point functions of local operators are studied, at weak and strong coupling, for the ABJM theory in the presence of a 1/2 BPS domain wall. In the underlying quantum spin chain the domain wall is represented by a boundary state which we…
Conformal nets provide a mathematical formalism for conformal field theory. Associated to a conformal net with finite index, we give a construction of the `bundle of conformal blocks', a representation of the mapping class groupoid of…
Graph rigidity theory studies the capability of a graph embedded in the Euclidean space to constrain its global geometric shape via local constraints among nodes and edges, and has been widely exploited in network localization and formation…
We study the localization of a cluster of activated vertices in a graph, from adaptively designed compressive measurements. We propose a hierarchical partitioning of the graph that groups the activated vertices into few partitions, so that…
In this paper, we study the $n$-point function of $t$-core partitions. The main tool is the topological vertex, originally developed to study the topological string theory for toric Calabi--Yau 3-folds. By virtue of the topological vertex,…
We study universality of geometric gauge sectors in the string landscape in the context of F-theory compactifications. A finite time construction algorithm is presented for $\frac43 \times 2.96 \times 10^{755}$ F-theory geometries that are…
An autonomous variational inference algorithm for arbitrary graphical models requires the ability to optimize variational approximations over the space of model parameters as well as over the choice of tractable families used for the…
Calcified plaque in the aorta and pelvic arteries is associated with coronary artery calcification and is a strong predictor of heart attack. Current calcified plaque detection models show poor generalizability to different domains (ie.…
We are interested in multilayer graph clustering, which aims at dividing the graph nodes into categories or communities. To do so, we propose to learn a clustering-friendly embedding of the graph nodes by solving an optimization problem…
In the context of multi-domain network slices, multiple domains need to work together to provide a service. The problem of determining which part of the service fits within which domain is referred to as slice partitioning. The partitioning…
A domain wall structure consists of a planar graph with faces labeled by fusion categories/topological phases. Edges are labeled by bimodules/domain walls. When the vertices are labeled by point defects we get a compound defect. We present…
We define vertex-colourings for edge-partitioned digraphs, which unify the theory of P-partitions and proper vertex-colourings of graphs. We use our vertex-colourings to define generalized chromatic functions, which merge the chromatic…