Related papers: Isogeny volcanoes
We show that a character sum attached to a family of 3-isogenies defined on the fibers of a certain elliptic surface over $\mathbb{F}_p$ relates to the class number of the quadratic imaginary number field $\Q(\sqrt{-p})$. In this sense,…
When the theory of Leavitt path algebras was already quite advanced, it was discovered that some of the more difficult questions were susceptible to a new approach using topological groupoids. The main result that makes this possible is…
Let $n$ be an integer such that the modular curve $X_0(n)$ is hyperelliptic of genus $\ge2$ and such that the Jacobian of $X_0(n)$ has rank $0$ over $\mathbb Q$. We determine all points of $X_0(n)$ defined over quadratic fields, and we give…
In this paper we consider the isoptic curves on the 2-dimensional geometries of constant curvature $\bE^2,~\bH^2,~\cE^2$. The topic is widely investigated in the Euclidean plane $\bE^2$ see for example \cite{CMM91} and \cite{Wi} and the…
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…
In supersingular isogeny-based cryptography, the path-finding problem reduces to the endomorphism ring problem. Can path-finding be reduced to knowing just one endomorphism? It is known that a small endomorphism enables polynomial-time…
Various simplicial complexes can be associated with a graph. Box complexes form an important families of such simplicial complexes and are especially useful for providing lower bounds on the chromatic number of the graph via some of their…
These lecture notes are a personal introduction to signed graphs, concentrating on the aspects that have been most persistently interesting to me. They are just a few corners of signed graph theory; I am leaving out a great deal. The…
Quantum graphs can be extended to scattering systems when they are connected by leads to infinity. It is shown that for certain extensions, the scattering matrices of isospectral graphs are conjugate to each other and their poles…
The shift toward more renewable energy sources and distributed generation in smart grids has underscored the significance of modeling and analyzing modern power systems as cyber-physical systems (CPS). This transformation has highlighted…
In this survey, we explore recent literature on finding the cores of higher graphs using geometric and topological means. We study graphs, hypergraphs, and simplicial complexes, all of which are models of higher graphs. We study the notion…
Two of the natural topologies for infinite graphs with edge-ends are Etop and Itop. In this paper, we study and characterize them. We show that Itop can be constructed by inverse limits of inverse systems of graphs with finitely many…
We study topological properties of the graph topology.
We give explicit formulas for the number of distinct elliptic curves over a finite field, up to isomorphism, in the families of Legendre, Jacobi, Hessian and generalized Hessian curves.
We prove that there is an algorithm to determine if a given finite graph is an induced subgraph of a given curve graph.
This article deals with the Galois representation attached to elliptic curves with an isogeny of prime degree over a number field. We first determine uniform criteria for the irreducibility of Galois representations attached to elliptic…
We use fine curve graph tools to prove that there exist parabolic isometries of graphs of curves associated to surfaces of infinite type.
The fundamental role of on-shell diagrams in quantum field theory has been recently recognized. On-shell diagrams, or equivalently bipartite graphs, provide a natural bridge connecting gauge theory to powerful mathematical structures such…
Construction of non-isomorphic cospectral graphs is a nontrivial problem in spectral graph theory specially for large graphs. In this paper, we establish that graph theoretical partial transpose of a graph is a potential tool to create…
We present an algorithm for computing the Berkovich skeleton of a superelliptic curve $y^n=f(x)$ over a valued field. After defining superelliptic weighted metric graphs, we show that each one is realizable by an algebraic superelliptic…