Related papers: Orienting supersingular isogeny graphs

Orthogonal graph drawing has many applications, e.g., for laying out UML diagrams or cableplans. In this paper, we present a new pipeline that draws multigraphs orthogonally, using few bends, few crossings, and small area. Our pipeline…

An oriented graph is an orientation of a simple graph. In 2009, Keevash, K\"{u}hn and Osthus proved that every sufficiently large oriented graph $D$ of order $n$ with $(3n-4)/8$ is Hamiltonian. Later, Kelly, K\"{u}hn and Osthus showed that…

An instance of the maximum mixed graph orientation problem consists of a mixed graph and a collection of source-target vertex pairs. The objective is to orient the undirected edges of the graph so as to maximize the number of pairs that…

Let $n>1$ be an integer such that $X_{0}\!\left( n\right) $ has genus $0$, and let $K$ be a field of characteristic $0$ or relatively prime to $6n$. In this article, we explicitly classify the isogeny graphs of all rational elliptic curves…

We show that an elliptic uniform pseudodifferential operator over a manifold of bounded geometry defines a class in uniform K-homology, and that this class only depends on the principal symbol of the operator.

Fix primes $p$ and $\ell$ with $\ell\neq p$. If $(A,\lambda)$ is a $g$-dimensional principally polarized abelian variety, an $(\ell)^g$-isogeny of $(A,\lambda)$ has kernel a maximal isotropic subgroup of the $\ell$-torsion of $A$; the image…

Homomorphically full graphs are those for which every homomorphic image is isomorphic to a subgraph. We extend the definition of homomorphically full to oriented graphs in two different ways. For the first of these, we show that…

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…

The graph isomorphism problem is a main problem which has numerous applications in different fields. Thus, finding an efficient and easy to implement method to discriminate non-isomorphic graphs is valuable. In this paper, a new method is…

Given an integer $D$ and an ordinary isogeny class of abelian varieties defined over a finite field $\mathbb{F}_q$ with commutative $\mathbb{F}_q$-endomorphism algebra, we provide algorithms for computing all isogenies of degree dividing…

Dynamic Scene Graph Generation (DSGG) focuses on identifying visual relationships within the spatial-temporal domain of videos. Conventional approaches often employ multi-stage pipelines, which typically consist of object detection,…

Initial steps in the study of inner expansion properties of infinite Cayley graphs and other infinite graphs, such as hyperbolic ones, are taken, in a flavor similar to the well-known Lipton-Tarjan square root separation result for planar…

We introduce a new tool for the study of isogeny-based cryptography, namely pairings which are sesquilinear (conjugate linear) with respect to the $\mathcal{O}$-module structure of an elliptic curve with CM by an imaginary quadratic order…

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

The densest subgraph problem, introduced in the 80s by Picard and Queyranne as well as Goldberg, is a classic problem in combinatorial optimization with a wide range of applications. The lowest outdegree orientation problem is known to be…

Out-of-distribution (OOD) generalization has emerged as a critical challenge in graph learning, as real-world graph data often exhibit diverse and shifting environments that traditional models fail to generalize across. A promising solution…

We investigate stable operations in supersingular elliptic cohomology using isogenies of supersingular elliptic curves over finite fields. Our main results provide a framework in which we give a conceptually simple proof of an elliptic…

If $G$ is a graph and $\vec H$ is an oriented graph, we write $G\to \vec H$ to say that every orientation of the edges of $G$ contains $\vec H$ as a subdigraph. We consider the case in which $G=G(n,p)$, the binomial random graph. We…

It is well known that there is a one-to-one correspondence between supersingular $j$-invariants up to the action of $\text{Gal}(\mathbb{F}_{p^2}/\mathbb{F}_p)$ and type classes of maximal orders in $B_{p,\infty}$ by Deuring's theorem.…

We develop a basic theory for divisible design graphs with possible selfloops (LDDG's), and describe two infinite families of such graphs, some members of which are also classical examples of divisible design graphs without loops (DDG's).…