Related papers: The supersingular isogeny problem in genus 2 and b…
Let $K$ be a field of characteristic different from $2$, $\bar{K}$ its algebraic closure. Let $n \ge 3$ be an odd prime such that $2$ is a primitive root modulo $n$. Let $f(x)$ and $h(x)$ be degree $n$ polynomials with coefficients in $K$…
The graph isomorphism is to determine whether two graphs are isomorphic. A closely related problem is automorphism detection, where an isomorphism between two graphs is a bijection between their vertex sets that preserves adjacency, and an…
We introduce and study "path odd-covers", a weakening of Gallai's path decomposition problem and a strengthening of the linear arboricity problem. The "path odd-cover number" $p_2(G)$ of a graph $G$ is the minimum cardinality of a…
Given a real valued function f(X,Y), a box region B_0 in R^2 and a positive epsilon, we want to compute an epsilon-isotopic polygonal approximation to the restriction of the curve S=f^{-1}(0)={p in R^2: f(p)=0} to B_0. We focus on…
Let $K$ be a quadratic field which is not an imaginary quadratic field of class number one. We describe an algorithm to compute the primes $p$ for which there exists an elliptic curve over $K$ admitting a $K$-rational $p$-isogeny. This…
It is well known that quantum computers can efficiently find a hidden subgroup $H$ of a finite Abelian group $G$. This implies that after only a polynomial (in $\log |G|$) number of calls to the oracle function, the states corresponding to…
We consider the ideal orientation problem in planar graphs. In this problem, we are given an undirected graph $G$ with positive edge lengths and $k$ pairs of distinct vertices $(s_1, t_1), \dots, (s_k, t_k)$ called terminals, and we want to…
We give an algorithm for computing an inseparable endomorphism of a supersingular elliptic curve $E$ defined over $\mathbb F_{p^2}$, which, conditional on GRH, runs in expected $O(p^{1/2}(\log p)^2(\log\log p)^3)$ bit operations and…
Isogenies, the mappings of elliptic curves, have become a useful tool in cryptology. These mathematical objects have been proposed for use in computing pairings, constructing hash functions and random number generators, and analyzing the…
The subgraph isomorphism finding problem is a well-studied problem in the field of computer science and graph theory, and it aims to enumerate all instances of a query graph in the respective data graph. In this paper, we propose an…
Boix, De Stefani and Vanzo have characterized ordinary/supersingular elliptic curves over $\mathbb{F}_p$ in terms of the level of the defining cubic homogenous polynomial. We extend their study to arbitrary genus, in particular we prove…
In this paper we show lower bounds for a certain large class of algorithms solving the Graph Isomorphism problem, even on expander graph instances. Spielman [25] shows an algorithm for isomorphism of strongly regular expander graphs that…
Let G=(V,E) be a graph with f:V\to Z_+ a function assigning degree bounds to vertices. We present the first efficient algebraic algorithm to find an f-factor. The time is \tilde{O}(f(V)^{\omega}). More generally for graphs with integral…
Motivated by our arithmetic applications, we required some tools that might be of independent interest. Let $\mathcal E$ be an absolutely irreducible group scheme of rank $p^4$ over $\mathbb Z_p$. We provide a complete description of the…
A meander can be seen as a pair of transversally intersecting simple closed curves on a 2-sphere. We consider pairs of transversally intersecting simple closed curves on a closed oriented surface of arbitrary genus g. The number of such…
The graph isomorphism problem asks whether two graphs are identical up to vertex relabeling. While the exact problem admits quasi-polynomial-time classical algorithms, many applications in molecular comparison, noisy network analysis, and…
Let $F$ be a $2$-regular graph of order $v$. The Oberwolfach problem, $OP(F)$, asks for a $2$-factorization of the complete graph on $v$ vertices in which each $2$-factor is isomorphic to $F$. In this paper, we give a complete solution to…
Graph kernels based on the $1$-dimensional Weisfeiler-Leman algorithm and corresponding neural architectures recently emerged as powerful tools for (supervised) learning with graphs. However, due to the purely local nature of the…
A prominent example of a topologically ordered system is Kitaev's quantum double model $\mathcal{D}(G)$ for finite groups $G$ (which in particular includes $G = \mathbb{Z}_2$, the toric code). We will look at these models from the point of…
Let $G$ be a group. The BCI problem asks whether two Haar graphs of $G$ are isomorphic if and only if they are isomorphic by an element of an explicit list of isomorphisms. We first generalize this problem in a natural way and give a…