相关论文: Binomial-coefficient multiples of irrationals

Multiple binomial sums form a large class of multi-indexed sequences, closed under partial summation, which contains most of the sequences obtained by multiple summation of products of binomial coefficients and also all the sequences with…

Goulden-Rattan polynomials give the exact value of the subdominant part of the normalized characters of the symmetric groups in terms of certain quantities ($C_i$) which describe the macroscopic shape of the Young diagram. The…

Let $t$ be a fixed parameter and $x$ some indeterminate. We give some properties of the generalized binomial coefficients $\genfrac{<}{>}{0pt}{}{x}{k}$ inductively defined by $k/x \genfrac{<}{>}{0pt}{}{x}{k}=…

By using the Newton interpolation formula, we generalize the recent identities on the Catalan triangle obtained by Miana and Romero as well as those of Chen and Chu. We further study divisibility properties of sums of products of binomial…

We construct a set $M_d$ whose points parametrize families of Meixner polynomials in $d$ variables. There is a natural bispectral involution $b$ on $M_d$ which corresponds to a symmetry between the variables and the degree indices of the…

We propose two-stage and sequential procedures to estimate the unknown parameter N of a binomial distribution with unknown parameter p, when we reinforce data with an independent sample of a negative-binomial experiment having the same p.

We prove positivity results about linearization and connection coefficients for Bessel polynomials. The proof is based on a recursion formula and explicit formulas for the coefficients in special cases. The result implies that the…

Consider n unit intervals, say [1,2], [3,4], ..., [2n-1,2n]. Identify their endpoints in pairs at random, with all (2n-1)!! = (2n-1) (2n-3) ... 3 1 pairings being equally likely. The result is a collection of cycles of various lengths, and…

Building on the work of Arizmendi and Celestino (2021), we derive the $*$-distributions of polynomials in monotone independent and infinitesimally monotone independent elements. For non-zero complex numbers $\alpha$ and $\beta$, we derive…

We consider binomial and inverse binomial sums at infinity and rewrite them in terms of a small set of constants, such as powers of $\pi$ or $\log(2)$. In order to perform these simplifications, we view the series as specializations of…

Catalan numbers $C(n)=\frac{1}{n+1}{2n\choose n}$ enumerate binary trees and Dyck paths. The distribution of paths with respect to their number $k$ of factors is given by ballot numbers $B(n,k)=\frac{n-k}{n+k}{n+k\choose n}$. These integers…

We describe a simple and yet surprisingly powerful probabilistic technique which shows how to find in a dense graph a large subset of vertices in which all (or almost all) small subsets have many common neighbors. Recently this technique…

We study the distribution P(\omega) of the random variable \omega = x_1/(x_1 + x_2), where x_1 and x_2 are the wealths of two individuals selected at random from the same tempered Paretian ensemble characterized by the distribution \Psi(x)…

When searching for Calabi.Yau differential equations, often different formulas for the coefficients give the same differential equation. The coefficients are usually sums (simple, double or triple) of products of binomial coefficients. This…

We study the joint components in a random `double graph' that is obtained by superposing red and blue binomial random graphs on $n$~vertices. A joint component is a maximal set of vertices, which contains both a red and a blue spanning…

We provide necessary and sufficient conditions on the unimodality of a convolution of two sequences of binomial coefficients preceded by a finite number of ones. These convolution sequences arise as as rank sequences of posets of…

For any polynomial $f$ of ${\mathbb F}\_{2^n}[x]$ we introduce the following characteristic of the distribution of its second order derivative,which extends the differential uniformity notion:$$\delta^2(f):=\max\_{\substack{\alpha \in…

Combinatorial interpretation of the fibonomial coefficients as a number of choices of specific finite subsets of an infinite partially ordered set of not binomial type is proposed. This partially ordered set is here defined via…

The purpose of this note is to introduce a new approach to the study of one of the most basic and seemingly intractable problems in partition theory, namely the conjecture that the partition function $p(n)$ is equidistributed modulo 2. Our…

Counting dominating sets in a graph $G$ is closely related to the neighborhood complex of $G$. We exploit this relation to prove that the number of dominating sets $d(G)$ of a graph is determined by the number of complete bipartite…