Related papers: Elementary Matrix Decomposition and The Computatio…
In this paper, the Green's function and decomposition technique is proposed for solving the coupled Lane-Emden equations. This approach depends on constructing Green's function before establishing the recursive scheme for the series…
We describe a general approach for computing generators for elimination ideals associated with matrix and hypermatrix spectral decomposition constraints. We derive from these generators iterative procedures for approximating the spectral…
In this talk we go over several new developments regarding the techniques for a large class of non-hermitian matrix models with unitary randomness (complex random numbers). In particular, we discuss: (a) - A diagrammatic approach based on a…
Decompositions of tensors into factor matrices, which interact through a core tensor, have found numerous applications in signal processing and machine learning. A more general tensor model which represents data as an ordered network of…
We provide novel linear combination of unitaries decompositions for a class of discrete elliptic differential operators. Specifically, Poisson problems augmented with periodic, Dirichlet, Neumann, Robin, and mixed boundary conditions are…
In nonadaptive group testing, the main research objective is to design an efficient algorithm to identify a set of up to $t$ positive elements among $n$ samples with as few tests as possible. Disjunct matrices and separable matrices are two…
The polynomial method from circuit complexity has been applied to several fundamental problems and obtains the state-of-the-art running times. As observed in [Alman and Williams, STOC 2017], almost all applications of the polynomial method…
We analyse the complexity of computing class polynomials, that are an important ingredient for CM constructions of elliptic curves, via complex floating point approximations of their roots. The heart of the algorithm is the evaluation of…
We present a simple yet highly generalizable method for explaining interacting parts within a neural network's reasoning process. First, we design an algorithm based on cross derivatives for computing statistical interaction effects between…
In this paper we give an upper bound for the number of integral points on an elliptic curve E over F_q[T] in terms of its conductor N and q. We proceed by applying the lower bounds for the canonical height that are analogous to those given…
We define pullback and separated presentations of modules over pullback rings, and, if the ring is a pullback of epimorphisms over a semisimple ring, an algorithm reducing such a presentation of a module to an $R$-diagram. The latter is the…
A framework to systematically decouple high order elliptic equations into combination of Poisson-type and Stokes-type equations is developed. The key is to systematically construct the underling commutative diagrams involving the complexes…
This paper deals with three technical ingredients of geometry for quantum information. Firstly, we give an algorithm to obtain diagonal basis matrices for submodules of the Z_{d}-module Z_{d}^{n} and we describe the suitable computational…
In this paper, we give an explicit description of the de Rham and p-adic polylogarithms for elliptic curves using the Kronecker theta function. We prove in particular that when the elliptic curve has complex multiplication and good…
Let F be the cubic field of discriminant -23 and O its ring of integers. Let Gamma be the arithmetic group GL_2 (O), and for any ideal n subset O let Gamma_0 (n) be the congruence subgroup of level n. In a previous paper, two of us (PG and…
In this paper we construct parameterizations of elliptic curves over the rationals which have many consecutive integral multiples. Using these parameterizations, we perform searches in GMP and Magma to find curves with points of small…
We compute the higher ramification groups and the Artin conductors of radical extensions of the rationals. As an application, we give formulas for their discriminant (using the conductor-discriminant formula). The interest in such number…
We give explicit formulae for the logarithmic class group pairing on an elliptic curve defined over a number field. Then we relate it to the descent relative to a suitable cyclic isogeny. This allows us to connect the resulting Selmer group…
We develop a hierarchical matrix construction algorithm using matrix-vector multiplications, based on the randomized singular value decomposition of low-rank matrices. The algorithm uses $\mathcal{O}(\log n)$ applications of the matrix on…
By Mazur's Torsion Theorem, there are fourteen possibilities for the non-trivial torsion subgroup $T$ of a rational elliptic curve. For each $T$, such that $E$ may have additive reduction at a prime $p$, we consider a parameterized family…