Related papers: Cycles in the supersingular $\ell$-isogeny graph a…

Erasures are a common problem that arises while signals or data are being transmitted. A profound challenge in frame theory is to find the optimal dual frames ($OD$-frames) to minimize the reconstruction error if erasures occur. In this…

The manuscript considers mathematical models for creating a topological drawing of a graph based on the methods of G. Ringel's vertex rotation theory. An algorithm is presented for generating a topological drawing of a flat part of a graph…

We establish necessary and sufficient conditions for the existence of a decomposition of a complete multigraph into edge-disjoint cycles of specified lengths, or into edge-disjoint cycles of specified lengths and a perfect matching.

The independence polynomial of a graph is the generating polynomial for the number of independent sets of each size. Two graphs are said to be \textit{independence equivalent} if they have equivalent independence polynomials. We extend…

We present algorithms which, given a genus 2 curve $C$ defined over a finite field and a quartic CM field $K$, determine whether the endomorphism ring of the Jacobian $J$ of $C$ is the full ring of integers in $K$. In particular, we present…

Frucht showed that, for any finite group $G$, there exists a cubic graph such that its automorphism group is isomorphic to $G$. For groups generated by two elements we simplify his construction to a graph with fewer nodes. In the general…

We focus on the algorithm underlying the main result of [A. Mestre, R. Oeckl, Generating loop graphs via Hopf algebra in quantum field theory. J. Math. Phys., 47, 122302, 2006]. This is an algebraic formula to generate all connected graphs…

We construct infinite families of pairs of (geometrically non-isogenous) elliptic curves defined over $\mathbb{Q}$ with $12$-torsion subgroups that are isomorphic as Galois modules. This extends previous work of Chen and Fisher where it is…

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…

For two positive integers $k$ and $\ell$, a $(k \times \ell)$-spindle is the union of $k$ pairwise internally vertex-disjoint directed paths with $\ell$ arcs between two vertices $u$ and $v$. We are interested in the (parameterized)…

It is well known that the edge vector space of an oriented graph can be decomposed in terms of cycles and cocycles (alias cuts, or bonds), and that a basis for the cycle and the cocycle spaces can be generated by adding and removing edges…

Given a non-isotrivial elliptic curve over an arithmetic surface, one obtains a lisse $\ell$-adic sheaf of rank two over the surface. This lisse sheaf has a number of straightforward properties: cyclotomic determinant, finite ramification,…

We produce explicit elliptic curves over \Bbb F_p(t) whose Mordell-Weil groups have arbitrarily large rank. Our method is to prove the conjecture of Birch and Swinnerton-Dyer for these curves (or rather the Tate conjecture for related…

Motivated by very large-scale communication networks, we newly introduce exponentiation of graphs. Using the exponential operation on graphs, we can construct various graphs of multi-exponential order with logarithmic diameter. We show that…

For a product $E_1\times E_2$ of two elliptic curves over a $p$-adic field with good supersingular reduction, we produce infinitely many rational equivalences in the Chow group $\mathrm{CH}_0(X)$ of zero cycles via genus 2 covers of $E_1$…

The enumeration of Hamiltonian cycles on 2n*2n grids of nodes is a longstanding problem in combinatorics. Previous work has concentrated on counting all cycles. The current work enumerates nonisomorphic cycles -- that is, the number of…

We present several results in extremal graph and hypergraph theory of topological nature. First, we show that if $\alpha>0$ and $\ell=\Omega(\frac{1}{\alpha}\log\frac{1}{\alpha})$ is an odd integer, then every graph $G$ with $n$ vertices…

By the Mordell-Weil theorem the group of Q(z)-rational points of an elliptic curve is finitely generated. It is not known whether the rank of this group can get arbitrary large as the curve varies. Mestre and Nagao have constructed examples…

A cycle of length $t$ in a hypergraph is an alternating sequence $v_1,e_1,v_2\dots,v_t,e_t$ of distinct vertices $v_i$ and distinct edges $e_i$ so that $\{v_i,v_{i+1}\}\subseteq e_i$ (with $v_{t+1}:=v_1$). Let $\lambda K_n^h$ be the…

We consider a product $X=E_1\times\cdots\times E_d$ of elliptic curves over a finite extension $K$ of $\mathbb{Q}_p$ with a combination of good or split multiplicative reduction. We assume that at most one of the elliptic curves has…