相关论文: Elementary Matrix Decomposition and The Computatio…

We provide quantitative inductive estimates for Green's functions of matrices with (sub)expoentially decaying off diagonal entries in higher dimensions. Together with Cartan's estimates and discrepancy estimates, we establish explicit…

We prove formulas for the p-adic logarithm of quaternionic Darmon points on p-adic tori and modular abelian varieties over Q having purely multiplicative reduction at p. These formulas are amenable to explicit computations and are the first…

The main purpose of this paper is to develop new algorithms for computing invariant rings in a general setting. This includes invariants of nonreductive groups but also of groups acting on algebras over certain rings. In particular, we…

Let $E$ be an elliptic curve over a number field $K$. Descent calculations on $E$ can be used to find upper bounds for the rank of the Mordell-Weil group, and to compute covering curves that assist in the search for generators of this…

Coleman's theory of p-adic integration figures prominently in several number-theoretic applications, such as finding torsion and rational points on curves, and computing p-adic regulators in K-theory (including p-adic heights on elliptic…

We develop the symplectic elimnation algorithm. This algorithm using simple row operations reduce a symplectic matrix to a diagonal matrix. This algorithm gives rise to a decomposition of an arbitrary matrix into a product of a symplectic…

Given a subgroup $\Gamma$ of rational points on an elliptic curve $E$ defined over ${\mathbf Q}$ of rank $r \ge 1$ and any sufficiently large $x \ge 2$, assuming that the rank of $\Gamma$ is less than $r$, we give upper and lower bounds on…

We present a specialized point-counting algorithm for a class of elliptic curves over F\_{p^2} that includes reductions of quadratic Q-curves modulo inert primes and, more generally, any elliptic curve over F\_{p^2} with a low-degree…

The primary objective of this paper is the study of different instances of the elliptic Stark conjectures of Darmon, Lauder and Rotger, in a situation where the elliptic curve attached to the modular form $f$ has split multiplicative…

Elliptic curves with a known number of points over a given prime field with n elements are often needed for use in cryptography. In the context of primality proving, Atkin and Morain suggested the use of the theory of complex multiplication…

Let $F/F_0$ be a quadratic extension of totally real number fields, and let $E$ be an elliptic curve over $F$ which is isogenous to its Galois conjugate over $F_0$. A quadratic extension $M/F$ is said to be almost totally complex (ATC) if…

We show how to construct Darmon points on elliptic curves over totally real fields.

This paper provides a comprehensive and detailed derivation of the backpropagation algorithm for graph convolutional neural networks using matrix calculus. The derivation is extended to include arbitrary element-wise activation functions…

We give new bounds for the number of integral points on elliptic curves. The method may be said to interpolate between approaches via diophantine techniques ([BP], [HBR]) and methods based on quasiorthogonality in the Mordell-Weil lattice…

We propose a new methodology for parametric domain decomposition using iterative principal component analysis. Starting with iterative principle component analysis, the high dimension manifold is reduced to the lower dimension manifold.…

Polygon clipping is a frequent operation in Arbitrary Lagrangian-Eulerian methods, Computer Graphics, GIS, and CAD. In fact, clipping algorithms are said to be one of the most important operations in computer graphics. Thus, efficient and…

Matrices are typically considered over fields or rings. Motivated by applications in parametric differential equations and data-driven modeling, we suggest to study matrices with entries from a Hilbert space and present an elementary theory…

We extend the notion of anti-unification to cover equational theories and present a method based on regular tree grammars to compute a finite representation of E-generalization sets. We present a framework to combine Inductive Logic…

Many data analysis applications deal with large matrices and involve approximating the matrix using a small number of ``components.'' Typically, these components are linear combinations of the rows and columns of the matrix, and are thus…

As a subproduct of the Schoof-Elkies-Atkin algorithm to count points on elliptic curves defined over finite fields of characteristic p, there exists an algorithm that computes, for l an Elkies prime, l-torsion points in an extension of…