Related papers: Computing Weierstrass semigroups and the Feng-Rao …
The Weierstrass function is a classic example of a continuous nowhere differentiable function, defined as a sum of high-frequency complex exponentials. In this paper, we follow a suggestion of M.V. Berry and study the convergence properties…
In this paper, we investigate two-point Algebraic Geometry codes associated to the Skabelund maximal curve constructed as a cyclic cover of the Suzuki curve. In order to estimate the minimum distance of such codes, we make use of the…
Here we study the projective geometry of smooth models $X_n \subseteq \mathbb{P}^4$ of plane Suzuki curves $S_n$. The knowledge of a system of generators for the Weierstrass semigroup at the only singular point of the curve is shown to have…
The Fr\'{e}chet distance is a well-studied similarity measure between curves that is widely used throughout computer science. Motivated by applications where curves stem from paths and walks on an underlying graph (such as a road network),…
The Gromov-Wasserstein distance is a notable extension of optimal transport. In contrast to the classic Wasserstein distance, it solves a quadratic assignment problem that minimizes the pair-wise distance distortion under the transportation…
It is unlikely that the discrete Fr\'echet distance between two curves of length $n$ can be computed in strictly subquadratic time. We thus consider the setting where one of the curves, $P$, is known in advance. In particular, we wish to…
The Weierstrass curve is a pointed curve $(X,\infty)$ with a numerical semigroup $H_X$, which is a normalization of the curve given by the Weierstrass canonical form, $y^r + A_{1}(x) y^{r-1} + A_{2}(x) y^{r-2} +\dots + A_{r-1}(x) y +…
We present a methodology for clustering N objects which are described by multivariate time series, i.e. several sequences of real-valued random variables. This clustering methodology leverages copulas which are distributions encoding the…
We present several new algorithms for computing factorization invariant values over affine semigroups. In particular, we give (i) the first known algorithm to compute the delta set of any affine semigroup, (ii) an improved method of…
We propose a new embedding method for a single vector and for a pair of vectors. This embedding method enables: a) efficient classification and regression of functions of single vectors; b) efficient approximation of distance functions; and…
The fact that a Markov diffusion semi-group on $\mathbb R^d$ contracts the $L^p$ Wasserstein distance, which has been extensively used to establish uniform-in-time stability estimates (e.g. with respect to numerical discretization errors),…
We study the minimal Weierstrass equations for genus 2 curves defined over a ring of integers $\mathcal O_{\mathbb F}$. This is done via reduction theory and Julia invariant of binary sextics. We show that when the binary sextics has extra…
We improve previously known lower bounds for the minimum distance of certain two-point AG codes constructed using a Generalized Giulietti-Korchmaros curve (GGK). Castellanos and Tizziotti recently described such bounds for two-point codes…
A classical result states that on a smooth algebraic curve of genus $g$ the number of Weierstrass points, counted with multiplicity, is $g^3-g$. In this paper, we introduce the notion of geometric Weierstrass points of metric graphs and…
We investigate the computational complexity of computing the Hausdorff distance. Specifically, we show that the decision problem of whether the Hausdorff distance of two semi-algebraic sets is bounded by a given threshold is complete for…
In this paper we present a novel algorithm for computing a congruence on an inverse semigroup from a collection of generating pairs. This algorithm uses a myriad of techniques from the theories of groups, automata, and inverse semigroups.…
Our purpose is to obtain gradient estimates for certain nonlinear partial differential equations by coupling methods. First we derive uniform gradient estimates for a certain semi-linear PDEs based on the coupling method introduced in Wang…
Persistence diagrams are a useful tool from topological data analysis which can be used to provide a concise description of a filtered topological space. What makes them even more useful in practice is that they come with a notion of a…
Let $C$ be a hyperelliptic curve of genus $g\geq 1$ over a number field $K$ with good reduction outside a finite set of places $S$ of $K$. We prove that $C$ has a Weierstrass model over the ring of integers of $K$ with height effectively…
Let $\Gamma$ be the Fuchsian group of the first kind. For an even integer $m\ge 4$, we describe the space $H^{m/2}\left(\mathfrak R_\Gamma\right)$ of $m/2$--holomorphic differentials in terms of a subspace $S_m^H(\Gamma)$ of the space of…