Related papers: Approximating the parallel transport of an induced…
We introduce the convex bundle method to solve convex, non-smooth optimization problems on Riemannian manifolds of bounded sectional curvature. Each step of our method is based on a model that involves the convex hull of previously…
We further develop the numerical algorithm for computing the gauge connection of slope-stable holomorphic vector bundles on Calabi-Yau manifolds. In particular, recent work on the generalized Donaldson algorithm is extended to bundles with…
This paper proposes a parallel numerical algorithm to simulate the flow and the transport in a discrete fracture network taking into account the mass exchanges with the surrounding matrix. The discretization of the Darcy fluxes is based on…
Complexity of the Operations Research Theory tasks can be often diminished in cases that do not require finding the exact solution. For example, forecasting two-dimensional hierarchical time series leads us to the transportation problem…
We propose a new framework for formulating optimal transport distances between Markov chains. Previously known formulations studied couplings between the entire joint distribution induced by the chains, and derived solutions via a reduction…
We compare the quantisation of linear systems of bosons and fermions. We recall the appearance of projectively flat connection and results on parallel transport in the quantisation of bosons. We then discuss pre-quantisation and…
In this paper, using the Atiyah-Ward equivalence and a theorem of Hitchin, one makes to correspond to certain bundles on the projective space, which are extensions of instanton bundles (in particular, these new bundles may have the first…
In the regime of bounded transportation costs, additive approximations for the optimal transport problem are reduced (rather simply) to relative approximations for positive linear programs, resulting in faster additive approximation…
In this work, we develop a variant of a bundle method in order to find a zero of a maximal monotone operator. This algorithm relies on two polyhedral approximations of the epsilon-enlargement of the considered operator, via a systematic use…
We study the problem of computing a minimum equivalent digraph (also known as the problem of computing a strong transitive reduction) and its maximum objective function variant, with two types of extensions. First, we allow to declare a set…
We give algorithms for geometric graph problems in the modern parallel models inspired by MapReduce. For example, for the Minimum Spanning Tree (MST) problem over a set of points in the two-dimensional space, our algorithm computes a…
We consider a scalar function depending on a numerical solution of an initial value problem, and its second-derivative (Hessian) matrix for the initial value. The need to extract the information of the Hessian or to solve a linear system…
We study the use of machine learning for finding numerical hermitian Yang-Mills connections on line bundles over Calabi-Yau manifolds. Defining an appropriate loss function and focusing on the examples of an elliptic curve, a K3 surface and…
We describe a $\frac{4}{3}$-approximation algorithm for the traveling salesman problem in which the distances between points are induced by graph-theoretical distances in an unweighted graph. The algorithm is based on finding a minimum cost…
We investigate an interplay between some ideas in traditional gauge theory and certain concepts in fibered categories. We accomplish this by introducing a notion of a principal Lie 2-group bundle over a Lie groupoid and studying its…
Deninger and Werner developed an analogue for p-adic curves of the classical correspondence of Narasimhan and Seshadri between stable bundles of degree zero and unitary representations of the topological fundamental group for a complex…
The optimal mass transport problem gives a geometric framework for optimal allocation, and has recently gained significant interest in application areas such as signal processing, image processing, and computer vision. Even though it can be…
On an evolving graph that is continuously updated by a high-velocity stream of edges, how can one efficiently maintain if two vertices are connected? This is the connectivity problem, a fundamental and widely studied problem on graphs. We…
In quantum mechanics, the momentum space and position space wave functions are related by the Fourier transform. We investigate how the Fourier transform arises in the context of geometric quantization. We consider a Hilbert space bundle H…
In this paper, we propose a paradigm for processing in parallel graph joins in road networks. The methodology we present can be used for distance join processing among the elements of two disjoint sets R,S of nodes from the road network,…