English
Related papers

Related papers: The Algebraic Boundary of Graph Elliptopes

200 papers

Let O be a maximal order in the quaternion algebra B_p over Q ramified at p and infinity. The paper is about the computational problem: Construct a supersingular elliptic curve E over F_p such that End(E) = O. We present an algorithm that…

Number Theory · Mathematics 2014-10-24 Ilya Chevyrev , Steven D. Galbraith

Chordal structure and bounded treewidth allow for efficient computation in numerical linear algebra, graphical models, constraint satisfaction and many other areas. In this paper, we begin the study of how to exploit chordal structure in…

Symbolic Computation · Computer Science 2017-01-03 Diego Cifuentes , Pablo Parrilo

In this article, we construct algebraic equations for a curve C and a map f to an elliptic curve E, with pre-specified branching data. We do this by determining certain relations that the periods of C and E must satisfy and use these…

Number Theory · Mathematics 2014-07-07 Simon Rubinstein-Salzedo

Simultaneous Geometric Embedding (SGE) asks whether, for a given collection of graphs on the same vertex set V, there is an embedding of V in the plane that admits a crossing-free drawing with straightline edges for each of the given…

Computational Geometry · Computer Science 2023-12-15 Benedikt Künzel , Jonathan Rollin

For a (semi-)model category M, we define a notion of a ''homotopy'' Grothendieck topology on M, as well as its associated model category of stacks. We use this to define a notion of geometric stack over a symmetric monoidal base model…

Algebraic Geometry · Mathematics 2007-05-23 Bertrand Toen , Gabriele Vezzosi

Consider an algebraic identity between elliptic modular graphs where several vertices are at fixed locations (and hence unintegrated) while the others are integrated over the toroidal worldsheet. At any unintegrated vertex, we can glue an…

High Energy Physics - Theory · Physics 2023-10-02 Anirban Basu

Let $G$ be a graph with $n$ vertices, and let $A(G)$ and $D(G)$ denote respectively the adjacency matrix and the degree matrix of $G$. Define $$ A_{\alpha}(G)=\alpha D(G)+(1-\alpha)A(G) $$ for any real $\alpha\in [0,1]$. The…

Combinatorics · Mathematics 2019-01-24 Xiaogang Liu , Shunyi Liu

An abstract $n$-polytope $\mathcal{P}$ is a partially-ordered set which captures important properties of a geometric polytope, for any dimension $n$. For even $n \ge 2$, the incidences between elements in the middle two layers of the Hasse…

Combinatorics · Mathematics 2024-06-21 Marston Conder , Isabelle Steinmann

Algebraic cycles on complex projective space P(V) are known to have beautiful and surprising properties. Therefore, when V carries a real or quaternionic structure, it is natural to ask for the properties of the groups of real or…

Algebraic Topology · Mathematics 2012-08-27 H. Blaine Lawson, , Paulo Lima-Filho , Marie-Louise Michelsohn

We consider billiard ball motion in a convex domain of the Euclidean plane bounded by a piece-wise smooth curve influenced by the constant magnetic field. We show that if there exists a polynomial in velocities integral of the magnetic…

Differential Geometry · Mathematics 2016-05-12 Michael , Bialy , Andrey E. Mironov

Let $p>3$ be a fixed prime. For a supersingular elliptic curve $E$ over $\mathbb{F}_p$ with $j$-invariant $j(E)\in \mathbb{F}_p\backslash\{0, 1728\}$, it is well known that the Frobenius map $\pi=((x,y)\mapsto (x^p, y^p))\in…

Number Theory · Mathematics 2019-07-30 Songsong Li , Yi Ouyang , Zheng Xu

This introduction to graphs and graph algebras provides the optimal bound for the number of all paths of length $k$ in a graph with $N\geq k$ edges and no loops. Our proof relies on a construction of a number of terminating algorithms that…

Rings and Algebras · Mathematics 2019-12-12 Piotr M. Hajac , Mariusz Tobolski

We present two algorithms to compute the endomorphism ring of an ordinary elliptic curve E defined over a finite field F_q. Under suitable heuristic assumptions, both have subexponential complexity. We bound the complexity of the first…

Number Theory · Mathematics 2012-06-26 Gaetan Bisson , Andrew V. Sutherland

Let $G$ be a group. The intersection graph $\Gamma(G)$ of $G$ is an undirected graph without loops and multiple edges defined as follows: the vertex set is the set of all proper non-trivial subgroups of $G$, and there is an edge between two…

Group Theory · Mathematics 2018-05-29 Selçuk Kayacan

Box graphs succinctly and comprehensively characterize singular fibers of elliptic fibrations in codimension two and three, as well as flop transitions connecting these, in terms of representation theoretic data. We develop a framework that…

High Energy Physics - Theory · Physics 2014-08-04 Andreas P. Braun , Sakura Schafer-Nameki

For any g>1 we construct a graph G_g in S^3 whose exterior M_g supports a complete finite-volume hyperbolic structure with one toric cusp and a connected geodesic boundary of genus g. We compute the canonical decomposition and the isometry…

Geometric Topology · Mathematics 2007-05-23 Roberto Frigerio

We prove structure theorems for the moduli stack of elliptic curves equipped with $G$-structures, where $G$ is a finite 2-generated metabelian group. In particular, we show that if $G$ has exponent $e$, then there is a subgroup $H\le…

Algebraic Geometry · Mathematics 2017-10-17 William Yun Chen , Pierre Deligne

This paper investigates the rigidity of bordered polyhedral surfaces. Using the variational principle, we show that bordered polyhedral surfaces are determined by boundary value and discrete curvatures on the interior edges. As a corollary,…

Geometric Topology · Mathematics 2023-08-17 Te Ba , Shengyu Li , Yaping Xu

We study the influence of geometry on semilinear elliptic equations of bistable or nonlinear-field type in unbounded domains. We discover a surprising dichotomy between epigraphs that are bounded from below and those that contain a cone of…

Analysis of PDEs · Mathematics 2025-02-25 Henri Berestycki , Cole Graham , Juncheng Wei

Let $G=(V,E)$ be a bipartite graph embedded in a plane (or $n$-holed torus). Two subgraphs of $G$ differ by a {\it $Z$-transformation} if their symmetric difference consists of the boundary edges of a single face---and if each subgraph…

Combinatorics · Mathematics 2007-05-23 Scott Sheffield
‹ Prev 1 8 9 10 Next ›