Related papers: Compactified Webs and Domain Wall Partition Functi…
One of the most useful measures of cluster quality is the modularity of a partition, which measures the difference between the number of the edges joining vertices from the same cluster and the expected number of such edges in a random…
Configurations of vortex-strings stretched between or ending on domain walls were previously found to be 1/4 Bogomol'nyi-Prasad-Sommerfield(BPS) states in N=2 supersymmetric gauge theories in 3+1 dimensions. Among zero modes of string…
We propose a non-perturbative definition for refined topological strings. This can be used to compute the partition function of superconformal theories in 5 dimensions on squashed S^5 and the superconformal index of a large number of 6…
This work introduces ``generalized meshes", a type of meshes suited for the discretization of partial differential equations in non-regular geometries. Generalized meshes extend regular simplicial meshes by allowing for overlapping elements…
The doubled formulation of string theory, which is T-duality covariant and enlarges spacetime with extra coordinates conjugate to winding number, is reformulated and its geometric and topological features examined. It is used to formulate…
We show that an optimized projection functions method can automatically construct maximally localized Wannier functions even for bands with nontrivial topology. We demonstrate this method on a tight-binding model of a two-dimensional…
In this paper we study M-theory compactifications on manifolds of G2 structure. By computing the gravitino mass term in four dimensions we derive the general form for the superpotential which appears in such compactifications and show that…
We consider a simply supported plate with constant thickness, defined on an unknown multiply connected domain. We optimize its shape according to some given performance functional. Our method is of fixed domain type, easy to be implemented,…
We study and extend the duality web unifying different decoupling limits of type II superstring theories and M-theory. We systematically build connections to different corners, such as Matrix theories, nonrelativistic string and M-theory,…
We consider the problem of discretizing one-dimensional, real-valued functions as graphs. The goal is to find a small set of points, from which we can approximate the remaining function values. The method for approximating the unknown…
We propose a flexible and multi-scale method for organizing, visualizing, and understanding datasets sampled from or near stratified spaces. The first part of the algorithm produces a cover tree using adaptive thresholds based on a…
In this thesis, we consider heterotic string vacua based on a warped product of a four-dimensional domain wall and a six-dimensional internal manifold preserving only two supercharges. Thus, they correspond to half-BPS states of heterotic…
We present a family of matrix models such that their partition functions are tau functions of the universal character (UC) hierarchy. This develops one of the topics of our previous paper arXiv:2410.14823. We found new matrix models…
The new era of the Web is known as the semantic Web or the Web of data. The semantic Web depends on ontologies that are seen as one of its pillars. The bigger these ontologies, the greater their exploitation. However, when these ontologies…
In this work we elaborate on a previous result relating the partition function of the six-vertex model with domain-wall boundary conditions to eigenvalues of a transfer matrix. More precisely, we express the aforementioned partition…
Clustering with submodular functions has been of interest over the last few years. Symmetric submodular functions are of particular interest as minimizing them is significantly more efficient and they include many commonly used functions in…
Given a graph $G = (V,E)$ with vertex weights $w(v)$ and a desired number of parts $k$, the goal in graph partitioning problems is to partition the vertex set V into parts $V_1,\ldots,V_k$. Metrics for compactness, contiguity, and balance…
Several algorithms have been proposed to compute partitions of networks into communities that score high on a graph clustering index called modularity. While publications on these algorithms typically contain experimental evaluations to…
In topology optimization, the state of structures is typically obtained by numerically evaluating a discretized PDE-based model. The degrees of freedom of such a model can be partitioned in free and prescribed sets to define the boundary…
The analysis of domain wall dynamics is often simplified to one dimensional physics. For domain walls in thin films, more realistic approaches require the description as two dimensional objects. This includes the study of vortices and…