Related papers: Binomial-coefficient multiples of irrationals

We study the distribution of the extended binomial coefficients by deriving a complete asymptotic expansion with uniform error terms. We obtain the expansion from a local central limit theorem and we state all coefficients explicitly as…

We suggest an upper bound on binomial coefficients that holds over the entire parameter range and whose form repeats the form of the de Moivre-Laplace approximation of the symmetric binomial distribution. Using the bound, we estimate the…

We show that the sequence $(\alpha n)_{n\in \mathcal{B}}$ is uniformly distributed modulo 1, for every irrational $\alpha$, provided $\mathcal{B}$ belongs to a certain family of integer sequences, which includes the prime, almost prime,…

If the coefficients of polynomials are selected by some random process, the zeros of the resulting polynomials are in some sense random. In this paper the author rephrases the above in more precise language, and calculates the joint…

This paper studies the product $\bar{G}_n$ of the binomial coefficients in the n-th row of Pascal's triangle, which equals the reciprocal of the product of all the reduced and unreduced Farey fractions of order n. It studies its size as a…

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…

We consider integer sequences that satisfy a recursion of the form $x_{n+1} = P(x_n)$ for some polynomial $P$ of degree $d > 1$. If such a sequence tends to infinity, then it satisfies an asymptotic formula of the form $x_n \sim A…

We introduce the strong alliance polynomial of a graph. The strong alliance polynomial of a graph $G$ with order n and strong defensive alliance number $a(G)$ is the polynomial $a(G;x):=\sum_{i=a(G)}^{n}\, a_i(G)\ x^i$, where $a_{k}(G)$ is…

Motivated by longstanding conjectures regarding decompositions of graphs into paths and cycles, we prove the following optimal decomposition results for random graphs. Let $0<p<1$ be constant and let $G\sim G_{n,p}$. Let $odd(G)$ be the…

Many polynomial invariants are defined on graphs for encoding the combinatorial information and researching them algebraically. In this paper, we introduce the cycle polynomial and the path polynomial of directed graphs for counting cycles…

We formulate several polynomial identities. One side of these identities has a nice simple form. Whereas the other has a form of a polynomial whose coefficients contain binomial coefficients double factorials or (and) rising factorials. The…

The binomial coefficients and Catalan triangle numbers appear as weight multiplicities of the finite-dimensional simple Lie algebras and affine Kac--Moody algebras. We prove that any binomial coefficient can be written as weighted sums…

The natural forms of the Leibniz rule for the $k$th derivative of a product and of Fa\`a di Bruno's formula for the $k$th derivative of a composition involve the differential operator $\partial^k/\partial x_1 ... \partial x_k$ rather than…

We study integer coefficient polynomials of fixed degree and maximum height $H$, that are irreducible by Dumas's criterion. We call such polynomials Dumas polynomials. We derive upper bounds on the number of Dumas polynomials, as $H$…

Motivated by circle graphs, and the enumeration of Euler circuits, we define a one-variable ``interlace polynomial'' for any graph. The polynomial satisfies a beautiful and unexpected reduction relation, quite different from the cut and…

Let $(G_n(x))_{n=0}^\infty$ be a $d$-th order linear recurrence sequence having polynomial characteristic roots, one of which has degree strictly greater than the others. Moreover, let $m\geq 2$ be a given integer. We ask for…

A polynomial f (multivariate over a field) is decomposable if f = g(h) with g univariate of degree at least 2. We determine the dimension (over an algebraically closed field) of the set of decomposables, and an approximation to their number…

For every positive integer $n$ and every $\delta \in [0,1]$, let $B(n, \delta)$ denote the probabilistic model in which a random set $A \subseteq \{1, \dots, n\}$ is constructed by choosing independently every element of $\{1, \dots, n\}$…

The theory of dense graph limits comes with a natural sampling process which yields an inhomogeneous variant G(n,W) of the Erdos-Renyi random graph. Here we study the clique number of these random graphs. We establish the concentration of…

Random walks of n steps taken into independent uniformly random directions in a d-dimensional Euclidean space (d larger than 1), are named Dirichlet when their step lengths are distributed according to a Dirichlet law. The latter continuous…