Related papers: A multimodular algorithm for computing Bernoulli n…

We conjecture that the structure of Bernoulli numbers can be explicitly given in the closed form $$ B_n = (-1)^{\frac{n}{2}-1} \prod_{p-1 \nmid n} |n|_p^{-1} \prod\limits_{(p,l)\in\Psi^{\rm irr}_1 \atop n \equiv l \mods{p-1}} |p…

Let a polytope $P$ be defined by a system $A x \leq b$. We consider the problem of counting the number of integer points inside $P$, assuming that $P$ is $\Delta$-modular, where the polytope $P$ is called $\Delta$-modular if all the rank…

We study the q-analogue of Euler-Maclaurin formula and by introducing a new q-operator we drive to this form. Moreover, approximation properties of q-Bernoulli polynomials is discussed. We estimate the suitable functions as a combination of…

In this lecture notes we try to familiarize the audience with the theory of Bernoulli polynomials; we study their properties, and we give, with proofs and references, some of the most relevant results related to them. Several applications…

We find a new approach to computing the remainder of a polynomial modulo $x^n-1$; such a computation is called modular enumeration. Given a polynomial with coefficients from a commutative $\mathbb{Q}$-algebra, our first main result…

We explore a variant of the zeta function interpolating the Bernoulli numbers based on an integral representation suggested by J. Jensen. The Bernoulli function $\operatorname{B}(s, v) = - s\, \zeta(1-s, v)$ can be introduced independently…

Let $\R$ be a real closed field, $ {\mathcal Q} \subset \R[Y_1,...,Y_\ell,X_1,...,X_k], $ with $ \deg_{Y}(Q) \leq 2, \deg_{X}(Q) \leq d, Q \in {\mathcal Q}, #({\mathcal Q})=m$, and $ {\mathcal P} \subset \R[X_1,...,X_k] $ with $\deg_{X}(P)…

In this paper we describe an algorithm that takes as input a description of a semi-algebraic set $S \subset \R^k$, defined by a Boolean formula with atoms of the form $P > 0, P < 0, P=0$ for $P \in {\mathcal P} \subset \R[X_1,...,X_k],$ and…

For a two parameter family of Bernoulli numbers $B_{n, p}$ the exponential generating function is derived by elementary methods.

This paper presents a means with time complexity of at worst O(n^3) to compute the discrete logarithm on cyclic finite groups of integers modulo p. The algorithm makes use of reduction of the problem to that of finding the concurrent zeros…

Denote by $p(k)$ the limit, as $n \rightarrow \infty$, of the probability that a random permutation on a set of size $n$ has an invariant set of size $k$. We give an asymptotic formula for $p(k)$, showing that it is asymptotically…

In the paper, the authors establish an explicit formula for computing Bernoulli polynomials at non-negative integer points in terms of $r$-Stirling numbers of the second kind.

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…

We study the bit complexity of two methods, related to the Euclidean algorithm, for computing cubic and quartic analogs of the Jacobi symbol. The main bottleneck in such procedures is computation of a quotient for long division. We give…

We overview numerous algorithms in computational $D$-module theory together with the theoretical background as well as the implementation in the computer algebra system \textsc{Singular}. We discuss new approaches to the computation of…

We show how the Binomial Theorem can be used to continue the Riemann Zeta Function to the left hand half-plane. This method yields the explicit values of the function at non-positive integers in terms of the Bernoulli numbers.

For each positive integer n, we determine the set of symmetric functions f for which the congruence f(p/1,p/2,...,p/(p-1)) \equiv 0 mod p^n holds for all sufficiently large primes p. Our determination is conditional on a conjecture…

We present a new algorithm to compute the classical modular polynomial Phi_n in the rings Z[X,Y] and (Z/mZ)[X,Y], for a prime n and any positive integer m. Our approach uses the graph of n-isogenies to efficiently compute Phi_n mod p for…

Suppose that we are given an infinite binary sequence which is random for a Bernoulli measure of parameter $p$. By the law of large numbers, the frequency of zeros in the sequence tends to~$p$, and thus we can get better and better…

Let $m$, $r$ and $n$ be positive integers. We denote by ${\bf k}\vdash n$ any tuple of odd positive integers ${\bf k}=(k_1,\dots,k_t)$ such that $k_1+\dots+k_t=n$ and $k_j\ge 3$ for all $j$. In this paper we prove that for every…