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

Let $G$ be a graph each edge $e$ of which is given a length $\ell(e)$. This naturally induces a distance $d_\ell(x,y)$ between any two vertices $x,y$, and we let $\ell-TOP$ denote the completion of the corresponding metric space. It turns…

The classical cycle class map for a smooth complex variety sends cycles in the Chow ring to cycles in the singular cohomology ring. We study two cycle class maps for smooth real varieties: the map from the I-cohomology ring to singular…

Let $\mathcal X_g$ be a genus $g\geq 2$ superelliptic curve, $F$ its field of moduli, and $K$ the minimal field of definition. In this short note we construct an equation of the curve $\mathcal X_g$ over its minimal field of definition $K$…

Let f(x) be a polynomial of degree at least 5 with complex coefficients and without repeated roots. Let p be an odd prime. Suppose that all the coefficients of f(x) lie in a subfield K such that: 1) K contains a primitive p-th root of…

We study automorphism groups of fibered surfaces for finite cyclic covering fibrations of an elliptic surface. We estimate the order of a finite subgroup of automorphism groups in terms of the genus of the fiber, the genus of the base…

This paper presents algorithmic approaches to study superspecial hyperelliptic curves. The algorithms proposed in this paper are: an algorithm to enumerate superspecial hyperelliptic curves of genus $g$ over finite fields $\mathbb{F}_q$,…

For two integers $k$ and $\ell$, an $(\ell \text{ mod }k)$-cycle means a cycle of length $m$ such that $m\equiv \ell\pmod{k}$. In 1977, Bollob\'{a}s proved a conjecture of Burr and Erd\H{o}s by showing that if $\ell$ is even or $k$ is odd,…

We study experiment design for unique identification of the causal graph of a simple SCM, where the graph may contain cycles. The presence of cycles in the structure introduces major challenges for experiment design as, unlike acyclic…

Given an undirected graph $G=(V,E)$ and vertices $s,t,w_1,w_2\in V$, we study finding whether there exists a simple path $P$ from $s$ to $t$ such that $w_1,w_2 \in P$. As a sub-problem, we study the question: given an undirected graph and…

An elliptic curve $E$ defined over a $p$-adic field $K$ with a $p$-isogeny $\phi:E\rightarrow E^\prime$ comes equipped with an invariant $\alpha_{\phi/K}$ that measures the valuation of the leading term of the formal group homomorphism…

In general the endomorphisms of a non-abelian group do not form a ring under the operations of addition and composition of functions. Several papers have dealt with the ring of functions defined on a group which are endomorphisms when…

We give explicit formulas for the number of distinct elliptic curves over a finite field, up to isomorphism, in two families of curves introduced by C.~Doche, T.~Icart and D.~R. Kohel.

We show that every elliptic curve over a finite field of odd characteristic whose number of rational points is divisible by 4 is isogenous to an elliptic curve in Legendre form, with the sole exception of a minimal respectively maximal…

A cycle $C$ of a graph $G$ is \emph{isolating} if every component of $G-V(C)$ is a single vertex. We show that isolating cycles in polyhedral graphs can be extended to larger ones: every isolating cycle $C$ of length $6 \leq |E(C)| < \left…

We compute the topological monodromy of every family of complete intersection curves. Like in the case of plane curves previously treated by the second-named author, we find the answer is given by the $r$-spin mapping class group associated…

Motivated by longstanding conjectures regarding decompositions of graphs into paths and cycles, we prove the following optimal decomposition results for random graphs. Let $0<p<1$ be constant and let $G\sim G_{n,p}$. Let $odd(G)$ be the…

Let $F$ be a $2$-regular graph of order $v$. The Oberwolfach problem $OP(F)$, posed in 1967 and still open, asks for a decomposition of $K_v$ into copies of $F$. In this paper we show that $OP(F)$ has a solution whenever $F$ has a…

In this paper we study the dynamics of rational maps induced by endomorphisms of ordinary elliptic curves defined over finite fields.

A Hamiltonian path (a Hamiltonian cycle) in a graph is a path (a cycle, respectively) that traverses all of its vertices. The problems of deciding their existence in an input graph are well-known to be NP-complete, in fact, they belong to…

Chevyrev and Galbraith recently devised an algorithm which inputs a maximal order of the quaternion algebra ramified at one prime and infinity and constructs a supersingular elliptic curve whose endomorphism ring is precisely this maximal…