Related papers: Another (wrong) construction of $\pi$
We define constructive truth for arithmetic and for intuitionistic analysis, and investigate its properties. We also prove that the set of constructively true (first order) arithmetical statements is Pi-1-2 and Sigma-1-2 hard, and we…
The Fourier extension method, also known as the Fourier continuation method, is a method for approximating non-periodic functions on an interval using truncated Fourier series with period larger than the interval on which the function is…
A new idea for a binary clock is presented. It displays the time using a triangular array of 15 bits. It is shown that such a geometric, triangular arrangement is only possible because our system of time divisions is based on a sexagesimal…
$\pi\pi$ scattering length in the I=2 channel is calculated within quenched approximation using improved gauge and improved Wilson fermion actions on anisotropic lattices. The results are extrapolated towards the chiral, infinite volume and…
The equable, Pythagorean and natural scales are built on the basis of a mathematical logic.
Recent progress in unitarity techniques for one-loop scattering amplitudes makes a numerical implementation of this method possible. We present a 4-dimensional unitarity method for calculating the cut-constructible part of amplitudes and…
Methods were developed in Ref. [1] for constructing reference metrics (and from them differentiable structures) on three-dimensional manifolds with topologies specified by suitable triangulations. This note generalizes those methods by…
A heuristic but pedagogical derivation is given of an explicit formula which accurately reproduces the period of a simple pendulum even for large amplitudes. The formula is compared with others in the literature.
In a previous paper, some deviations were found in the O(p^6) low-energy constants that contribute to the pi pi-scattering lengths. This work completes the study of all the relevant couplings (r_1, ... r_6, r_S2). We also perform a…
We present a new record on computing specific bits of Pi, the mathematical constant, and discuss performing such computations on Apache Hadoop clusters. The specific bits represented in hexadecimal are 0E6C1294 AED40403 F56D2D76 4026265B…
Numerical approximate computation can solve large and complex problems fast. It has the advantage of high efficiency. However it only gives approximate results, whereas we need exact results in many fields. There is a gap between…
A string in four dimensions is constructed by supplementing it with forty four Majorana fermions. The central charge is 26. The fermions are grouped in such a way that the resulting action is supersymmetric. The super-Virasoro algebra is…
In this paper we show how to construct new convolutional codes from old ones by applying the well-known techniques: puncturing, extending, expanding, direct sum, the (u|u + v) construction and the product code construction. By applying…
Two topics of the number theory are discussed in this paper. First, we prove that given each natural number $x\geq10^{3}$, we have \[ |{\rm Li}(x)-\pi(x)|\leq c\sqrt{x}\log x\texttt{ and } \pi(x)={\rm Li}(x)+O(\sqrt{x}\log x) \] where $c$…
The vast use of computers on scientific numerical computation makes the awareness of the limited precision that these machines are able to provide us an essential matter. A limited and insufficient precision allied to the truncation and…
A permutation of the integers avoiding monotone arithmetic progressions of length $6$ was constructed in (Geneson, 2018). We improve on this by constructing a permutation of the integers avoiding monotone arithmetic progressions of length…
We extend Bishop's one-fourth three-fourths principle for constructing peak functions belonging to a uniform algebra to a situation where the ``approximate barriers'' associated with the Bishop construction are not uniformly bounded.
Among the currently known constructions of absolutely normal numbers, the one given by Mordechay Levin in 1979 achieves the lowest discrepancy bound. In this work we analyze this construction in terms of computability and computational…
Let $k$ be a finite field extension of the function field $\bfF_p(T)$ and $\bar{k}$ its algebraic closure. We count points in projective space $\Bbb P ^{n-1}(\bar{k})$ with given height and of fixed degree $d$ over the field $k$. If…
The aim of this work is to improve Wilker inequalities near the origin and {\pi}/2.