Related papers: The Discrete Lambert Map
Let $p$ be an odd prime. For each integer $a$ with $p\nmid a$, the famous Zolotarev's Lemma says that the Legendre symbol $(\frac{a}{p})$ is the sign of the permutation of $\Z/p\Z$ induced by multiplication by $a$. The extension of…
Given a polynomial $x \in {\mathbb R}^n \mapsto p(x)$ in $n=2$ variables, a symbolic-numerical algorithm is first described for detecting whether the connected component of the plane sublevel set ${\mathcal P} = \{x : p(x) \geq 0\}$…
In this Letter we propose a systematic approach for detecting and calculating preserved measures and integrals of a rational map. The approach is based on the use of cofactors and Discrete Darboux Polynomials and relies on the use of…
Assuming GRH, we present an algorithm which inputs a prime $p$ and outputs the set of fundamental discriminants $D<0$ such that the reduction map modulo a prime above $p$ from elliptic curves with CM by $\order_{D}$ to supersingular…
We propose various strategies for improving the computation of discrete logarithms in non-prime fields of medium to large characteristic using the Number Field Sieve. This includes new methods for selecting the polynomials; the use of…
In a context of illiquidity, the reservation price is a well-accepted alternative to the usual martingale approach which does not apply. However, this price is not available in closed form and requires numerical methods such as Monte Carlo…
Let p be an odd prime. Let K_p = \Q(zeta_p) be the p-cyclotomic field. We apply a Kummer and Stickelberger relation of K_p to some singular not primary numbers A of K_p connected to p-class group of K_p and prove they verify the congruence…
Suppose $X$ is a 1-connected simplicial set with finitely many nondegenerate simplices. We give an effective algorithm to calculate a simplicial set with the $n$-type of the loop space $\Omega X$. Iterating gives an algorithm to calculate…
A discrete map based on the sum of an integer's distinct primes factors and the sum of its other factors is defined and its iteration is studied.
The aim of this paper is to extend some arithmetic results on elliptic modular forms to the case of Hilbert modular forms. Among these results let's mention : (1) the control of the image of the Galois representation modulo $p$, (2) Hida's…
We investigate the numerical approximation to the Euler-Bernoulli (E-B) beams and plates with nonlinear nonlocal strong damping, which describes the damped mechanical behavior of beams and plates in real applications. We discretize the…
In this paper, for any odd prime $p$ and an integer $m\ge 3$, several classes of linear codes with $t$-weight $(t=3,5,7)$ are obtained based on some defining sets, and then their complete weight enumerators are determined explicitly by…
We present a study on the use of Pell hyperbolas in cryptosystems with security based on the discrete logarithm problem. Specifically, after introducing the group's structure over generalized Pell conics (and also giving the explicit…
A succinct histogram captures frequent items and their frequencies across clients and has become increasingly important for large-scale, privacy-sensitive machine learning applications. To develop a rigorous framework to guarantee privacy…
We consider the problem of secure distributed matrix multiplication (SDMM) in which a user wishes to compute the product of two matrices with the assistance of honest but curious servers. We construct polynomial codes for SDMM by studying a…
In this paper we shall investigate the problem of the representation of the number of integral points of an elliptic curve modulo a prime number p. We present a way of expressing an exponential sum which involves polynomials of third…
We follow the ideas of Darmon's program for solving infinite families of generalised Fermat equations of signatures $(p,p,r)$ and $(r,r,p)$, where, $r$ is a fixed prime and $p$ is varying. We do so by introducing a common framework for both…
The theory of matrix splitting is a useful tool for finding solution of rectangular linear system of equations, iteratively. The purpose of this paper is two-fold. Firstly, we revisit theory of weak regular splittings for rectangular…
We present an ordinary differential equations approach to the analysis of algorithms for constructing $l_1$ minimizing solutions to underdetermined linear systems of full rank. It involves a relaxed minimization problem whose minimum is…
The aim of this paper is the derivation of structure preserving schemes for the solution of the EPDiff equation, with particular emphasis on the two dimensional case. We develop three different schemes based on the Discrete Variational…