Related papers: Algorithmic determination of a large integer in th…

This paper deals with the estimation of the modes of an univariate mixture when the number of components is known and when the component density are well separated. We propose an algorithm based on the minimization of the "kp" criterion we…

Through introducing a new iterative formula for divided differnce using Neville's and Aitken's algorithms,we study new iterative methods for interpolation,numerical differentiation and numerical integration formulas with arbitrary order of…

In this paper we present a method to derive Pi(x) and other Arithemtical functions that can be generated by a Dirichlet series by variational principles,we use a variational method to determine the solution for a Fredholm integral equation…

We derive expressions for the partition function p(n), with n in the form 7k+a, as (k+1)-dimensional determinants.

We use a method of translation to recover Borweins' quadratic and quartic iterations. Then, by using the WZ-method, we obtain some initial values which lead to the limit $1/\pi$. We will not use the modular theory nor either the Gauss'…

We consider the sums $S(k)=\sum_{n=0}^{\infty}\frac{(-1)^{nk}}{(2n+1)^k}$ and $\zeta(2k)=\sum_{n=1}^{\infty}\frac{1}{n^{2k}}$ with $k$ being a positive integer. We evaluate these sums with multiple integration, a modern technique. First, we…

Univariate polynomial root-finding is a classical subject, still important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the…

This document is a companion for the Maple program : Discrete series and K-types for U(p,q) available on:http://www.math.jussieu.fr/~vergne We explain an algorithm to compute the multiplicities of an irreducible representation of U(p)x U(q)…

Let $a,k\in\mathbb{N}$. For the $k-1$-th iterate of the exponential function $x\mapsto a^x$, also known as tetration, we write \[ ^k a:=a^{a^{.^{.^{.^{a}}}}}. \] In this paper, we show how an efficient algorithm for tetration modulo natural…

The Sum of Square Roots (SSR) problem is the following computational problem: Given positive integers $a_1, \dots, a_k$, and signs $\delta_1, \dots, \delta_k \in \{-1, 1\}$, check if $\sum_{i=1}^k \delta_i \sqrt{a_i} > 0$. The problem is…

In this paper we present two algorithms for the computation of a diagonal form of a matrix over non-commutative Euclidean domain over a field with the help of Gr\"obner bases. This can be viewed as the pre-processing for the computation of…

Let $I_k = [(2k-1)^2, (2k+1)^2)$ for $k \geq 1$. Starting from the odd-composite matrix $(b_{ij})$ with $b_{ij} = (2i-1)(2j-1)$, introduced by the author in [1], we define for each odd integer $n$ the \emph{matrix multiplicity} $r(n)$, the…

We present an improved version of the analytic method for calculating $\pi(x)$, the number of prime numbers not exceeding $x$. We implemented this method in cooperation with J. Franke, T. Kleinjung and A. Jost and calculated the value…

The coefficients c(n,k) defined by (1-k^2x)^(-1/k) = sum c(n,k) x^n reduce to the central binomial coefficients for k=2. Motivated by a question of H. Montgomery and H. Shapiro for the case k=3, we prove that c(n,k) are integers and study…

In his book "Mathematics Rhyme and Reason," Currie discusses what he calls a $mysterious$ $pattern$ involving the sequence $ a_{n} = 2^n \sqrt{2 - \sqrt{2 + \sqrt{2 + \cdots + \sqrt{2}}}},$ where $n$ is the number of radicals. Part of the…

We formalize the univariate fragment of Ben-Or, Kozen, and Reif's (BKR) decision procedure for first-order real arithmetic in Isabelle/HOL. BKR's algorithm has good potential for parallelism and was designed to be used in practice. Its key…

In the recent paper [arXiv:1612.06893] P. B\"urgisser and A. Lerario introduced a geometric framework for a probabilistic study of real Schubert Problems. They denoted by $\delta_{k,n}$ the average number of projective $k$-planes in…

We develop algorithms to turn quotients of rings of rings of integers into effective Euclidean rings by giving polynomial algorithms for all fundamental ring operations. In addition, we study normal forms for modules over such rings and…

The sequence $A067549$ of The On-Line Encyclopedia of Integer Sequences is defined as $(a_k)_{k \geq 1}$ with $a_k$ being the determinant of the $k \times k$ matrix whose diagonal contains the first $k$ prime numbers and all other elements…

We present a polynomial time algorithm, which solves a nonstandard Variation of the well-known PARTITION-problem: Given positive integers $n, k$ and $t$ such that $t \geq n$ and $k \cdot t = {n+1 \choose 2}$, the algorithm partitions the…