Related papers: Computing Hypercircles by Moving Hyperplanes
We introduce a new approach of computing the automorphism group and the field of moduli of points $\p=[C]$ in the moduli space of hyperelliptic curves $\H_g$. Further, we show that for every moduli point $\p \in \H_g(L)$ such that the…
Let $K$ be a global function field of characteristic $p$ and degree $D$ over $\mathbb F_{p}(t)$. We consider dynamical systems over the projective line $\mathbb P^1(K)$ defined by rational maps with at most one prime of bad reduction. The…
We use a well known problem in discrete and computational geometry (partitions of measures by $k$-fans) as a motivation and as a point of departure to illustrate many aspects, both theoretical and computational, of the problem of…
Given a curve $C$ over a number field $K$ equipped with the action of a finite group $G$ by $K$-automorphisms, one obtains a factorisation of $L(C,s)$ into a product of $L$-functions of `motivic pieces of curves' associated to irreducible…
We give two formulae which express the Alexander polynomial $\Delta^C$ of several variables of a plane curve singularity $C$ in terms of the ring ${\cal O}_{C}$ of germs of analytic functions on the curve. One of them expresses $\Delta^C$…
Given a real algebraic curve, embedded in projective space, we study the computational problem of deciding whether there exists a hyperplane meeting the curve in real points only. More generally, given any divisor on such a curve, we may…
For a number field K with absolute Galois group G_K, we consider the action of G_K on the infinite tree of preimages of a point in K under a degree-two rational function phi, with particular attention to the case when phi commutes with a…
The Hamiltonian cycle problem (HCP), which is an NP-complete problem, consists of having a graph G with n nodes and m edges and finding the path that connects each node exactly once. In this paper we compare some algorithms to solve a…
We study theoretical and computational aspects of the least squares fit (LSF) of circles and circular arcs. First we discuss the existence and uniqueness of LSF and various parametrization schemes. Then we evaluate several popular circle…
We introduce a new algorithm for the structural analysis of finite abstract simplicial complexes based on local homology. Through an iterative and top-down procedure, our algorithm computes a stratification $\pi$ of the poset $P$ of…
The computation of a maximal order of an order in a semisimple algebra over a global field is a classical well-studied problem in algorithmic number theory. In this paper we consider the related problems of computing all minimal overorders…
Let $\Bbbk$ be a perfect field with algebraic closure $\overline{\Bbbk}$. If $H$ is a subgroup of plane automorphisms over $\Bbbk$ and $p\in\overline{\Bbbk}^2$ is a point, we describe the subgroup consisting of plane automorphisms which…
We present a matrix-based algorithm for deciding if the parametrization of a curve or a surface is invertible or not, and for computing the inverse of the parametrization if it exists.
We construct general models for holographic superconductivity parametrized by three couplings which are functions of a real scalar field and show that under general assumptions they describe superconducting phase transitions. While some…
A $\mathit{\text{moving frame}}$ at a rational curve is a basis of vectors moving along the curve. When the rational curve is given parametrically by a row vector $\mathbf{a}$ of univariate polynomials, a moving frame with important…
In this paper we considerably extend the class of known $\alpha$-minimizing hypercones using sub-calibration methods. Indeed, the improvement of previous results follows from a careful analysis of special cubic and quartic polynomials.
Building on existing algorithms and results, we offer new insights and algorithms for various problems related to detecting maximal and maximum bicliques. Most of these results focus on graphs with small maximum degree, providing improved…
Envelopes of parameterized families of plane curves is an important topic, both for the mathematics involved and for its applications. Nowadays, it is generally studied in a technology-rich environment, and automated methods are developed…
The complexity of large-scale distributed systems, particularly when deployed in physical space, calls for new mechanisms to address composability and reusability of collective adaptive behaviour. Computational fields have been proposed as…
We present a hybrid algorithm for optimizing a convex, smooth function over the cone of positive semidefinite matrices. Our algorithm converges to the global optimal solution and can be used to solve general large-scale semidefinite…