Related papers: More Discriminants with the Brezing-Weng Method

We construct a conformally invariant random family of closed curves in the plane by welding of random homeomorphisms of the unit circle. The homeomorphism is constructed using the exponential of $\beta X$ where $X$ is the restriction of the…

We present algorithms for computing the squared Weil and Tate pairings on elliptic curves and the squared Tate pairing for hyperelliptic curves. The squared pairings introduced in this paper have the advantage that our algorithms for…

We present a novel discriminator for GANs that improves realness and diversity of generated samples by learning a structured hypersphere embedding space using spherical circles. The proposed discriminator learns to populate realistic…

We extend previous work on the two-dimensional developable tangent surface to its higher dimensional analogues $\mathfrak{M} \subset \mathbb{R}^{n+1}$. The approach here similarly applies cylindrical approximate decoupling at its core,…

The circle method has been successfully used over the last century to study rational points on hypersurfaces. More recently, a version of the method over function fields, combined with spreading out techniques, has led to a range of results…

Elliptic curves over finite fields with predefined conditions in the order are practically constructed using the theory of complex multiplication. The stage with longest calculations in this method reconstructs some polynomial with integer…

For each $t\in\mathbb{Q}\setminus\{-1,0,1\}$, define an elliptic curve over $\mathbb{Q}$ by \begin{align*} E_t:y^2=x(x+1)(x+t^2). \end{align*} Using a formula for the root number $W(E_t)$ as a function of $t$ and assuming some standard…

A new method for deriving universal \v{R} matrices from braid group representation is discussed. In this case, universal \v{R} operators can be defined and expressed in terms of products of braid group generators. The advantage of this…

Metrics specifying distances between data points can be learned in a discriminative manner or from generative models. In this paper, we show how to unify generative and discriminative learning of metrics via a kernel learning framework.…

We prove new results on splitting Brauer classes by genus 1 curves, settling in particular the case of degree 7 classes over global fields. Though our method is cohomological in nature, and proceeds by considering the more difficult problem…

We present a characterisation of blenders based on mapping properties of certain sets of curves that can be rigorously verified by computer-assisted methods. We develop an algorithm to construct these sets of curves that requires only a…

The maximum entropy principle (MEP) is one of the most prominent methods to investigate and model complex systems. Despite its popularity, the standard form of the MEP can only generate Boltzmann-Gibbs distributions, which are ill-suited…

Pairing-based cryptographic schemes require so-called pairing-friendly elliptic curves, which have special properties. The set of pairing-friendly elliptic curves that are generated by given polynomials form a complete family. Although a…

Let $c<3p/16$ be a prime or $c=1$. Let $E$ be a $\mathbb{Z}[\sqrt{-cp}]$-oriented supersingular elliptic curve defined over $\mathbb{F}_{p^2}$. There exists a $c$-isogeny from $E$ to $E^p$ with kernel $G \subset E[c]$. Given an Eichler…

We construct genus one curves on base extensions of generic Severi--Brauer varieties of a given index and period which are versal objects for families of geometrically elliptic normal curves. We also compute the periods and indices of these…

Ideal class pairings map the rational points of rank $r\geq 1$ elliptic curves $E/\Q$ to the ideal class groups $\CL(-D)$ of certain imaginary quadratic fields. These pairings imply that $$h(-D) \geq \frac{1}{2}(c(E)-\varepsilon)(\log…

This manuscript develops the theory of agglomerative clustering with Bregman divergences. Geometric smoothing techniques are developed to deal with degenerate clusters. To allow for cluster models based on exponential families with…

The Wang tiling is a classical problem in combinatorics. A major theoretical question is to find a (small) set of tiles which tiles the plane only aperiodically. In this case, resulting tilings are rather restrictive. On the other hand,…

We prove a result of Chern-Weil type for canonically metrized line bundles on one-parameter families of smooth complex curves. Our result generalizes a result due to J.I. Burgos Gil, J. Kramer and U. K\"uhn that deals with a line bundle of…

Motivated by a demand for explicit genus 1 Belyi maps from theoretical physics, we give an efficient method of explicitly computing genus one Belyi maps by (1) composing covering maps from elliptic curves to the Riemann sphere with simpler…