相关论文: The supersingular isogeny problem in genus 2 and b…

Let h be a p-isogeny of elliptic curves. We describe how to perform h-descents on the nontrivial elements in the Shafarevich-Tate group which are killed by the dual isogeny h'. This makes computation of p-Selmer groups of elliptic curves…

It is well-known that the graph isomorphism problem can be posed as an equivalent problem of determining whether an auxiliary graph structure contains a clique of specific order. However, the algorithms that have been developed so far for…

We provide an explicit and algorithmic version of a theorem of Momose classifying isogenies of prime degree of elliptic curves over number fields, which we implement in Sage and PARI/GP. Combining this algorithm with recent work of…

Let $C$ be a curve of genus $g$ over a field $k$. We describe probabilistic algorithms for addition and inversion of the classes of rational divisors in the Jacobian of $C$. After a precomputation, which is done only once for the curve $C$,…

In arithmetic and algebraic geometry, superspecial (s.sp.\ for short) curves are one of the most important objects to be studied, with applications to cryptography and coding theory. If $g \geq 4$, it is not even known whether there exists…

Let $\mathcal{G}=\mathrm{Spec}(A)$ be a finite and flat group scheme over the ring of algebraic integers $R$ of a number field $K$ and suppose that the generic fiber of $\mathcal{G}$ is the constant group scheme over $K$ for a finite group…

Let $\mathcal{E}$ be a $\mathbb{Q}$-isogeny class of elliptic curves defined over $\mathbb{Q}$. The isogeny graph associated to $\mathcal{E}$ is a graph which has a vertex for each element of $\mathcal{E}$ and an edge for each…

This paper presents an enhancement to Grover's search algorithm for instances where the number of items (or the size of the search problem) $N$ is not a power of 2. By employing an efficient algorithm for the preparation of uniform quantum…

Using a recently developed formulation of double field theory in superspace, the graviton, $B$-field, gravitini, dilatini, and Ramond-Ramond bispinor are encoded in a single generalized supervielbein. Duality transformations are encoded as…

We present new conditions which obstruct the existence of hyperelliptic Jacobians in isogeny classes of abelian varieties over finite fields of characteristic 2. We show that Weil polynomials of Jacobians cannot have coefficients in certain…

The state-of-the-art solvers for the graph isomorphism problem can readily solve generic instances with tens of thousands of vertices. Indeed, experiments show that on inputs without particular combinatorial structure the algorithms scale…

To numerically solve a generic elliptic equation on two-dimensional domains with rectangular Cartesian grids, we propose a cut-cell geometric multigrid method that features (1) general algorithmic steps that apply to two-dimensional…

Delaunay and Gabriel graphs are widely studied geometric proximity structures. Motivated by applications in wireless routing, relaxed versions of these graphs known as \emph{Locally Delaunay Graphs} ($LDGs$) and \emph{Locally Gabriel…

We show that every component of the locus of smooth supersingular curves of genus $4$ in characteristic $p>2$ has a trivial generic automorphism group. As a result, we prove Oort's conjecture about automorphism groups of supersingular…

A tuple (s1,t1,s2,t2) of vertices in a simple undirected graph is 2-linked when there are two vertex-disjoint paths respectively from s1 to t1 and s2 to t2. A graph is 2-linked when all such tuples are 2-linked. We give a new and simple…

The disjoint paths logic, FOL+DP, is an extension of First-Order Logic (FOL) with the extra atomic predicate $\mathsf{dp}_k(x_1,y_1,\ldots,x_k,y_k),$ expressing the existence of internally vertex-disjoint paths between $x_i$ and $y_i,$ for…

We present new criteria that obstruct an isogeny class of abelian varieties over a finite field with a given Weil polynomial from containing a Jacobian of a genus-3 hyperelliptic curve. Based on our analysis of the Weil polynomials of…

We consider the following natural generalization of Binary Search: in a given undirected, positively weighted graph, one vertex is a target. The algorithm's task is to identify the target by adaptively querying vertices. In response to…

We present a new method for upper bounding the second eigenvalue of the Laplacian of graphs. Our approach uses multi-commodity flows to deform the geometry of the graph; we embed the resulting metric into Euclidean space to recover a bound…

We develop criteria based on a calibration argument via discrete PDE and semidiscrete optimal transport, for finding sharp isoperimetric inequalities of the form $(\sharp \Omega)^{d-1} \le C (\sharp \overrightarrow{\partial\Omega})^d$ where…