Related papers: The supersingular isogeny problem in genus 2 and b…

Censor-Hillel et al. [PODC'15] recently showed how to efficiently implement centralized algebraic algorithms for matrix multiplication in the congested clique model, a model of distributed computing that has received increasing attention in…

We study the set of isomorphism classes of principal polarizations on abelian varieties of GL2-type. As applications of our results, we construct examples of curves C, C'/\Q of genus two which are nonisomorphic over \bar \Q and share…

We develop a direct method to recover an orthoalgebra from its poset of Boolean subalgebras. For this a new notion of direction is introduced. Directions are also used to characterize in purely order-theoretic terms those posets that are…

Let $K$ be a field of characteristic different from $2$, $\bar{K}$ its algebraic closure. Let $n \ge 3$ be an odd integer. Let $f(x)$ and $h(x)$ be degree $n$ polynomials with coefficients in $K$ and without repeated roots. Let us consider…

We present a near-optimal polynomial-time approximation algorithm for the asymmetric traveling salesman problem for graphs of bounded orientable or non-orientable genus. Our algorithm achieves an approximation factor of O(f(g)) on graphs…

Given an undirected, weighted graph, with $n$ vertices and $m$ edges, and two special vertices $s$ and $t$, the problem is to find the shortest path between them. We give two bounded-error quantum algorithms with improved runtime in the…

Let $m,n,d > 1$ be integers such that $n=md$. In this paper, we present an efficient change of level algorithm that takes as input $(B, \mathscr{M}, \Theta_\mathscr{M})$ a marked abelian variety of level $m$ over the base field $k$ of odd…

This paper proposes a new, visual method to study numerical semigroups and the Frobenius problem. The method is based on building a so-called reduction graph, whose nodes usually correspond to monogenic semigroups, and whose edges can have…

The problem of Subgraph Isomorphism is defined as follows: Given a pattern H and a host graph G on n vertices, does G contain a subgraph that is isomorphic to H? Eppstein [SODA 95, J'GAA 99] gives the first linear time algorithm for…

Consider the following generalization of the classic binary search problem: A searcher is required to find a hidden target vertex $x$ in a graph $G$. To do so, they iteratively perform queries to an oracle, each about a chosen vertex $v$.…

We give an algebraic and a geometric criterion for the existence of $G$-connections on $\mathbb{P}^{1}$ with prescribed irregular type with equal slope at $\infty$ (isoclinic) and with regular singularity of prescribed residue at $0$. The…

We give an exponential upper and a quadratic lower bound on the number of pairwise non-isotopic simple closed curves can be placed on a closed surface of genus g such that any two of the curves intersects at most once. Although the gap is…

We establish that a simple polynomial-time algorithm that we call reweighted spectral partitioning obtains small 2/3-balanced vertex-separators for a number of graph classes, including $O(\sqrt{n})$-sized separators for planar graphs,…

Let C be a supersingular genus-2 curve over an algebraically closed field of characteristic 3. We show that if C is not isomorphic to the curve y^2 = x^5 + 1 then up to isomorphism there are exactly 20 degree-3 maps phi from C to the…

Let $F$ be a locally compact non-Archimedean field of characteristic $0$, and let $G$ be either the split special orthogonal group $\mathrm{SO}_{2n+1}(F)$ or the symplectic group $\mathrm{Sp}_{2n}(F)$. The goal of this paper is to give an…

We consider the isomorphism problem for hypergraphs taking as input two hypergraphs over the same set of vertices $V$ and a permutation group $\Gamma$ over domain $V$, and asking whether there is a permutation $\gamma \in \Gamma$ that…

Let $\mathcal{A}_g$ be the moduli space over $\overline{\mathbb{F}}_p$ of $g$-dimensional principally polarised abelian varieties, where $p$ is a prime. We show that if $g$ is even and $p\geq 5$, then every geometric generic member in the…

Graph sparsification serves as a foundation for many algorithms, such as approximation algorithms for graph cuts and Laplacian system solvers. As its natural generalization, hypergraph sparsification has recently gained increasing…

Graphs are widely used to model complicated data semantics in many application domains. In this paper, two novel and efficient algorithms Fast-ON and Fast-P are proposed for solving the subgraph isomorphism problem. The two algorithms are…

In this paper, we revisit the classic approximate All-Pairs Shortest Paths (APSP) problem in undirected graphs. For unweighted graphs, we provide an algorithm for $2$-approximate APSP in $\tilde O(n^{2.5-r}+n^{\omega(r)})$ time, for any…