Related papers: The Bernoulli clock: probabilistic and combinatori…

In this paper, we give some recurrence formula and new and interesting identities for the poly-Bernoulli numbers and polynomials which are derived from umbral calculus.

In this paper, we introduce a new class of polynomials, called probabilistic q-Bernstein polynomials, alongside their generating function. Assuming Y is a random variable satisfying moment conditions, we use the generating function of these…

The beta-Bernoulli process provides a Bayesian nonparametric prior for models involving collections of binary-valued features. A draw from the beta process yields an infinite collection of probabilities in the unit interval, and a draw from…

The roots of Bernoulli polynomials, $B_n(z)$, when plotted in the complex plane, accumulate around a peculiar H-shaped curve. Karl Dilcher proved in 1987 that, on compact subsets of $\mathbb{C}$, the Bernoulli polynomials asymptotically…

Ballantine--Beck--Feigon--Maurischat introduced the subsum polynomial \[ \operatorname{sp}(\lambda,x):=\prod_i (1+x^{\lambda_i}) \] attached to an integer partition $\lambda$, and studied rational functions obtained by summing reciprocals…

Time-arrow $s=+/-$, intrinsic to a concrete physical system, is associated with the direction of information loss $\Delta I$ displayed by the random evolution of the given system. When the information loss tends to zero the intrinsic…

In this article we present applications of smooth numbers to the unconditional derandomization of some well-known integer factoring algorithms. We begin with Pollard's $p-1$ algorithm, which finds in random polynomial time the prime…

The theory of bi-orthogonal polynomials on the unit circle is developed for a general class of weights leading to systems of recurrence relations and derivatives of the polynomials and their associated functions, and to…

Given positive integers $n$ and $m$, let $p_n(m)$ be the probability that a uniform random permutation of $[n]$ has order exactly $m$. We show that, as $n \to \infty$, the maximum of $p_n(m)$ over all $m$ is asymptotic to $1/n$, 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,…

In this paper, we give a type B analogue of the 1/k-Eulerian polynomials. Properties of this kind of polynomials, including combinatorial interpretations, recurrence relations and gamma-positivity are studied. In particular, we show that…

Consider a polynomial of large degree n whose coefficients are independent, identically distributed, nondegenerate random variables having zero mean and finite moments of all orders. We show that such a polynomial has exactly k real zeros…

In this paper we establish an estimate for the rate of convergence of the Krasnosel'ski\v{\i}-Mann iteration for computing fixed points of non-expansive maps. Our main result settles the Baillon-Bruck conjecture [3] on the asymptotic…

Let $X_1,..., X_n$ be i.i.d.\ copies of a random variable $X=Y+Z,$ where $ X_i=Y_i+Z_i,$ and $Y_i$ and $Z_i$ are independent and have the same distribution as $Y$ and $Z,$ respectively. Assume that the random variables $Y_i$'s are…

In this paper we obtain a new curious identity involving trigonometric functions. Namely, for any positive odd integer $n$ we prove that $$\sum_{k=1}^n(-1)^k(\cot kx)\sin k(n-k)x=\frac{1-n}2,$$ which is equivalent to the identity…

A new explicit closed-form formula for the multivariate $(n, k)$th partial Bell polynomial $B_{n,k} (x_1, x_2, ..., x_{n - k + 1})$ is deduced. The formula involves multiple summations and makes it possible, for the first time, to easily…

The power sum $1^n + 2^n + \cdots + x^n$ has been of interest to mathematicians since classical times. Johann Faulhaber, Jacob Bernoulli, and others who followed expressed power sums as polynomials in $x$ of degree $n+1$ with rational…

Let Y be a random variable whose moment generating function exists in some neighborhood of the origin. We consider the probabilistic bivariate Bell polynomials associated with Y and the probabilistic bivariate r-Bell polynomials associated…

We present a deterministic algorithm that given any directed graph on n vertices computes the parity of its number of Hamiltonian cycles in O(1.619^n) time and polynomial space. For bipartite graphs, we give a 1.5^n poly(n) expected time…

While there are many identities involving the Euler and Bernoulli numbers, they are usually proved analytically or inductively. We prove two identities involving Euler and Bernoulli numbers with combinatorial reasoning via up-down…