Related papers: Pell's equation without irrational numbers
The main goal of this article is to show a new method to solve some Fractional Order Integral Equations (FOIE), more precisely the ones which are linear, have constant coefficients and all the integration orders involved are rational. The…
We give an improved asymptotic upper bound on the number of diagonal Fermat curves $Ax^{\ell}+By^{\ell}=z^{\ell}$ over $\mathbb{F}_{q}$ with no $\mathbb{F}_{q}$-rational points, where $\ell$ is a prime number dividing $q-1$.
This paper deals with quadratic irrationals of the form $m/q+\sqrt v$ for fixed positive integers $v$ and $q$, $v$ not a square, and varying integers $m$, $(m,q)=1$. Two numbers $m/q+\sqrt v$, $n/q+\sqrt v$ of this kind are equivalent (in a…
We provide an overview of the connections between Bell's inequalities and algebraic structure.
In this paper, we study the following system \begin{eqnarray*} \left\{ \begin{array}{ll} -\Delta u + V(x)u-(2\omega+\phi)\phi u=\lambda f(u)+|u|^{4}u, \ & \text{in} \ \mathbb{R}^{3}, \Delta \phi + \beta\Delta_4\phi = 4\pi(\omega+\phi)…
Processors may find some elementary operations to be faster than the others. Although an operation may be conceptually as simple as some other operation, the processing speeds of the two can vary. A clever programmer will always try to…
We describe a method to show a plane quartic over a number field has no rational points. The method can be adapted to show that a curve does not have divisors of degree 1 or 2 and can be generalized to arbitrary smooth projective curves.…
The computational complexity of time-dependent perturbation theory is well-known to be largely combinatorial whatever the chosen expansion method and family of parameters (combinatorial sequences, Goldstone and other Feynman-type…
This short article presents a table of new equations which can be regarded as the generalized equations of the dispersionless limit of several nonlinear equations. From the definition expressed in an algebraic formula, one can get an…
The PSLQ algorithm is one of the most popular algorithm for finding nontrivial integer relations for several real numbers. In the present work, we present an incremental version of PSLQ. For some applications needing to call PSLQ many…
We consider partitions of a point set into two parts, and the lengths of the minimum spanning trees of the original set and of the two parts. If $w(P)$ denotes the length of a minimum spanning tree of $P$, we show that every set $P$ of $n…
We present a spectrally accurate numerical method for finding non-trivial time-periodic solutions of non-linear partial differential equations. The method is based on minimizing a functional (of the initial condition and the period) that is…
For $d > 1$ a cubefree rational integer, we define an $L$-function (denoted $L_d(s)$) whose coefficients are derived from the cubic theta function for $\mathbb Q\left(\sqrt{-3}\right)$. The Dirichlet series defining $L_d(s)$ converges for…
In this work, we introduce a spectral-infinite element method for solving Einstein's constraint equations in hyperbolic form. As an application of this, we use this method for computing asymptotically flat perturbations of a Kerr black hole…
Given a set of integers with no three in arithmetic progression, we construct a Stanley sequence by adding integers greedily so that no arithmetic progression is formed. This paper offers two main contributions to the theory of Stanley…
We present a precise solution of the polaron problem by a novel Monte Carlo method. Basing on conventional diagrammatic expansion for the Green function of the polaron, $G({\bf k}, \tau)$, we construct a process of generating continuous…
We take advantage of the properties of the Pell numbers to construct an integer version of the Jerusalem square fractal.
A method for solving cyclic block three-diagonal systems of equations is generalized for solving a block cyclic penta-diagonal system of equations. Introducing a special form of two new variables the original system is split into three…
An attempt to come closer to a resolution of the Collatz conjecture is presented. The central idea is the formation of a tree consisting of positive odd numbers with number 1 as root. Functions for generating the tree from the root are…
Let $F(z)$ be an arbitrary complex polynomial. We introduce the local root clustering problem, to compute a set of natural $\varepsilon$-clusters of roots of $F(z)$ in some box region $B_0$ in the complex plane. This may be viewed as an…