Related papers: Probabilistic Consequences of Some Polynomial Recu…

Systems of orthogonal polynomials whose recurrence coefficients tend to infinity are considered. A summability condition is imposed on the coefficients and the consequences for the measure of orthogonality are discussed. Also discussed are…

The successive discrete structures generated by a sequential algorithm from random input constitute a Markov chain that may exhibit long term dependence on its first few input values. Using examples from random graph theory and search…

We investigate algebraic and arithmetic properties of a class of sequences of sparse polynomials that have binomial coefficients both as exponents and as coefficients. In addition to divisibility and irreducibility results we also consider…

We investigate the dependence of Poincar\'e recurrence-times statistics on the choice of recurrence-set, by sampling the dynamics of two- and four-dimensional Hamiltonian maps. We derive a method that allows us to visualize the direct…

A quadratic recurrence of Faltung type, arising via ancestral path lengths of random binary trees, turns out to be related to the Painlev\'e I differential equation.

We consider a probability distribution on the set of Boolean functions in n variables which is induced by random Boolean expressions. Such an expression is a random rooted plane tree where the internal vertices are labelled with connectives…

Let $(x_n)_{n\geq0}$ be a linear recurrence sequence of order $k\geq2$ satisfying $$x_n=a_1x_{n-1}+a_2x_{n-2}+\dots+a_kx_{n-k}$$ for all integers $n\geq k$, where $a_1,\dots,a_k,x_0,\dots, x_{k-1}\in \mathbb{Z},$ with $a_k\neq0$. In 2017,…

Can you decide if there is a coincidence in the numbers counting two different combinatorial objects? For example, can you decide if two regions in $\mathbb{R}^3$ have the same number of domino tilings? There are two versions of the…

New differential-recurrence properties of dual Bernstein polynomials are given which follow from relations between dual Bernstein and orthogonal Hahn and Jacobi polynomials. Using these results, a fourth-order differential equation…

Here, we find the characteristics polynomial of normalized Laplacian of a tree. The coefficients of this polynomial are expressed by the higher order general Randi\'c indices for matching, whose values depend on the structure of the tree.…

The aim of this paper is twofold. The first part is concerned with the associated and the so-called co-polynomials, i.e. new sequences obtained when finite perturbations of the recurrence coefficients are considered. In the second part we…

We examine the behavior of the sequences of $p$-adic valuations of quadratic polynomials with integer coefficients for an odd prime $p$ through tree representations. Under this representation, a finite tree corresponds to a periodic…

We generalize the polynomial Szemer\'{e}di theorem to intersective polynomials over the ring of integers of an algebraic number field, by which we mean polynomials having a common root modulo every ideal. This leads to the existence of new…

We examine a generalization of the binomial distribution associated with a strictly increasing sequence of numbers and we prove its Poisson-like limit. Such generalizations might be found in quantum optics with imperfect detection. We…

We consider three bivariate polynomial invariants $P$, $A$, and $S$ for rooted trees, as well as a trivariate polynomial invariant $M$. These invariants are motivated by random destruction processes such as the random cutting model or site…

We introduce a new model of random tree that grows like a random recursive tree, except at some exceptional "doubling events" when the tree is replaced by two copies of itself attached to a new root. We prove asymptotic results for the size…

Consider a random recusive tree with n vertices. We show that the number of vertices with even depth is asymptotically normal as n tends to infinty. The same is true for the number of vertices of depth divisible by m for m=3, 4 or 5; in all…

The triangle of sorted binomial coefficients $\left\langle {n \atop k} \right\rangle = \binom{n}{\lfloor \frac{n - k}{2} \rfloor}$ for $0 \leq k \leq n$ has appeared several times in recent combinatorial works but has evaded dedicated…

Over the last decade it has become clear that discrete Painlev\'e equations appear in a wide range of important mathematical and physical problems. Thus, the question of recognizing a given non-autonomous recurrence as a discrete Painlev\'e…

We derive new combinatorial identities which may be viewed as multivariate analogs of summation formulas for hypergeometric series. As in the previous paper [Re], we start with probability distributions on the space of the infinite Young…