Related papers: Approximation of Generating Function Barcode for H…
We construct a generating functional for the exact evalutation of a coherent representation of spin network amplitudes. This generating functional is defined for arbitrary graphs and depends only on a pair of spinors for each edge. The…
Persistent homology is a cornerstone of topological data analysis, offering a multiscale summary of topology with robustness to nuisance transformations, such as rotations and small deformations. Persistent homology has seen broad use…
Let $\{a_\rr : \rr \in (\Z^+)^d \}$ be a $d$-dimensional array of numbers, for which the generating function $F(\zz) := \sum_\rr a_\rr \zz^\rr$ is meromorphic in a neighborhood of the origin. For example, $F$ may be a rational multivariate…
We introduce dicodensity monads: a generalisation of pointwise codensity monads generated by functors to monads generated by mixed-variant bifunctors. Our construction is based on the notion of strong dinaturality (also known as Barr…
Biological and physical systems often exhibit distinct structures at different spatial/temporal scales. Persistent homology is an algebraic tool that provides a mathematical framework for analyzing the multi-scale structures frequently…
We propose to study neural networks' loss surfaces by methods of topological data analysis. We suggest to apply barcodes of Morse complexes to explore topology of loss surfaces. An algorithm for calculations of the loss function's barcodes…
As countless examples show, it can be fruitful to study a sequence of complicated objects all at once via the formalism of generating functions. We apply this point of view to the homology and combinatorics of orbit configuration spaces:…
In this article we introduce a new method for constructing implicit symplectic maps using special symplectic manifolds and Liouvillian forms. This method extends, in a natural way, the method of generating functions to 1-forms which are…
We consider the geometric numerical integration of Hamiltonian systems subject to both equality and "hard" inequality constraints. As in the standard geometric integration setting, we target long-term structure preservation. We…
We detect, by using symplectic topology, invariant measures with large rotation vectors for a class of Hamiltonian flows.
Restricted Boltzmann Machines (RBMs) and models derived from them have been successfully used as basic building blocks in deep artificial neural networks for automatic features extraction, unsupervised weights initialization, but also as…
The persistence barcode is a topological descriptor of data that plays a fundamental role in topological data analysis. Given a filtration of the space of data, a persistence barcode tracks the evolution of its homological features. In this…
Area and orientation preserving diffeomorphisms of the standard 2-disc, referred to as symplectomorphisms of $\mathbb{D}^{2}$, allow decompositions in terms of positive twist diffeomorphisms. Using the latter decomposition we utilize the…
We investigate topological invariants in strongly interacting many-body systems within holographic mean-field theory (H-MFT) framework. Analytic expressions for retarded Green's functions are obtained for all possible fermionic bilinear…
In this paper, we construct an invariant for irreducible holomorphic symplectic manifolds of $K3^{[2]}$-type with antisymplectic involution by using the equivariant analytic torsion. Moreover, we give a formula for the complex Hessian of…
Given a closed orientable surface (\Sigma) of genus at least two, we establish an affine isomorphism between the convex compact set of isotopy-invariant topological measures on (\Sigma) and the convex compact set of additive functions on…
In this paper, we systematically construct two classes of structure-preserving schemes with arbitrary order of accuracy for canonical Hamiltonian systems. The one class is the symplectic scheme, which contains two new families of…
We present an algorithm which can generate all pairwise non-isomorphic $K_2$-hypohamiltonian graphs, i.e. non-hamiltonian graphs in which the removal of any pair of adjacent vertices yields a hamiltonian graph, of a given order. We…
We present a combinatorial characterization of the Bethe entropy function of a factor graph, such a characterization being in contrast to the original, analytical, definition of this function. We achieve this combinatorial characterization…
In this note, we reformulate Donaldson's construction as a compactness result. Approximately holomorphic sections accumulate to "limit holomorphic sections" and uniform transversality properties of the approximately holomorphic sections…