Related papers: An elliptic topological vertex
So far, a very large amount of work in Natural Language Processing (NLP) rely on trees as the core mathematical structure to represent linguistic informations (e.g. in Chomsky's work). However, some linguistic phenomena do not cope properly…
We show that the elliptic genus of the higher rank E-strings can be computed based solely on the genus 0 Gromov-Witten invariants of the corresponding elliptic geometry. To set up our computation, we study the structure of the topological…
A fundamental problem in studying and modeling economic and financial systems is represented by privacy issues, which put severe limitations on the amount of accessible information. Here we introduce a novel, highly nontrivial method to…
A fundamental characteristic of computer networks is their topological structure. The question of the description of the structural characteristics of computer networks represents a problem that is not completely solved. Search methods for…
The verbose persistent homology transform (VPHT) is a topological summary of shapes in Euclidean space. Assuming general position, the VPHT is injective, meaning shapes can be reconstructed using only the VPHT. In this work, we investigate…
The topological space of the stack of $G$-zips can be computed using a refinement process. We extend this refinement process to a more general framework and show that in many situations this process can be used to compute the equivalence…
A metric graph is a 1-dimensional stratified metric space consisting of vertices and edges or loops glued together. Metric graphs can be naturally used to represent and model data that take the form of noisy filamentary structures, such as…
Multi-dimensional distributions of discrete data that resemble ellipsoids arise in numerous areas of science, statistics, and computational geometry. We describe a complete algebraic algorithm to determine the quadratic form specifying the…
To understand an aperiodic tiling (or a quasicrystal modeled on an aperiodic tiling), we construct a space of similar tilings, on which the group of translations acts naturally. This space is then an (abstract) dynamical system. Dynamical…
We present a topological framework for finding low-flop algorithms for evaluating element stiffness matrices associated with multilinear forms for finite element methods posed over straight-sided affine domains. This framework relies on…
The manuscript considers mathematical models for creating a topological drawing of a graph based on the methods of G. Ringel's vertex rotation theory. An algorithm is presented for generating a topological drawing of a flat part of a graph…
We study fermionic matrix product operator algebras and identify the associated algebraic data. Using this algebraic data we construct fermionic tensor network states in two dimensions that have non-trivial symmetry-protected or intrinsic…
Our main theorem classifies the Auslander-Reiten triangles according to properties of the morphisms involved. As a consequence, we are able to compute the mapping cone of an irreducible morphism. We finish by showing a technique for…
This is the text of my habilitation thesis defended at the \'Ecole Normale Sup\'erieure. The topological string presents an arena in which many features of string theory proper, such as the interplay between worldsheet and target space…
In this paper, we consider a one-dimensional random geometric graph process with the inter-nodal gaps evolving according to an exponential AR(1) process, which may serve as a mobile wireless network model. The transition probability matrix…
In this work, we provide the first practical evaluation of the structural rounding framework for approximation algorithms. Structural rounding works by first editing to a well-structured class, efficiently solving the edited instance, and…
The periodic discrete Toda equation defined over finite fields has been studied. We obtained the finite graph structures constructed by the network of states where edges denote possible time evolutions. We simplify the graphs by introducing…
While the strength of Topological Data Analysis has been explored in many studies on high dimensional numeric data, it is still a challenging task to apply it to text. As the primary goal in topological data analysis is to define and…
The main result of this article is the decomposition of tensor products of representations of SL(2) in the sum of irreducible representations parametrized by outerplanar graphs. An outerplanar graph is a graph with the vertices 0, 1, 2,…
In this paper we present a methodology that allows the efficient computation of the topological derivative for semilinear elliptic problems within the averaged adjoint Lagrangian framework. The generality of our approach should also allow…