English
Related papers

Related papers: Computing Euclidean Belyi maps

200 papers

In this paper, we study Hessian equations and complex quotient equations on closed Hermitian manifolds. We directly derive the uniform estimate for the admissible solution. As an application, we solve general Hessian equations on closed…

Analysis of PDEs · Mathematics 2015-02-11 Wei Sun

We study the moduli space of euclidean structures with cone points on a surface, and describe a decomposition into cells each of which corresponds to a given combinatorial type of Delaunay tessellation. We use some of the ideas to study…

Geometric Topology · Mathematics 2007-05-23 Igor Rivin

The first part of this paper discusses general procedures for finding numerical approximations to distinguished Kahler metrics, such as Calabi-Yau metrics, on complex projective manifolds. These procedures are closely related to ideas from…

Differential Geometry · Mathematics 2007-05-23 S. K. Donaldson

We compute the number of (weak) equivalence classes of branched covers from a surface of genus g to the sphere, with 3 branching points, degree 2k, and local degrees over the branching points of the form (2,...,2), (2h+1,1,2,...,2),…

Geometric Topology · Mathematics 2018-09-06 Carlo Petronio

We address the problem of computing in the group of $\ell^k$-torsion rational points of the jacobian variety of algebraic curves over finite fields, with a view toward computing modular representations.

Number Theory · Mathematics 2012-05-07 Jean-Marc Couveignes

We give a formula to compare the Quillen metrics associated to a branched covering from holomorphic line bundles.

Differential Geometry · Mathematics 2023-01-31 Xiaonan Ma

In this paper, based on the theory of surfaces in the four-dimensional Euclidean space which generalizes the theory of surfaces in three-dimensional Euclidean space, beside other results, we will give a characterization of points on…

Differential Geometry · Mathematics 2013-10-24 Azam Etemad Dehkordy

A smooth map between smooth manifolds is called a special generic map if it has only definite fold points as its singularities. In this paper, we give conditions for a special generic map into the 3-dimensional Euclidean space to be…

Geometric Topology · Mathematics 2016-03-16 Masayuki Nishioka

This paper focuses on computing the directional extremal boundary of a union of equal-radius circles. We introduce an efficient algorithm that accurately determines this boundary by analyzing the intersections and dominant relationships…

Computational Geometry · Computer Science 2025-03-28 Alexander Gribov

For any $n>1$, we construct examples branched Galois coverings from $M$ to the nth projective space ${\mathbb P}^n$ where $M$ is one of $({\mathbb P}^1)^n$, ${\mathbb C}^n$ or $(B_1)^n$, and $B_1$ is the 1-ball. In terms of orbifolds, this…

Algebraic Geometry · Mathematics 2007-05-23 A. Muhammed Uludag

In the 3-path vertex cover problem, the input is an undirected graph $G$ and an integer $k$. The goal is to decide whether there is a set of vertices $S$ of size at most $k$ such that every path with 3 vertices in $G$ contains at least one…

Data Structures and Algorithms · Computer Science 2018-09-11 Dekel Tsur

We study linearizability of actions of finite groups on cubic threefolds with non-isolated singularities.

Algebraic Geometry · Mathematics 2025-05-08 Ivan Cheltsov , Lisa Marquand , Yuri Tschinkel , Zhijia Zhang

We contribute a new algebraic method for computing the orthogonal projections of a point onto a rational algebraic surface embedded in the three dimensional projective space. This problem is first turned into the computation of the finite…

Commutative Algebra · Mathematics 2020-04-10 Nicolás Botbol , Laurent Busé , Marc Chardin , Fatmanur Yildirim

We have developed a general Bayesian algorithm for determining the coordinates of points in a three-dimensional space. The algorithm takes as input a set of probabilistic constraints on the coordinates of the points, and an a priori…

Artificial Intelligence · Computer Science 2013-03-08 Russ B. Altman

Computing the Pfaffian of a skew-symmetric matrix is a problem that arises in various fields of physics. Both computing the Pfaffian and a related problem, computing the canonical form of a skew-symmetric matrix under unitary congruence,…

Mesoscale and Nanoscale Physics · Physics 2015-03-19 M. Wimmer

We prove elegant trilinear formulas connecting products of volumes of Euclidean tetrahedra with vertices taken from a given set of 6 points. We propose a way for generalizing those formulas.

Metric Geometry · Mathematics 2007-05-23 E. V. Martyushev

Considering a finite intersection of balls and a finite union of other balls in an Euclidean space, we propose an exact method to test whether the intersection is covered by the union. We reformulate this problem into quadratic programming…

Methodology · Statistics 2018-09-26 Vincent Runge

We propose new algorithms for computing triangular decompositions of polynomial systems incrementally. With respect to previous works, our improvements are based on a {\em weakened} notion of a polynomial GCD modulo a regular chain, which…

Symbolic Computation · Computer Science 2011-04-06 Changbo Chen , Marc Moreno Maza

The Prym variety for a branched double covering of a nonsingular projective curve is defined as a polarized abelian variety. We prove that any double covering of an elliptic curve which has more than $4$ branch points is recovered from its…

Algebraic Geometry · Mathematics 2018-12-20 Atsushi Ikeda

There are many applications in which a bounding sphere containing the given triangle E3 is needed, e.g. fast collision detection, ray-triangle intersecting in raytracing etc. This is a typical geometrical problem in E3 and it has also…

Graphics · Computer Science 2022-08-09 Vaclav Skala
‹ Prev 1 8 9 10 Next ›