Related papers: An elliptic topological vertex
We define ramified and split models of elliptic surfaces and study the relation between the two models. We focus on certain rational elliptic surfaces from these points of views and as an application, we give an observation on bitantgent…
Hypergraphs are structures that can be decomposed or described; in other words they are recursively countable. Here, we get exact and asymptotic enumeration results on hypergraphs by means of exponential generating functions. The number of…
The network structure (or topology) of a dynamical network is often unavailable or uncertain. Hence, we consider the problem of network reconstruction. Network reconstruction aims at inferring the topology of a dynamical network using…
We consider the slow and athermal deformations of amorphous solids and show how the ensuing sequence of discrete plastic rearrangements can be mapped onto a directed network. The network topology reveals a set of highly connected regions…
We propose a conceptually novel method of reconstructing the topology of dynamical networks. By examining the correlation between the variable of one node and the derivative of another node, we derive a simple matrix equation yielding the…
Topological data analysis uses tools from topology -- the mathematical area that studies shapes -- to create representations of data. In particular, in persistent homology, one studies one-parameter families of spaces associated with data,…
Persistent homology is a tool that can be employed to summarize the shape of data by quantifying homological features. When the data is an object in $\mathbb{R}^d$, the (augmented) persistent homology transform ((A)PHT) is a family of…
An emerging way to deal with high-dimensional non-euclidean data is to assume that the underlying structure can be captured by a graph. Recently, ideas have begun to emerge related to the analysis of time-varying graph signals. This work…
We provide an algorithm for computing an effective basis of homology of elliptic surfaces over the complex projective line on which integration of periods can be carried out. This allows the heuristic recovery of several algebraic…
We introduce a notion of elliptic differential graded Lie algebra. The class of elliptic algebras contains such examples as the algebra of differential forms with values in endomorphisms of a flat vector bundle over a compact manifold, etc.…
In this paper we propose an elementary topological approach which unifies and extends various different results concerning fixed points and periodic points for maps defined on sets homeomorphic to rectangles embedded in euclidean spaces. We…
A topological graph is a graph drawn in the plane. A topological graph is $k$-plane, $k>0$, if each edge is crossed at most $k$ times. We study the problem of partitioning the edges of a $k$-plane graph such that each partite set forms a…
We propose a non uniform web spline based finite element analysis for elliptic partial differential equation with the gradient type nonlinearity in their principal coefficients like p-laplacian equation and Quasi-Newtonian fluid flow…
Computing the edge expansion of a graph is a famously hard combinatorial problem for which there have been many approximation studies. We present two variants of exact algorithms using semidefinite programming (SDP) to compute this constant…
Topological data analysis leverages topological features to analyze datasets, with applications in diverse fields like medical sciences and biology. A key tool of this theory is the persistence diagram, which encodes topological information…
We use the tropical geometry approach to compute absolute and relative Gromov-Witten invariants of complex surfaces which are $\CC P^1$-bundles over an elliptic curve. We also show that the tropical multiplicity used to count curves can be…
We derive simplified normal forms for an area-preserving map in a neighbourhood of a degenerate resonant elliptic fixed point. Such fixed points appear in generic two-parameter families of area-preserving maps. We also derive a simplified…
We construct algorithms and topological invariants that allow us to distinguish the topological type of a surface, as well as functions and vector fields for their topological equivalence. In the first part (arXiv:2501.15657), we discused…
We present an efficient, trivially parallelizable algorithm to compute offset surfaces of shapes discretized using a dexel data structure. Our algorithm is based on a two-stage sweeping procedure that is simple to implement and efficient,…
A temporal network is a dynamic graph where every edge is assigned an integer time label that indicates at which discrete time step the edge is available. We consider the problem of hierarchically decomposing the network and introduce an…