Related papers: Algebraic algorithms for vector bundles over curve…
The arithmetic of elliptic curves, namely polynomial addition and scalar multiplication, can be described in terms of global sections of line bundles on $E\times E$ and $E$, respectively, with respect to a given projective embedding of $E$…
Algebraic-geometric codes can be constructed by evaluating a certain set of functions on a set of distinct rational points of an algebraic curve. The set of functions that are evaluated is the linear space of a given divisor or,…
We develop a semistability algorithm for vector bundles which are given as a kernel of a surjective morphism between splitting bundles on the projective space over an algebraically closed field K. This class of bundles is a generalization…
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 report on implementations for algorithms treating algebraic and arithmetic properties of hypergeometric functions in the computer algebra system SageMath. We treat hypergeometric series over the rational numbers, over finite fields, and…
This paper gives various methods for constructing vector bundles over elliptic curves and more generally over families of elliptic curves. We construct universal families over generalized elliptic curves via spectral cover methods and also…
We present novel, deterministic, efficient algorithms to compute the symmetries of a planar algebraic curve, implicitly defined, and to check whether or not two given implicit planar algebraic curves are similar, i.e. equal up to a…
We use an embedding of the symmetric $d$th power of any algebraic curve $C$ of genus $g$ into a Grassmannian space to give algorithms for working with divisors on $C$, using only linear algebra in vector spaces of dimension $O(g)$, and…
Let K be an algebraic number field of degree d and discriminant D over Q. Let A be an associative algebra over K given by structure constants such that A is isomorphic to the algebra M_n(K) of n by n matrices over K for some positive…
We introduce the concept of a higher algebroid, generalizing the notions of an algebroid and a higher tangent bundle. Our ideas are based on a description of (Lie) algebroids as vector bundle comorphisms - differential relations of a…
We construct examples of non-isomorphic algebraic vector bundles on the punctured affine space with isomorphic pullbacks to the smooth quadric.
We identify and study a matrix algebra consisting of Pascal-type matrices. The generator of the matrix algebra is shown to well define a canonical bundle map, called the Pascal map on jet bundles, and we use it to give an intrinsic…
We present an algorithm to solve a system of diagonal polynomial equations over finite fields when the number of variables is greater than some fixed polynomial of the number of equations whose degree depends only on the degree of the…
We present a new algorithm to decide isomorphism between finite graded algebras. For a broad class of nilpotent Lie algebras, we demonstrate that it runs in time polynomial in the order of the input algebras. We introduce heuristics that…
Every real hyperbolic form in three variables can be realized as the determinant of a linear net of Hermitian matrices containing a positive definite matrix. Such representations are an algebraic certificate for the hyperbolicity of the…
We describe a polynomial complexity algorithm for reducing transition matrices, for vector bundles glued along a clutching-type cover of a real anisotropic conic, to canonical block diagonal forms. This is a generalization, to the real…
We present a geometric algorithm for obtaining consistent solutions to systems of partial differential equations, mainly arising from singular covariant first-order classical field theories. This algorithm gives an intrinsic description of…
We give normal forms of determinantal representations of a smooth projective plane cubic in terms of Moore matrices. Building on this, we exhibit matrix factorizations for all indecomposable vector bundles of rank 2 and degree 0 without…
Censor-Hillel et al. [PODC'15] recently showed how to efficiently implement centralized algebraic algorithms for matrix multiplication in the congested clique model, a model of distributed computing that has received increasing attention in…
Using techniques of A^1-homotopy theory, we produce motivic lifts of elements in classical homotopy groups of spheres; these lifts provide polynomial maps of spheres and allow us to construct ``low rank'' algebraic vector bundles on…