相关论文: Isogeny graphs with level structures arrising from…
We show that there is a collection of subgroups of the mapping class group of a surface such that the associated coset intersection complex is quasi-isometric and homotopy equivalent to the curve complex. Moreover, we prove that these two…
Amorphous photonic structures are mesoscopic optical structures described by electrical permittivity distributions with underlying spatial randomness. They offer a unique platform for studying a broad set of electromagnetic phenomena,…
We exhibit a family of dynamical systems arising from rational points on elliptic curves in an attempt to mimic the familiar toral automorphisms. At the non-archimedean primes, a continuous map is constructed on the local elliptic curve…
Many applications, ranging from natural to social sciences, rely on graphlet analysis for the intuitive and meaningful characterization of networks employing micro-level structures as building blocks. However, it has not been thoroughly…
We consider various equivalence relations on the set of homotopy classes of curves on a hyperbolic surface based on topological, algebraic, and geometric structures. The purpose of this work is to determine the relationship between these…
We show that the distribution of elliptic curves in isogeny classes of curves with a given value of the Frobenius trace $t$ becomes close to uniform even when $t$ is averaged over very short intervals inside the Hasse-Weil interval.
Algebraic curves have a discrete analogue in finite graphs. Pursuing this analogy we prove a Torelli theorem for graphs. Namely, we show that two graphs have the same Albanese torus if and only if the graphs obtained from them by…
We introduce a construction that gives rise to a variety of "geometric" finite random graphs, and describe connections to the Poisson boundary, Naim's kernel, and Sznitman's random interlacements.
We consider the graph class Grounded-L corresponding to graphs that admit an intersection representation by L-shaped curves, where additionally the topmost points of each curve are assumed to belong to a common horizontal line. We prove…
We apply some basic notions from combinatorial topology to establish various algebraic properties of edge ideals of graphs and more general Stanley-Reisner rings. In this way we provide new short proofs of some theorems from the literature…
We show how the Abel-Jacobi map provides all the principal properties of an ample family of integrable mechanical systems associated to hyperelliptic curves. We prove that derivative of the Abel-Jacobi map is just the St\"{a}ckel matrix,…
We give a sufficient condition under which the fundamental group of a reglued graph of surfaces is hyperbolic. A reglued graph of surfaces is constructed by cutting a fixed graph of surfaces along the edge surfaces, then regluing by…
Let $E_{\lambda}$ be the Legendre family of elliptic curves with equation $Y^2=X(X-1)(X-\lambda)$. Given a curve $\mathcal{C}$, satisfying a condition on the degrees of some of its coordinates and parametrizing $m$ points $P_1, \ldots, P_m…
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…
Various connections between the theory of permutation groups and the theory of topological groups are described. These connections are applied in permutation group theory and in the structure theory of topological groups. The first draft of…
This article aims to propose a novel analytical model for anisotropic multi-layer elliptical structures incorporating graphene layers. The multi-layer structure is formed of various magnetic materials. An external magnetic bias has been…
In this work, we study the asymptotic geometry of the mapping class group and Teichmueller space. We introduce tools for analyzing the geometry of `projection' maps from these spaces to curve complexes of subsurfaces; from this we obtain…
A class of random graphs is introduced and studied. The graphs are constructed in an algorithmic way from five motifs which were found in [Milo R., Shen-Orr S., Itzkovitz S., Kashtan N., Chklovskii D., Alon U., Science, 2002, 298, 824-827].…
The enhanced power graph of a finite group $G$, denoted by $\mathcal{P}_E(G)$, is the simple undirected graph whose vertex set is $G$ and two distinct vertices $x, y$ are adjacent if $x, y \in \langle z \rangle$ for some $z \in G$. In this…
We describe the use of explicit isogenies to translate instances of the Discrete Logarithm Problem (DLP) from Jacobians of hyperelliptic genus 3 curves to Jacobians of non-hyperelliptic genus 3 curves, where they are vulnerable to faster…