相关论文: Orienting supersingular isogeny graphs

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 consider finite graphs whose vertexes are supersingular elliptic curves, possibly with level structure, and edges are isogenies. They can be applied to the study of modular forms and to isogeny based cryptography. The main result of this…

An analysis is made of the properties and conditions for the existence of 3- and 5-isogenies of complete and quadratic supersingular Edwards curves. For the encapsulation of keys based on the SIDH algorithm, it is proposed to use isogeny of…

It is now well known that ultracontractive properties of semigroups with infinitesimal generator given by an undirected graph Laplacian operator can be obtained through an understanding of the geometry of the underlying infinite weighted…

Let F be the cubic field of discriminant -23 and O its ring of integers. Let Gamma be the arithmetic group GL_2 (O), and for any ideal n subset O let Gamma_0 (n) be the congruence subgroup of level n. In a previous paper, two of us (PG and…

Isogenous elliptic curves have the same conductor but not necessarily the same minimal discriminant ideal. In this article, we explicitly classify all $p^2$-isogenous elliptic curves defined over a number field with the same minimal…

Given a superelliptic curve $Y_K : y^n = f(x)$ over a local field $K$, we describe the theoretical background and an implementation of a new algorithm for computing the $\mathcal{O}_K$-lattice of integral differential forms on $Y_K$. We…

Predictive machine learning models generally excel on in-distribution data, but their performance degrades on out-of-distribution (OOD) inputs. Reliable deployment therefore requires robust OOD detection, yet this is particularly…

We show how the Weil pairing can be used to evaluate the assigned characters of an imaginary quadratic order $\mathcal{O}$ in an unknown ideal class $[\mathfrak{a}] \in \mathrm{Cl}(\mathcal{O})$ that connects two given…

We introduce a persistent Hochschild homology framework for directed graphs. Hochschild homology groups of (path algebras of) directed graphs vanish in degree $i\geq 2$. To extend them to higher degrees, we introduce the notion of…

Spectral characterizations of graphs is an important topic in spectral graph theory which has been studied extensively by researchers in recent years. The study of oriented graphs, however, has received less attention so far. In Qiu et…

We introduce a new class of identifiable DAG models where the conditional distribution of each node given its parents belongs to a family of generalized hypergeometric distributions (GHD). A family of generalized hypergeometric…

The paper concerns several theoretical aspects of oriented supersingular $\ell$-isogeny volcanoes and their relationship to closed walks in the supersingular $\ell$-isogeny graph. Our main result is a bijection between the rims of the union…

We consider the structures formed by isogenies of abelian varieties with polarizations that are not necessarily principal, specifically with the $[\ell]$-polarizations we have previously defined. Our primary interest is in superspecial…

We study a special class of graphs with a strong transience feature called uniform transience. We characterize uniform transience via a Feller-type property and via validity of an isoperimetric inequality. We then give a further…

We define three different isogeny graphs of principally polarized superspecial abelian varieties, prove foundational results on them, and explain their role in number theory and geometry. This is background to joint work with Yevgeny…

Higher-order connectivity patterns such as small induced sub-graphs called graphlets (network motifs) are vital to understand the important components (modules/functional units) governing the configuration and behavior of complex networks.…

While orthogonal drawings have a long history, smooth orthogonal drawings have been introduced only recently. So far, only planar drawings or drawings with an arbitrary number of crossings per edge have been studied. Recently, a lot of…

We give a linear-time algorithm that checks for isomorphism between two 0-1 matrices that obey the circular-ones property. This algorithm leads to linear-time isomorphism algorithms for related graph classes, including Helly circular-arc…

We study the modular curves defined by Weber functions, and associated modular polynomials, action of $\mathrm{SL}_2(\mathbb{Z})$, and parametrizations of elliptic curves with a view to the study of the isogeny graphs that they determine,…