Related papers: Probabilistic Consequences of Some Polynomial Recu…

We show that sequences of skew Schur polynomials obtained from stretched semi-standard Young tableaux satisfy a linear recurrence, which we give explicitly. Using this, we apply this to finding certain asymptotic behavior of these Schur…

We consider polynomials that are defined as Wronskians of certain sets of Hermite polynomials. Our main result is a recurrence relation for these polynomials in terms of those of one or two degrees smaller, which generalizes the well-known…

The main objective of this paper is to present recurrence relations for the generalized poly-Cauchy numbers and polynomials. This is accomplished by introducing the concept of generalized m-poly-Cauchy numbers and polynomials. Additionally,…

We show that if a real trigonometric polynomial has few real roots, then the trigonometric polynomial obtained by writing the coefficients in reverse order must have many real roots. This is used to show that a class of random trigonometric…

In this paper, we consider a regular tessellation of the Euclidean plane and the sequence of its geometric scalings by negative powers of a fixed integer. We generate iteratively random sets as the union of adjacent tiles from these…

In this study, the new algebraic properties related to bivariate Fibonacci polynomials has been given. We present the partial derivatives of these polynomials in the form of convolution of bivariate Fibonacci polynomials. Also, we define a…

We show the convergence of the characteristic polynomial for random permutation matrices sampled from the generalized Ewens distribution. Under this distribution, the measure of a given permutation depends only on its cycle structure,…

We develop a new method for studying the asymptotics of symmetric polynomials of representation-theoretic origin as the number of variables tends to infinity. Several applications of our method are presented: We prove a number of theorems…

We consider growing random recursive trees in random environment, in which at each step a new vertex is attached (by an edge of a random length) to an existing tree vertex according to a probability distribution that assigns the tree…

A recurrence scheme is defined for the numerical determination of high degree polynomial approximations to functions as, for instance, inverse powers near zero. As an example, polynomials needed in the two-step multi-boson (TSMB) algorithm…

In this paper we present a general scheme for how to relate differential equations for the recurrence coefficients of semi-classical orthogonal polynomials to the Painlev\'e equations using the geometric framework of the Okamoto Space of…

This paper derives a unifying theorem establishing consistency results for a broad class of tree-based algorithms. It improves current results in two aspects. First of all, it can be applied to algorithms that vary from traditional Random…

We study time-reversal symmetry in dynamical systems with finite phase space, with applications to birational maps reduced over finite fields. For a polynomial automorphism with a single family of reversing symmetries, a universal (i.e.,…

The recursive and hierarchical structure of full rooted trees is applicable to represent statistical models in various areas, such as data compression, image processing, and machine learning. In most of these cases, the full rooted tree is…

We deal with the algebraicity of an iterated Puiseux series in several variables in terms of the properties of its coefficients. Our aim is to generalize to several variables the results from [HM15]. We show that the algebraicity of such a…

We survey and prove properties a family of recurrences bears in relation to integer representations, compositions, the Pascal triangle, sums of digits, Nim games and Beatty sequences.

A composition of birational maps given by Laurent polynomials need not be given by Laurent polynomials; however, sometimes---quite unexpectedly---it does. We suggest a unified treatment of this phenomenon, which covers a large class of…

Derivative polynomials in two variables are defined by repeated differentiation of the tangent and secant functions. We establish the connections between the coefficients of these derivative polynomials and the numbers of interior and left…

We review the properties of six families of orthogonal polynomials that form the main bulk of the collection called the Askey--Wilson scheme of polynomials. We give connection coefficients between them as well as the so-called linearization…

Various best-choice problems related to the planar homogeneous Poisson process in finite or semi-infinite rectangle are studied. The analysis is largely based on properties of the one-dimensional box-area process associated with the…