Related papers: An algorithm for the normal bundle of rational mon…
In this paper we present an algorithm to compute the (real and complex) straight lines contained in a rational surface, defined by a rational parameterization. The algorithm relies on the well-known theorem of Differential Geometry that…
It is known that a graph isomorphism testing algorithm is polynomially equivalent to a detecting of a graph non-trivial automorphism algorithm. The polynomiality of the latter algorithm, is obtained by consideration of symmetry properties…
Partitioning sparse matrices and graphs is a common and important problem in many scientific and graph analytics applications. In this work, we are concerned with a spatial partitioning called rectilinear partitioning (also known as…
Consider the scheme parametrizing non-constant morphisms from a fixed projective curve to a projective surface. There is a rational map between this scheme and the Chow variety of $1$-cycles on the surface. We prove that, if the curve is…
We give algorithms of computing bases of logarithmic cohomology groups for square-free polynomials in two variables. (Fixed typos of v1)
Covering a network with the minimum possible number of boxes can reveal interesting features for the network structure, especially in terms of self-similar or fractal characteristics. Considerable attention has been recently devoted to this…
Let $\mathcal C$ be a real plane algebraic curve defined by the resultant of two polynomials (resp. by the discriminant of a polynomial). Geometrically such a curve is the projection of the intersection of the surfaces $P(x,y,z)=Q(x,y,z)=0$…
In this article, we introduce the notion of periodic de Rham bundles over smooth complex curves. We prove that motivic de Rham bundles over smooth complex curves are periodic. We conjecture that irreducible periodic de Rham bundles over…
We outline a general algorithm for computing an explicit model over a number field of any curve of genus 2 whose (unpolarized) Jacobian is isomorphic to the product of two elliptic curves with CM by the same order in an imaginary quadratic…
We develop the partitioning technique for quantum discrete systems. The graph consists of several subgraphs: a central graph and several branch graphs, with each branch graph being rooted by an individual node on the central one. We show…
We classify real families of minimal degree rational curves that cover an embedded rational surface. A corollary is that if the projective closure of a smooth surface is not biregular isomorphic to the projective closure of the unit-sphere,…
We develop an intersection theory for a singular hemitian line bundle with positive curvature current on a smooth projective variety and irreducible curves on the variety. And we prove the existence of a natural rational fibration structure…
We systematically study the splitting of vector bundles on a smooth, projective variety, whose restriction to the zero locus of a regular section of an ample vector bundle splits. First, we find ampleness and genericity conditions which…
The paper concerns numerical algorithms for solving the Beltrami equation $f_{\bar{z}}(z)=\mu(z) f_z(z)$ for a compactly supported $\mu$. First, we study an efficient algorithm that has been proposed in the literature, and present its…
In this expository paper we show how one can, in a uniform way, calculate the weight distributions of some well-known binary cyclic codes. The codes are related to certain families of curves, and the weight distributions are related to the…
We show that the birationality class of a quadric surface bundle over $\mathbb{P}^2$ is determined by its associated cokernel sheaves. As an application, we discuss stable-rationality of very general quadric bundles over $\mathbb{P}^2$ with…
In this article we deduce criteria for the splitting and the triviality of vector bundles, by restricting them to partially ample divisors. This allows to study the problem of splitting on the total space of fibre bundles. The statements…
An algorithm for sampling exactly from the normal distribution is given. The algorithm reads some number of uniformly distributed random digits in a given base and generates an initial portion of the representation of a normal deviate in…
In this paper we give a polynomial-time quantum algorithm for computing orders of solvable groups. Several other problems, such as testing membership in solvable groups, testing equality of subgroups in a given solvable group, and testing…
In this article, we compute the braid monodromy of two algebraic curves defined over R. These two curves are of complex level not bigger than 6, and they are unions of lines and conics. We use two different techniques for computing their…