Related papers: A multimodular algorithm for computing Bernoulli n…
This paper presents a new approach to evaluating the special values of the Dirichlet beta function, $\beta(2k+1)$, where $k$ is any nonnegative integer. Our approach relies on some properties of the Euler numbers and polynomials, and uses…
We present and analyze an algorithm to enumerate all integers $n\le x$ that can be written as the sum of consecutive $k$th powers of primes, for $k>1$. We show that the number of such integers $n$ is asymptotically bounded by a constant…
In this note, we provide details of the $k$-dimensional Weisfeiler-Leman Algorithm and its analysis from Immerman-Lander (1990). In particular, we present an optimized version of the algorithm that runs in time $O(n^{k+1}\log n)$, where $k$…
The factorially normalized Bernoulli polynomials $b_n(x) = B_n(x)/n!$ are known to be characterized by $b_0(x) = 1$ and $b_n(x)$ for $n >0$ is the antiderivative of $b_{n-1}(x)$ subject to $\int_0^1 b_n(x) dx = 0$. We offer a related…
We study $B(n;k)$, the number of ways of writing $n$ as a sum or difference of the first $k$ Fibonacci numbers. We show that $B(0;k)$ satisfies the Tribonacci-like recurrence $B(0;k+1)=B(0;k)+B(0;k-1)+B(0;k-2)$ and that $B(n;k)$ satisfies a…
We describe and analyze an algorithm for computing the homology (Betti numbers and torsion coefficients) of closed semialgebraic sets given by Boolean formulas without negations over lax polynomial inequalities. The algorithm works in weak…
By using p-adic q-integrals, we study the q-Bernoulli numbers and polynomials of higher order.
Let $V(k)$ denote the waiting time, the number of trials needed to get a consecutive $k$ ones. We propose recurrence algorithms for the probability distribution function (pdf) and the probability generating function (pgf) of $V(k)$ in…
We construct the new q-extension of Bernoulli numbers and polynomials in this paper. Finally we consider the q-zeta functions which interpolate the new q-extension of Bernoulli numbers and polynomials.
We analyse and compare the complexity of several algorithms for computing modular polynomials. We show that an algorithm relying on floating point evaluation of modular functions and on interpolation, which has received little attention in…
Bernoulli sieve is a recursive construction of a random composition (ordered partition) of integer $n$. This composition can be induced by sampling from a random discrete distribution which has frequencies equal to the sizes of component…
We propose two efficient numerical approaches for solving variable-order fractional optimal control-affine problems. The variable-order fractional derivative is considered in the Caputo sense, which together with the Riemann-Liouville…
Consider a mixing dynamical systems $([0,1], T, \mu)$, for instance a piecewise expanding interval map with a Gibbs measure $\mu$. Given a non-summable sequence $(m_k)$ of non-negative numbers, one may define $r_k (x)$ such that $\mu (B(x,…
In this research, the Bernoulli polynomials are introduced. The properties of these polynomials are employed to construct the operational matrices of integration together with the derivative and product. These properties are then utilized…
This paper presents a novel algorithm for the modulus operation for FPGA implementation. The proposed algorithm use only addition, subtraction, logical, and bit shift operations, avoiding the complexities and hardware costs associated with…
In this work we study the properties of a new algebraic variant of the degenerate Bernoulli polynomial $\tilde{\beta}_{k}(m,x)$ and study the corresponding degenerate Bernoulli number $\tilde{\beta}_{k}(m,1)=m^{k}\beta_{k}(1/m)$, where…
In this paper, we derive a new computational algorithm for Barrett technique for modular polynomial multiplication, termed BA-P. BA-P is then applied to a new residue arithmetic based Barrett algorithm for modular polynomial multiplication…
In this paper, we use our previous study of the higher order Bernoulli numbers $B_n^{(l)}$ to investigate the $p$-adic properties of the Stirling numbers of the second kind $S(n,k)$. For example, we give a new, greatly simplified proof of…
We apply the Euler--Maclaurin formula to find the asymptotic expansion of the sums $\sum_{k=1}^n (\log k)^p / k^q$, ~$\sum k^q (\log k)^p$, ~$\sum (\log k)^p /(n-k)^q$, ~$\sum 1/k^q (\log k)^p $ in closed form to arbitrary order ($p,q…
We describe and analyze a numerical algorithm for computing the homology (Betti numbers and torsion coefficients) of semialgebraic sets given by Boolean formulas. The algorithm works in weak exponential time. This means that outside a…