Related papers: Twisted $\boldsymbol{\mu}_4$-normal form for ellip…

We study the geometry of elliptic fibrations satisfying the conditions of Step 8 of Tate's algorithm. We call such geometries F$_4$-models, as the dual graph of their special fiber is the twisted affine Dynkin diagram…

Standard Mean-Shift algorithms are notoriously sensitive to the bandwidth hyperparameter, particularly in data-scarce regimes where fixed-scale density estimation leads to fragmentation and spurious modes. In this paper, we propose Doubly…

We extend the family of capacities given by McDuff and Siegel by including a constraint $\ell$ on the number of positive asymptotically cylindrical ends of curves showing up in the definition. We prove a generalized computation formula for…

Tate's algorithm tells us that for an elliptic curve $E$ over a local field $K$ of residue characteristic $\geq 5$, $E/K$ has potentially good reduction if and only if $\text{ord}(j_E)\geq 0$. It also tells us that when $E/K$ is semistable…

We discuss the use of elliptic curves in cryptography on high-dimensional surfaces. In particular, instead of a Diffie-Hellman key exchange protocol written in the form of a bi-dimensional row, where the elements are made up with 256 bits,…

Given an input graph and weights on its vertices, the maximum co-2-plex problem is to find a subset of vertices maximizing the sum of their weights and inducing a graph of degree at most 1. In this article, we analyze polyhedral aspects of…

We describe a general purpose algorithm for counting simple cycles and simple paths of any length $\ell$ on a (weighted di)graph on $N$ vertices and $M$ edges, achieving a time complexity of $O\left(N+M+\big(\ell^\omega+\ell\Delta\big)…

Problems that require the parameterization of closed contours arise frequently in computer vision applications. This article introduces a new curve parameterization algorithm that is able to fit a closed curve to a set of points while being…

We introduce a novel family of adaptive filtering algorithms based on a relative logarithmic cost. The new family intrinsically combines the higher and lower order measures of the error into a single continuous update based on the error…

In this paper we treat certain elliptic and hyper-elliptic integrals in a unified way. We introduce a new basis of these integrals coming from certain basis ${\phi}_n(x)$ of polynomials and show that the transition matrix between this basis…

Conventional statistical wisdom established a well-understood relationship between model complexity and prediction error, typically presented as a U-shaped curve reflecting a transition between under- and overfitting regimes. However,…

This paper establishes a unifying framework for various forms of twisted Hochschild homology by comparing two definitions of elliptic Hochschild homology: one introduced by Moulinos--Robalo--To\"en and the other by Sibilla--Tomasini.…

As a well-known fact, the classical Euler scheme works merely for SDEs with coefficients of linear growth. In this paper, we study a general framework of modified Euler schemes, which is applicable to SDEs with super-linear drifts and…

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…

We revisit the hardness of approximating the diameter of a network. In the CONGEST model of distributed computing, $ \tilde \Omega (n) $ rounds are necessary to compute the diameter [Frischknecht et al. SODA'12], where $ \tilde \Omega…

The ellipsoid algorithm is a fundamental algorithm for computing a solution to the system of $m$ linear inequalities in $n$ variables $(P): A^{\top}x \le u$ when its set of solutions has positive volume. However, when $(P)$ is infeasible,…

We propose a fast, distance-preserving, binary embedding algorithm to transform a high-dimensional dataset $\mathcal{T}\subseteq\mathbb{R}^n$ into binary sequences in the cube $\{\pm 1\}^m$. When $\mathcal{T}$ consists of well-spread (i.e.,…

We develop a new approach for distributed distance computation in planar graphs that is based on a variant of the metric compression problem recently introduced by Abboud et al. [SODA'18]. One of our key technical contributions is in…

We use an invariant-theoretic method to compute certain twists of the modular curves X(n) for n=7,9,11. Searching for rational points on these twists enables us to find non-trivial pairs of n-congruent elliptic curves over Q, i.e. pairs of…

Let $R$ be a closed, oriented topological 4-manifold whose Euler characteristic and signature are denoted by $e$ and $\sigma$. We show that if $R$ has order two $\pi_1$, odd intersection form, and $2e + 3\sigma \geq 0$, then for all but…