Related papers: Algebraic algorithms for vector bundles over curve…
We show that every affine or projective algebraic variety defined over the field of real or complex numbers is homeomorphic to a variety defined over the field of algebraic numbers. We construct such a homeomorphism by choosing a small…
A new method for solving systems of linear algebraic equations of a special type arising in solving problems of image reconstruction has been proposed. This method, due to a certain symmetry of the matrix and the choice of the voxel…
It is known that a vector bundle E on a smooth projective curve Y defined over an algebraically closed field is semistable if and only if there is a vector bundle F on Y such that the cohomologies of E\otimes F vanish. We extend this…
We present a new method for visualizing implicit real algebraic curves inside a bounding box in the $2$-D or $3$-D ambient space based on numerical continuation and critical point methods. The underlying techniques work also for tracing…
This paper describes the vector bundle on the elliptic modular curve that is associated to a vertex operator algebra $V$ (VOA) or more generally a quasi-vertex operator algebra (QVOA), with a view towards future applications aimed at…
In this paper we consider the complex vector spaces of holomorphic cross-sections of homogeneous holomorphic vector bundles over elliptic adjoint orbits, and provide a sufficient condition for the vector spaces to be finite dimensional in…
Recent results by Harrow et. al. and by Ta-Shma, suggest that quantum computers may have an exponential advantage in solving a wealth of linear algebraic problems, over classical algorithms. Building on the quantum intuition of these…
Dedicated treatment of symmetries in satisfiability problems (SAT) is indispensable for solving various classes of instances arising in practice. However, the exploitation of symmetries usually takes a black box approach. Typically,…
We develop an algorithmic theory of convex optimization over discrete sets. Using a combination of algebraic and geometric tools we are able to provide polynomial time algorithms for solving broad classes of convex combinatorial…
Motivated by engineering vector-like (Higgs) pairs in the spectrum of 4d F-theory compactifications, we combine machine learning and algebraic geometry techniques to analyze line bundle cohomologies on families of holomorphic curves. To…
A proper labeling of a graph is an assignment of integers to some elements of a graph, which may be the vertices, the edges, or both of them, such that we obtain a proper vertex coloring via the labeling subject to some conditions. The…
We study flat vector bundles over complex parallelizable manifolds.
The field of numerical algebraic geometry consists of algorithms for numerically solving systems of polynomial equations. When the system is exact, such as having rational coefficients, the solution set is well-defined. However, for a…
Different techniques from machine learning are applied to the problem of computing line bundle cohomologies of (hypersurfaces in) toric varieties. While a naive approach of training a neural network to reproduce the cohomologies fails in…
Let G be a simple and simply connected complex linear algebraic group. In this paper, we discuss the generalization of the parabolic construction of holomorphic principal G-bundles over a smooth elliptic curve to the case of a singular…
These notes survey the theory of (twisted) conformal blocks from an algebro-geometric perspective and have two main goals. The first one is to summarize the construction of conformal blocks from vertex operator algebras, and to describe…
We introduce a new algorithm for computing the periods of a smooth complex projective hypersurface. The algorithm intertwine with a new method for computing an explicit basis of the singular homology of the hypersurface. It is based on…
In this paper we define a pair of faithful functors that map isomorphic and isotopic finite-dimensional algebras over finite fields to isomorphic graphs. These functors reduce the cost of computation that is usually required to determine…
Given an ideal $I$ in a polynomial ring $K[x_1,\dots,x_n]$ over a field $K$, we present a complete algorithm to compute the binomial part of $I$, i.e., the subideal ${\rm Bin}(I)$ of $I$ generated by all monomials and binomials in $I$. This…
In pure integer linear programming it is often desirable to work with polyhedra that are full-dimensional, and it is well known that it is possible to reduce any polyhedron to a full-dimensional one in polynomial time. More precisely, using…