Related papers: Algebraic algorithms for vector bundles over curve…
Let us be given two graphs $\Gamma_1$, $\Gamma_2$ of $n$ vertices. Are they isomorphic? If they are, the set of isomorphisms from $\Gamma_1$ to $\Gamma_2$ can be identified with a coset $H\cdot\pi$ inside the symmetric group on $n$…
We consider efficient route planning for robots in applications such as infrastructure inspection and automated surgical imaging. These tasks can be modeled via the combinatorial problem Graph Inspection. The best known algorithms for this…
This paper is a survey on universal algorithms for solving the matrix Bellman equations over semirings and especially tropical and idempotent semirings. However, original algorithms are also presented. Some applications and software…
The design and implementation of parallel algorithms is a fundamental task in computer algebra. Combining the computer algebra system Singular and the workflow management system GPI-Space, we have developed an infrastructure for massively…
An isogeny between elliptic curves is an algebraic morphism which is a group homomorphism. Many applications in cryptography require evaluating large degree isogenies between elliptic curves efficiently. For ordinary curves of the same…
Geometric Invariant Theory gives a method for constructing quotients for group actions on algebraic varieties which in many cases appear as moduli spaces parametrizing isomorphism classes of geometric objects (vector bundles, polarized…
We present the algebraic representation and basic algorithms for MultiAspect Graphs (MAGs). A MAG is a structure capable of representing multilayer and time-varying networks, as well as higher-order networks, while also having the property…
We consider several subgroup-related algorithmic questions in groups, modeled after the classic computational lattice problems, and study their computational complexity. We find polynomial time solutions to problems like finding a subgroup…
Given a geometrically irreducible smooth projective curve of genus 1 defined over the field of real numbers, and a pair of integers r and d, we determine the isomorphism class of the moduli space of semi-stable vector bundles of rank r and…
We introduce several families of filtrations on the space of vector bundles over a smooth projective variety. These filtrations are defined using the large k asymptotics of the kernel of the Dolbeault Dirac operator on a bundle twisted by…
We present a geometric interpretation of the integration-by-parts formula on an arbitrary vector bundle. As an application we give a new geometric formulation of higher-order variational calculus.
In 1957 Atiyah classified simple and indecomposable vector bundles on an elliptic curve. In this article we generalize his classification by describing the simple vector bundles on all reduced plane cubic curves. Our main result states that…
We develop a ready-to-use comprehensive theory for (super) 2-vector bundles over smooth manifolds. It is based on the bicategory of (super) algebras, bimodules, and intertwiners as a model for 2-vector spaces. We discuss symmetric monoidal…
Hyperbolic programming is the problem of computing the infimum of a linear function when restricted to the hyperbolicity cone of a hyperbolic polynomial, a generalization of semidefinite programming. We propose an approach based on symbolic…
We provide unipotent factorizations of vector bundle automorphisms of real and complex vector bundles over smooth manifolds. This generalises work of Thurston-Wasserstein and Wasserstein for trivial vector bundles. We also address two…
The lower and upper bound of any given algorithm is one of the most crucial pieces of information needed when evaluating the computational effectiveness for said algorithm. Here a novel method of Boolean Algebraic Programming for symbolic…
In the present paper we develop a framework in which questions of quantum ergodicity for operators acting on sections of hermitian vector bundles over Riemannian manifolds can be studied. We are particularly interested in the case of…
We study the splitting properties of the Verlinde bundles over elliptic curves. Our methods rely on the explicit description of the moduli space of semistable vector bundles on elliptic curves, and on the analysis of the symmetric powers of…
Partitioning and grouping of similar objects plays a fundamental role in image segmentation and in clustering problems. In such problems a typical goal is to group together similar objects, or pixels in the case of image processing. At the…
We describe polynomial time algorithms for determining whether an undirected graph may be embedded in a distance-preserving way into the hexagonal tiling of the plane, the diamond structure in three dimensions, or analogous structures in…