相关论文: A new form of the Machin-like formula for pi by it…

In this article we will use Minecraft to experimentally approximate the values of four different mathematical constants. The mathematical constants that we will approximate are $\sqrt{2}, \pi$, Euler's number $e$, and Ap\'{e}ry's constant…

We analyze algorithms for computing the $n$th prime $p_n$ and establish asymptotic bounds for several approaches. Using existing results on the complexity of evaluating the prime-counting function $\pi(x)$, we show that the binary search…

In a previous paper a new approach has been introduced for computing, recursively and numerically, one-loop tensor integrals. Here we describe a few modifications of the original method that allow a more efficient numerical implementation…

In this paper we give another proof of the Chudnovsky formula for calculating $\pi$ - a proof in detail with means of basic complex analysis. With the exception of the tenth chapter, the proof is self-contained, with proofs provided for all…

We investigate the complexity of covariance matrix estimation for Gibbs distributions based on dependent samples from a Markov chain. We show that when $\pi$ satisfies a Poincar\'e inequality and the chain possesses a spectral gap, we can…

In this note we improve an algorithm from a recent paper by Bauer and Bennett for computing a function of Erd\"os that measures the minimal gap size $f(k)$ in the sequence of integers at least one of whose prime factors exceeds $k$. This…

Given a permutation $\pi$ chosen uniformly from $S_n$, we explore the joint distribution of $\pi(1)$ and the number of descents in $\pi$. We obtain a formula for the number of permutations with $\des(\pi)=d$ and $\pi(1)=k$, and use it to…

This paper presents different recursive formulas for computing the marginals and the normalizing constant of a Gibbs distribution $\pi$: The common thread is the use of the underlying Markov properties of such processes. The procedures are…

We derive a generating function for the number of integer compositions of $n$ into $k$ parts (i.e., $k$-compositions of $n$) with a given number of inversions, and obtain similar results for $k$-compositions of $n$ with a given number of…

Given the widespread use of lossless compression algorithms to approximate algorithmic (Kolmogorov-Chaitin) complexity, and that lossless compression algorithms fall short at characterizing patterns other than statistical ones not different…

An intrinsic form factor has benn found and the slope of the form factor has been predicted.

It is shown that Pythagorean triples can be used to generate matrices that have integer eigenvalues for all permutations of their coefficients, via simple formulas. For example, each and every permutation of the $2\times2$ matrix…

We say that two permutations $\pi$ and $\rho$ have separated descents at position $k$ if $\pi$ has no descents before position $k$ and $\rho$ has no descents after position $k$. We give a counting formula, in terms of reduced word tableaux,…

The prime-counting function $\pi(x)$ which returns the number of primes smaller or equal to a given number is a topic of interest in number theory. An algorithm based on a cyclic group isomorphic to $Z/nZ$, the so-called $Z$-functions, was…

The Ricci iteration is a discrete analogue of the Ricci flow. According to Perelman, the Ricci flow converges to a Kahler-Einstein metric whenever one exists, and it has been conjectured that the Ricci iteration should behave similarly.…

We provide two complexity measures that can be used to measure the running time of algorithms to compute multiplications of long integers. The random access machine with unit or logarithmic cost is not adequate for measuring the complexity…

We suggest a new approach to Artin's constant that leads to its representation as an infinite sum divided by another infinite sum. The same approach works well for Stephens' constant and higher rank Artin's constants. The main results are…

We introduce a new iterative method for computing solutions of elliptic equations with random rapidly oscillating coefficients. Similarly to a multigrid method, each step of the iteration involves different computations meant to address…

An investigation of the comparative efficiency of the different methods in which {\pi} is cal- culated. This thesis will compare and contrast five different methods in calculating {\pi} by first deriving the various proofs to each method…

We introduce a new set of algorithms to compute Jacobi matrices associated with measures generated by infinite systems of iterated functions. We demonstrate their relevance in the study of theoretical problems, such as the continuity of…