相关论文: Orienting supersingular isogeny graphs
We prove that the set of orthogonal separable coordinates on an arbitrary (pseudo-)Riemannian manifold carries a natural structure of a projective variety, equipped with an action of the isometry group. This leads us to propose a new,…
In this paper we deal with a subclass of chordal graphs, which are simultaneously strictly chordal and interval, the strictly interval graphs. We present a new characterization of the class that leads to a simple linear recognition…
We develop a direct method to recover an orthoalgebra from its poset of Boolean subalgebras. For this a new notion of direction is introduced. Directions are also used to characterize in purely order-theoretic terms those posets that are…
Intersection graphs are well-studied in the area of graph algorithms. Some intersection graph classes are known to have algorithms enumerating all unlabeled graphs by reverse search. Since these algorithms output graphs one by one and the…
We show that the groupoids of two directed graphs are isomorphic if and only if the two graphs are orbit equivalent by an orbit equivalence that preserves isolated eventually periodic points. We also give a complete description of the…
We unify several seemingly different graph and digraph classes under one umbrella. These classes are all broadly speaking different generalizations of interval graphs, and include, in addition to interval graphs, also adjusted interval…
We classify isomorphism-invariant random digraphs according to where randomness resides, namely, arcs, vertices, and vertices and arcs together which in turn yield arc random digraphs (ARD), vertex random digraphs (VRD) and vertex-arc…
Differential equations where the graph of some derivative of a function is composed of a finite number of similarity transformations of the graph of the function itself are defined. We call these self-similar differential equations (SSDEs)…
Let $p$ be an odd prime, and $D_{2p}=\langle \tau,\sigma\mid \tau^p=\sigma^2=e,\sigma\tau\sigma=\tau^{-1}\rangle$ the dihedral group of order $2p$. In this paper, we provide the number of (connected) Cayley (di-)graphs on $D_{2p}$ up to…
We develop a new approach to the study of spectral asymmetry. Working with the operator $\operatorname{curl}:=*\mathrm{d}$ on a connected oriented closed Riemannian 3-manifold, we construct, by means of microlocal analysis, the asymmetry…
The subgraph isomorphism finding problem is a well-studied problem in the field of computer science and graph theory, and it aims to enumerate all instances of a query graph in the respective data graph. In this paper, we propose an…
In the current work we are concerned with sequences of graphs having a grid geometry, with a uniform local structure in a bounded domain $\Omega\subset {\mathbb R}^d$, $d\ge 1$. When $\Omega=[0,1]$, such graphs include the standard Toeplitz…
Erd{\H o}s (1963) initiated extensive graph discrepancy research on 2-edge-colored graphs. Gishboliner, Krivelevich, and Michaeli (2023) launched similar research on oriented graphs. They conjectured the following extension of Dirac's…
Let $\mathcal{D}$ be a weighted oriented graph and $I(\mathcal{D})$ be its edge ideal. In this paper, we investigate the Betti numbers of $I(\mathcal{D})$ via upper-Koszul simplicial complexes, Betti splittings and the mapping cone…
Orientable sequences of order n are infinite periodic sequences with symbols drawn from a finite alphabet of size k with the property that any particular subsequence of length n occurs at most once in a period in either direction. They were…
A directed hypergraph (dihypergraph) consists of a set of vertices and a set of hyperarcs, where each hyperarc is partitioned into a head and a tail. Directed hypergraphs are useful in many applications, including the study of chemical…
Isogenies occur throughout the theory of elliptic curves. Recently, the cryptographic protocols based on isogenies are considered as candidates of quantum-resistant cryptographic protocols. Given two elliptic curves $E_1, E_2$ defined over…
In this paper, we introduce the notion of a dual topological graph of a given topological graph, and show that it defines a C*-algebra isomorphic to the C*-algebra of the given one. Repeating to take a dual, and taking a projective limit,…
We develop a new approach for constructing normalized differentials on hyperelliptic curves of infinite genus and obtain uniform asymptotic estimates for the distribution of their zeros.
In this Note we present an expository account for \dieu modules and revisit supersingular abelian varieties. We give a simple proof of the uniqueness of products of two or more supersingular elliptic curves (a theorem due to Deligne, Ogus…