Related papers: Computing Humbert Surfaces
Riemann surfaces are among the simplest and most basic geometric objects. They appear as key players in many branches of physics, mathematics, and other sciences. Despite their widespread significance, how to compute distances between pairs…
We develop a new general method for computing the decomposition type of the normal bundle to a projective rational curve. This method is then used to detect and explain an example of a Hilbert scheme that parametrizes all the rational…
We develop numerical homotopy algorithms for solving systems of polynomial equations arising from the classical Schubert calculus. These homotopies are optimal in that generically no paths diverge. For problems defined by hypersurface…
We develop a new method in the computation of equivariant homotopy, which is based on the splitting of cofiber sequences associated to universal spaces in the category of equivariant spectra. In particular, we use this method to compute the…
We consider the polynomial algebra $\mathbb{C}[\mathbf{z}]:=\mathbb{C}[z_1,\,z_2,\,z_3]$ and the polynomial $f:=z_1^3+z_2^3+z_3^3+3qz_1z_2z_3$, where $q\in \mathbb{C}$. Our aim is to compute the Hochschild homology and cohomology of the…
An inventory of all possible homogenous Hilbert curves in two dimensions are reported. Six new Hilbert curves are described by introducing the reversion operation in the construction algorithm. For each curve, the set of affine…
We compute the Dijkgraaf-Witten invariants of surfaces in terms of projective representations of groups. As an application we prove that the complex Dijkgraaf-Witten invariants of surfaces of positive genus are positive integers.
We produce algorithms to detect whether a complex affine variety computed and presented numerically by the machinery of numerical algebraic geometry corresponds to an associated component of a polynomial ideal.
We present several new algorithms for computing factorization invariant values over affine semigroups. In particular, we give (i) the first known algorithm to compute the delta set of any affine semigroup, (ii) an improved method of…
An efficient algorithm for computing the branching structure of a compact Riemann surface defined via an algebraic curve is presented. Generators of the fundamental group of the base of the ramified covering punctured at the discriminant…
We extend work of Heath-Brown and Salberger, based on the determinant method, to provide a uniform upper bound for the number of integral points of bounded height on an affine surface, which are subject to a polynomial congruence condition.…
This paper focuses on a numerical invariant for local rings of characteristic $p$ called $h$-function, that recovers several important invariants, including the Hilbert-Kunz multiplicity, $F$-signature, $F$-threshold, and $F$-signature of…
We proposed an algorithm that covers some cases of Hamilton Circuit Problem.
We present an algorithmic framework for computing generators for the ring of invariants of an Artin-Schreier curve. We give explicit invariants for almost all Artin-Schreier curves of genus up to~8 in standard form, and for a handful of…
A method for the analytical evaluation of layer potentials arising in the collocation boundary element method for the Laplace and Helmholtz equation is developed for piecewise flat boundary elements with polynomial shape functions. The…
Properties of the recently reported homogeneous Hilbert curves are deduced and reported. The nature of the affine transformations involved in the construction of the Hilbert curves is explored. The analytical representation of proper and…
We construct algorithms and topological invariants that allow us to distinguish the topological type of a surface, as well as functions and vector fields for their topological equivalence. In the first part we discus the main structures…
In the present article we compute the flag curvature of a special type of invariant Kropina metrics on homogeneous spaces.
Inpainting is the technique of reconstructing unknown or damaged portions of an image in a visually plausible way. Inpainting algorithm automatically fills the damaged region in an image using the information available in undamaged region.…
This is a survey of known algorithms in algebraic topology with a focus on finite simplicial complexes and, in particular, simplicial manifolds. Wherever possible an elementary approach is chosen. This way the text may also serve as a…