Related papers: Heuristics of the Cocks-Pinch method
We present a method for constructing optimized equations for the modular curve X_1(N) using a local search algorithm on a suitably defined graph of birationally equivalent plane curves. We then apply these equations over a finite field F_q…
Heuristic-based methods are among the most popular methods in the process discovery area. This category of methods is composed of two main steps: 1) discovering a dependency graph 2) determining the split/join patterns of the dependency…
We describe deterministic and probabilistic algorithms to determine whether or not a given monic irreducible polynomial H in Z[X] is a Hilbert class polynomial, and if so, which one. These algorithms can be used to determine whether a given…
Let E be an elliptic curve over Q. In 1988, Koblitz conjectured a precise asymptotic for the number of primes p up to x such that the order of the group of points of E over the finite field F_p is prime. This is an analogue of the Hardy and…
We present a novel, log-radius profile representation for convex curves and define a new operation for combining the shape features of curves. Unlike the standard, angle profile-based methods, this operation accurately combines the shape…
We describe an algorithm to compute the local Coleman-Gross p-adic height at p on a hyperelliptic curve. Previously, this was only possible using an algorithm due to Balakrishnan and Besser, which was limited to odd degree. While we follow…
In this paper, we give an explicit description of the de Rham and p-adic polylogarithms for elliptic curves using the Kronecker theta function. We prove in particular that when the elliptic curve has complex multiplication and good…
We give a new proof of the theorem of Birman-Powell that the Torelli subgroup of the mapping class group of a closed orientable surface of genus at least 3 is generated by simple homeomorphisms known as bounding pair maps. The key…
Using a mixture of classical and probabilistic techniques we investigate the convexity of solutions to the elliptic pde associated with a certain generalized Ornstein-Uhlenbeck process.
We discuss how quantitative cohomological informations could provide qualitative properties on complex and symplectic manifolds. In particular we focus on the Bott-Chern and the Aeppli cohomology groups in both cases, since they represent…
We present a computational approach to general hyperelliptic Riemann surfaces in Weierstrass normal form. The surface is either given by a list of the branch points, the coefficients of the defining polynomial or a system of cuts for the…
We investigate the tension between symplecticity and gauge covariance in classical Hamiltonian mechanics. The pursuit of manifest covariance over manifest symplecticity results in a unique geometric formulation. Firstly, covariant yet…
The "defect" of a curve over a finite field is the difference between the number of rational points on the curve and the Weil-Serre bound for the curve. We present a construction for producing genus-4 double covers of genus-2 curves over…
We verify the Grone Merris conjecture for a class of graphs. We do this by curve sketching in the sense of first year calculus. That is, we do it by homotopy methods.
The paper considers the problem of finding the number of dominant voters in two-level voting procedures. At the first stage, voting is conducted among local groups of voters, and at the second stage, the results are aggregated to form a…
An elliptic pair $(X, C)$ is a projective rational surface $X$ with log terminal singularities, and an irreducible curve $C$ contained in the smooth locus of $X$, with arithmetic genus one and self-intersection zero. They are a useful tool…
Vine copulas are pair-copula constructions enabling multivariate dependence modeling in terms of bivariate building blocks. One of the main tasks of fitting a vine copula is the selection of a suitable tree structure. For this the prevalent…
We present a deterministic algorithm that computes the zeta function of a nonsupersingular elliptic curve E over a finite field with p^n elements in time quasi-quadratic in n. An older algorithm having the same time complexity uses the…
We present a new approach to study measures on ensembles of contours, polymers or other objects interacting by some sort of exclusion condition. For concreteness we develop it here for the case of Peierls contours. Unlike existing methods,…
The article presents simple analysis of cones which are used to generate a given conic curve by section by a plane. It was found that if the given curve is an ellipse, then the locus of vertexes of the cones is a hyperbola. The hyperbola…