Related papers: A multimodular algorithm for computing Bernoulli n…
The ${\mathbb B}_n^{(k)}$ poly-Bernoulli numbers --- a natural generalization of classical Bernoulli numbers ($B_n={\mathbb B}_n^{(1)}$) --- were introduced by Kaneko in 1997. When the parameter $k$ is negative then ${\mathbb B}_n^{(k)}$ is…
An algorithm counting the number of ones in a binary word is presented running in time $O(\log\log b)$ where $b$ is the number of ones. The operations available include bit-wise logical operations and multiplication.
A determined algorithm is presented for solving the rSUM problem for any natural r with a sub-quadratic assessment of time complexity in some cases. In terms of an amount of memory used the obtained algorithm is the nlog^3(n) order. The…
We propose a novel algorithm for finding square roots modulo p. Although there exists a direct formula to calculate square root of an element modulo prime (3 mod 4), but calculating square root modulo prime (1 mod 4) is non trivial.…
Let $f$ be a fixed (holomorphic or Maass) modular cusp form. Let $\cq$ be a Dirichlet character mod $q$. We describe a fast algorithm that computes the value $L(1/2,f\times\chi_q)$ up to any specified precision. In the case when $q$ is…
By using the associated and restricted Stirling numbers of the second kind, we give some generalizations of the poly-Bernoulli numbers. We also study their arithmetical and combinatorial properties. As an application, at the end of the…
The classical Bernoulli numbers $B_m$ can be expressed using Stirling numbers of the second kind, and M. Kaneko extended this framework by defining poly-Bernoulli numbers ${\mathbb B}_m^{(k)}$, for which explicit formulas using the Stirling…
Permutation patterns and pattern avoidance have been intensively studied in combinatorics and computer science, going back at least to the seminal work of Knuth on stack-sorting (1968). Perhaps the most natural algorithmic question in this…
We propose to generalize the work of R\'egis Dupont for computing modular polynomials in dimension $2$ to new invariants. We describe an algorithm to compute modular polynomials for invariants derived from theta constants and prove under…
The process generates substantial amounts of data with highly complex structures, leading to the development of numerous nonlinear statistical methods. However, most of these methods rely on computations involving large-scale dense kernel…
The modified Bernoulli numbers \begin{equation*} B_{n}^{*} = \sum_{r=0}^{n} \binom{n+r}{2r} \frac{B_{r}}{n+r}, \quad n > 0 \end{equation*} introduced by D. Zagier in 1998 were recently extended to the polynomial case by replacing $B_{r}$ by…
In this paper we study properties of numbers $K_n^l$ of connected components of bifurcation diagrams for multiboundary singularities $B_n^l$. These numbers generalize classic Bernoulli-Euler numbers. We prove a recurrent relation on the…
The Bernoulli numbers b_0,b_1,b_2,.... of the second kind are defined by \sum_{n=0}^\infty b_nt^n=\frac{t}{\log(1+t)}. In this paper, we give an explicit formula for the sum \sum_{j_1+j_2+...+j_N=n,…
A Bernoulli factory is a model for randomness manipulation that transforms an initial Bernoulli random variable into another Bernoulli variable by applying a predetermined function relating the output bias to the input one. In literature,…
Let $B_{n}$ denote the Bernoulli numbers, and $S(n,k)$ denote the Stirling numbers of the second kind. We prove the following identity $$ B_{m+n}=\sum_{\substack{0\leq k \leq n \\ 0\leq l \leq m}}\frac{(-1)^{k+l}\,k!\, l!\,…
Additive Fourier Transform is sdudied. A fast multiplication algorithm for polynomials over the binary field is given. The bit complexity of the algorithm is $O(n(log n)(\log\log n)^2)$.
The author has previously extended the theory of regular and irregular primes to the setting of arbitrary totally real number fields. It has been conjectured that the Bernoulli numbers, or alternatively the values of the Riemann zeta…
Let $K$ be the sum of the reciprocals of the integers with no occurrence of the digit $b-1$ in base $b$. We show $K = b\log(b) - A/b - B/b^2-C/b^3+O(1/b^4)$ with $A=\zeta(2)/2$, $B = (3\zeta(2)+\zeta(3))/3$ and $C =…
It is significant to study congruences involving multiple harmonic sums. Let $p$ be an odd prime, in recent years, the following curious congruence $$\sum_{\substack{i+j+k=p \\ i, j, k>0}} \frac{1}{i j k} \equiv-2 B_{p-3}\pmod p$$ has been…
We looked into the algorithm for calculating Betti numbers presented by Lloyd, Garnerone, and Zanardi (LGZ). We present a new algorithm in the same spirit as LGZ with the intent of clarifying quantum algorithms for computing Betti numbers.…