Related papers: Computing newforms using supersingular isogeny gra…

The Weisfeiler-Leman dimension of a graph $G$ is the least number $k$ such that the $k$-dimensional Weisfeiler-Leman algorithm distinguishes $G$ from every other non-isomorphic graph. The dimension is a standard measure of the descriptive…

The main result of the paper is motivated by the following two, apparently unrelated graph optimization problems: (A) as an extension of Edmonds' disjoint branchings theorem, characterize digraphs comprising $k$ disjoint branchings $B_i$…

Lie-theoretic structures of type $E_8$ (e.g., Lie groups and algebras, Hecke algebras and Kazhdan-Lusztig cells, ...) are considered to serve as a `gold standard' when it comes to judging the effectiveness of a general algorithm for solving…

Supersingular elliptic curve isogeny graphs underlie isogeny-based cryptography. For isogenies of a single prime degree $\ell$, their structure has been investigated graph-theoretically. We generalise the notion of $\ell$-isogeny graphs to…

We develop the theory of $q$-characters for quantum affine superalgebras of type $A$ in connection with deformed Cartan matrices. To achieve this, we establish a Khoroshkin-Tolstoy-type multiplicative formula of the universal $R$-matrix of…

We investigate pairwise quasi-orthogonal subalgebras in $M_{p^{kn}}$ which are isomorphic to $M_{p^{k}}$ for $k \ge 1$, $n \ge 2$ and a prime number $p$ with $p \ge 3$. We prove there exist $p^{2kn}-1/p^{2k}-1$ such subalgebras and they…

For generic maps from compact surfaces with boundary into the plane we develop an explicit algorithm for minimizing both the number of cusps and the number of components of the singular locus. More precisely, we minimize among maps with…

We address the problem of the determination of the images of the Galois representations attached to genus 2 Siegel cusp forms of level 1 having multiplicity one. These representations are symplectic. We prove that the images are as large as…

For the class of quantum integrable models generated from the $q-$Onsager algebra, a basis of bispectral multivariable $q-$orthogonal polynomials is exhibited. In a first part, it is shown that the multivariable Askey-Wilson polynomials…

For a pair of distinct non-CM newforms of weights at least 2, having rational integral Fourier coefficients $a_{1}(n)$ and $a_{2}(n)$, under GRH, we obtain an estimate for the set of primes $p$ such that $$ \omega(a_1(p)-a_2(p)) \le […

An old problem raised independently by Jacobson and Sch\"onheim asks to determine the maximum $s$ for which every graph with $m$ edges contains a pair of edge-disjoint isomorphic subgraphs with $s$ edges. In this paper we determine this…

The goal in this preprint is to give an efficient algorithm to compute Puiseux expansions at cusps of X0(N). It is based on a relation with a hypergeometric function that holds for any N.

The purpose of this paper is to collect and make explicit the results of Gel'fand, Graev and Piatetski-Shapiro and Miyazaki for the $GL(3)$ cusp forms which are non-trivial on $SO(3,\mathbb{R})$. We give new descriptions of the spaces of…

We describe and compare algorithms for computing supersingular isogeny graphs. Along the way, we obtain a formula for the trace of the adjacency matrix of a general supersingular isogeny graph, and we prove a conjecture recently posed by…

We obtain an asymptotic formula for a weighted sum over cuspidal eigenvalues in a specific region, for $\SL_2$ over a totally real number field $F$, with discrete subgroup of Hecke type $\Gamma_0(I)$ for a non-zero ideal $I$ in the ring of…

We give an algorithm to calculate the minimal and maximal genus of the orientable closed surface where a graph $G$ can be embedded. For this, we construct some special branched coverings of the 2-sphere. We apply this algorithm to calculate…

In comparison to graphs, combinatorial methods for the isomorphism problem of finite groups are less developed than algebraic ones. To be able to investigate the descriptive complexity of finite groups and the group isomorphism problem, we…

We present an algorithm for computing the $p$-component of the automorphic representation arising from a cuspidal newform $f$ for a prime $p$. This is equivalent to computing the restriction to the decomposition group at $p$ of the…

We construct a new extension of the Poincar\'e superalgebra in eleven dimensions which contains super one-, two- and five-form charges. The latter two are associated with the supermembrane and the superfivebrane of M-theory. Using the…

The Weisfeiler-Leman (WL) dimension of a graph is a measure for the inherent descriptive complexity of the graph. While originally derived from a combinatorial graph isomorphism test called the Weisfeiler-Leman algorithm, the WL dimension…