English
Related papers

Related papers: On towers of Isogeny graphs with full level struct…

200 papers

We show that one can find two nonisomorphic curves over a field K that become isomorphic to one another over two finite extensions of K whose degrees over K are coprime to one another. More specifically, let K_0 be an arbitrary prime field…

Algebraic Geometry · Mathematics 2010-01-23 Daniel Goldstein , Robert M. Guralnick , Everett W. Howe , Michael E. Zieve

Let $A/\overline{\mathbb{F}}\_p$ and $A'/\overline{\mathbb{F}}\_p$ be supersingular principally polarized abelian varieties of dimension $g>1$. For any prime $\ell \ne p$, we give an algorithm that finds a path $\phi \colon A \rightarrow…

Cryptography and Security · Computer Science 2020-01-30 Craig Costello , Benjamin Smith

We prove that every oriented tree on $n$ vertices with bounded maximum degree appears as a spanning subdigraph of every directed graph on $n$ vertices with minimum semidegree at least $n/2+o(n)$. This can be seen as a directed graph…

Combinatorics · Mathematics 2026-05-20 Richard Mycroft , Tássio Naia

We construct and study a class of algebras associated to generalized layered graphs, i.e. directed graphs with a ranking function on their vertices. Each finite directed acyclic graph admits countably many structures of a generalized…

Combinatorics · Mathematics 2008-06-11 Vladimir Retakh , Robert Lee Wilson

We call a real algebraic hypersurface in $(\mathbb{C}^*)^n$ simplicial if it is given by a real Laurent polynomial in $n$-variables that has exactly $n+1$ monomials with non-zero coefficients and such that the convex hull in $\mathbb{R}^n$…

Algebraic Geometry · Mathematics 2021-05-26 Charles Arnal

We describe two constructions of (very) dense graphs which are edge disjoint unions of large {\em induced} matchings. The first construction exhibits graphs on $N$ vertices with ${N \choose 2}-o(N^2)$ edges, which can be decomposed into…

Combinatorics · Mathematics 2011-11-09 Noga Alon , Ankur Moitra , Benny Sudakov

Let l be an odd prime. We will construct a tower of connected regular Ramanujan graph of degree l+1 from of modular curves. This supplies an example of a collection of graphs whose discrete Cheeger constants are bounded by (sqrt{l}-1)^{2}/2…

Algebraic Geometry · Mathematics 2019-05-10 Kennichi Sugiyama

A directed graph is set-homogeneous if, whenever U and V are isomorphic finite subdigraphs, there is an automorphism g of the digraph with U^g=V. Here, extending work of Lachlan on finite homogeneous digraphs, we classify finite…

Combinatorics · Mathematics 2010-11-19 Robert Gray , Dugald Macpherson , Cheryl E. Praeger , Gordon F. Royle

We build a purely inseparable Galois theory using non-derived commutative algebra. Our theory works on fields and on normal varieties. It says that a purely inseparable morphism corresponds to a finite (saturated) subalgebra of differential…

Algebraic Geometry · Mathematics 2025-10-08 Przemysław Grabowski

In earlier work, we introduced the `Monster tower', a tower of fibrations associated to planar curves. We constructed an algorithm for classifying its points with respect to the equivalence relation generated by the action of the contact…

Differential Geometry · Mathematics 2009-12-17 Alex L. Castro , Richard Montgomery

The aim of the inverse Galois problem is to find extensions of a given field whose Galois group is isomorphic to a given group. In this article, we are interested in subgroups of GL(2,Z/nZ) where n is an integer. We know that, in general,…

Number Theory · Mathematics 2023-10-11 Zoé Yvon

We provide sharp bounds for the isoperimetric constants of infinite plane graphs (tessellations) with bounded vertex and face degrees. For example, if $G$ is a plane graph satisfying the inequalities $p_1 \leq \mbox{deg}\ v \leq p_2$ for $v…

Combinatorics · Mathematics 2024-08-20 Byung-Geun Oh

We develop an algorithm to test whether a non-CM elliptic curve $E/\mathbb{Q}$ gives rise to an isolated point of any degree on any modular curve of the form $X_1(N)$. This builds on prior work of Zywina which gives a method for computing…

We give a new way to study recursive towers of curves over a finite field, defined from a bottom curve $\Cun$ and a correspondence $\Cdeux$ on $\Cun$.In particular, we study their asymptotic behavior. A close examination of singularities…

Number Theory · Mathematics 2014-03-19 Emmanuel Hallouin , Marc Perret

It is known that any isogeny graph consisting of ordinary elliptic curves over $\mathbb{F}_q$ with $q = p$ or $p^2$ has a special structure, called a volcano graph. We have a bound $h < \log_2 \sqrt{4q}$ of a height $h$ of the $2$-volcano…

Number Theory · Mathematics 2024-09-04 Yuji Hashimoto , Koji Nuida

Topological drawings are representations of graphs in the plane, where vertices are represented by points, and edges by simple curves connecting the points. A drawing is simple if two edges intersect at most in a single point, either at a…

Computational Geometry · Computer Science 2022-09-08 Alfredo García , Alexander Pilz , Javier Tejel

Let l be a prime number and let E and E' be l-isogenous elliptic curves defined over Q. In this paper we determine the proportion of primes p for which E(F_p) is isomorphic to E'(F_p). Our techniques are based on those developed in…

Number Theory · Mathematics 2026-01-01 John Cullinan , Nathan Kaplan

In this article we construct for any prime power $q$ and odd $n \ge 5$, a new $\mathbb{F}_{q^{2n}}$-maximal curve $\mathcal X_n$. Like the Garcia--G\" uneri--Stichtenoth maximal curves, our curves generalize the Giulietti--Korchm\'aros…

Algebraic Geometry · Mathematics 2018-06-27 Peter Beelen , Maria Montanucci

For various positive integers $n$, we show the existence of infinite families of elliptic curves over $\mathbb{Q}$ with $n$-division fields, $\mathbb{Q}(E[n])$, that are not monogenic, i.e., the ring of integers does not admit a power…

Number Theory · Mathematics 2020-07-28 Hanson Smith

We study pseudo-geometric strongly regular graphs whose second subconstituent with respect to a vertex is a cover of a strongly regular graph or a complete graph. By studying the structure of such graphs, we characterize all graphs…

Combinatorics · Mathematics 2026-04-10 Edwin van Dam , Krystal Guo