Related papers: Notes on Hallgren's efficient quantum algorithm fo…
We propose new quantum algorithms to solve the regulator and the principal ideal problem in a real-quadratic number field. We improve the algorithms proposed by Hallgren by using two different techniques. The first improvement is the usage…
Let $a,b,c $ be any positive integers such that $c\mid ab$ and $d_i^\pm$ is a square free positive integer of the form $d_i^\pm=a^{2k} b^{2l}\pm i c^m$ where $k,l \geq m$ and $i=1,2.$ The main focus of this paper to find the fundamental…
The purpose of this article is to give the solutions of the inverse problem for Pellian equations. For any rational number $0< a/b < 1$, the fundamental discriminants $D$ satisfying $(\lfloor \sqrt{D} \rfloor b + a)^2 - D b^2 = 4$ are given…
Infrastructures are group-like objects that make their appearance in arithmetic geometry in the study of computational problems related to number fields and function fields over finite fields. The most prominent computational tasks of…
The polynomial Pell equation is \[P^2 - D Q^2 = 1\] where $D$ is a given integer polynomial and the solutions $P, Q$ must be integer polynomials. A classical paper of Nathanson \cite{Nat} solved it when $D(x) = x^2 + d$. We show that the…
In the classical theory, a famous by-product of the continued fraction expansion of quadratic irrational numbers $\sqrt{D}$ is the solution to Pell's equation for $D$. It is well-known that, once an integer solution to Pell's equation…
The Pell equation $x^2 - Dy^2 = 1$ with non-square $D > 1$ has infinitely many integer solutions, yet most research has centered on the asymptotic behavior of fundamental units as $D$ varies. By contrast, the exact distribution of solutions…
Let $\ k$ be a natural number and $d=k^{2}\pm 4$ or $k^{2}\pm 1$. In this paper, by using continued fraction expansion of $\sqrt{d},$ we find fundamental solution of the equations $x^{2}-dy^{2}=\pm 1$ and we get all positive integer…
If P is a rational polytope in R^d, then $i_P(t):=#(tP\cap Z^d)$ is a quasi-polynomial in t, called the Ehrhart quasi-polynomial of P. A period of i_P(t) is D(P), the smallest positive integer D such that D*P has integral vertices. Often,…
Pollard's Rho is a method for solving the integer factorization problem. The strategy searches for a suitable pair of elements belonging to a sequence of natural numbers that given suitable conditions yields a nontrivial factor. In…
In this paper, we use the methods found in quant-ph/0201095 to create a continuous variable analogue of Shor's quantum factoring algorithm. By this we mean a quantum hidden subgroup algorithm that finds the period P of a function F:R-->R…
We consider the problem of efficiently solving a system of $n$ non-linear equations in ${\mathbb R}^d$. Addressing Smale's 17th problem stated in 1998, we consider a setting whereby the $n$ equations are random homogeneous polynomials of…
Computing the unit group and solving the principal ideal problem for a number field are two of the main tasks in computational algebraic number theory. This paper proposes efficient quantum algorithms for these two problems when the number…
Two theorems are demonstrated giving analytical expressions of the fundamental solutions of the Pell equation $X^{2}-DY^{2}=1$ found by the method of continued fractions for two squarefree polynomial expressions of radicands of…
For each positive integer $n$ it is shown how to construct a finite collection of multivariable polynomials $\{F_{i}:=F_{i}(t,X_{1},..., X_{\lfloor \frac{n+1}{2} \rfloor})\}$ such that each positive integer whose squareroot has a continued…
The aim of this expository article is twofold. The first is to introduce several polynomials of one variable as well as two variables defined on the positive integers with values as congruent numbers. The second is to present connections…
For an integer $k\geq 2$, let $\{F^{(k)}_{n}\}_{n\geqslant 2-k}$ be the $ k$--generalized Fibonacci sequence which starts with $0, \ldots, 0,1$ (a total of $k$ terms) and for which each term afterwards is the sum of the $k$ preceding terms.…
Finding polynomial solutions to Pell's equation is of interest as such solutions sometimes allow the fundamental units to be determined in an infinite class of real quadratic fields. In this paper, for each triple of positive integers…
Let $ \{P_{n}\}_{n\geq 0} $ be the sequence of Padovan numbers defined by $ P_0=0 $, $ P_1 = P_2=1$ and $ P_{n+3}= P_{n+1} +P_n$ for all $ n\geq 0 $. In this paper, we find all positive square-free integers $ d $ such that the Pell…
We consider the problem of finding a solution to a multivariate polynomial equation system of degree $d$ in $n$ variables over $\mathbb{F}_2$. For $d=2$, the best-known algorithm for the problem is by Bardet et al. [J. Complexity, 2013] and…