We reduced the unsolved problem of Evans triangles to the problem of nding rational points on a class of elliptic curves, the twisted Edwards curves En. We proved that the set of all Evans triangles with a given ratio is isomorphic to a quotient group of En(Q). After this, using Sage, we can solve the Evans problem for an amount of cases within the capacity of computer. Even without the help of a computer, we can still obtain a large class of new Evans triangles, and nd an eective way to test if the rank of an Edwards curve is positive or not.

No abstract uploaded!

For a fractal Schrodinger operator with a continuous potential and a coupling parameter, we obtain an analog of a semi-classical asymptotic formula for the number of bound states as the parameter tends to infinity. We also study Bohr's formula for Schrodinger operators on blowups of self-similar sets. For a Schrodinger operator defined by a fractal measure and a locally bounded potential that tends to infinity, we derive an analog of Bohr's formula under various assumptions. We demonstrate how these results can be applied to self-similar measures with overlaps, including the infinite Bernoulli convolution associated with the golden ratio, a family of convolutions of Cantor-type measures, and a family of measures that we call essentially of finite type.

Computing discrete geodesic distance over triangle meshes is one of the fundamental problems in computational geometry and computer graphics. In this problem, an effective window pruning strategy can significantly affect the actual running time. Due to its importance, we conduct an in-depth study of window pruning operations in this paper, and produce an exhaustive list of scenarios where one window can make another window partially or completely redundant. To identify a maximal number of redundant windows using such pairwise cross checking, we propose a set of procedures to synchronize local window propagation within the same triangle by simultaneously propagating a collection of windows from one triangle edge to its two opposite edges. On the basis of such synchronized window propagation, we design a new geodesic computation algorithm based on a triangle-oriented region growing scheme. Our geodesic algorithm can remove most of the redundant windows at the earliest possible stage, thus significantly reducing computational cost and memory usage at later stages. In addition, by adopting triangles instead of windows as the primitive in propagation management, our algorithm significantly cuts down the data management overhead. As a result, it runs 4-15 times faster than MMP and ICH algorithms, 2-4 times faster than FWP-MMP and FWP-CH algorithms, and also incurs the least memory usage.

We introduce K-theoretic Gromov-Witten invariants of algebraic orbifold target spaces. Using the methods developed by Givental-Tonita we characterize Giventals Lagrangian cone of quantum K theory of orbifolds in terms of the cohomological cone.