Related papers: On recurrence relations arising from NRS(2) applie…

We consider the theoretical and numerical aspects of the quadrature rules associated with a sequence of polynomials generated by a special $R_{II}$ recurrence relation. We also look into some methods for generating the nodes (which lie on…

Evaluating or finding the roots of a polynomial $f(z) = f_0 + \cdots + f_d z^d$ with floating-point number coefficients is a ubiquitous problem. By using a piecewise approximation of $f$ obtained with a careful use of the Newton polygon of…

In this paper we deal with composite rational functions having zeros and poles forming consecutive elements of an arithmetic progression. We also correct a result published earlier related to composite rational functions having a fixed…

Permutation rational functions over finite fields have attracted much attention in recent years. In this paper, we introduce a class of permutation rational functions over $\mathbb F_{q^2}$, whose numerators are so-called $q$-quadratic…

Consider a quadratic polynomial $f\left(\xi_{1},\dots,\xi_{n}\right)$ of independent Bernoulli random variables. What can be said about the concentration of $f$ on any single value? This generalises the classical Littlewood--Offord problem,…

We prove formulas for the Bernoulli numbers by using the Newton-Girard identities to evaluate the Riemann zeta function at positive even integers. To do this, we define a sequence of positive integers, a sequence of polynomials, and a…

We construct a combinatorial model that is described by the cube recurrence, a nonlinear recurrence relation introduced by Propp, which generates families of Laurent polynomials indexed by points in $\mathbb{Z}^3$. In the process, we prove…

Let ${\mathcal A}$ be the class of functions $f$ that are analytic in the unit disk ${\mathbb D}$ and normalized such that $f(z)=z+a_2z^2+a_3z^3+\cdots$. Let $0<\lambda\le1$ and \[ {\mathcal U}(\lambda) = \left\{ f\in{\mathcal A}: \left…

We report on a verification of the Fundamental Theorem of Algebra in ACL2(r). The proof consists of four parts. First, continuity for both complex-valued and real-valued functions of complex numbers is defined, and it is shown that…

Meadows are a sort of commutative rings with a multiplicative identity element and a total multiplicative inverse operation. In this paper we study algebraic properties of common meadows, which are meadows that introduce, as the inverse of…

We present a multidimensional generalization of Zeckendorf's Theorem (any positive integer can be written uniquely as a sum of non-adjacent Fibonacci numbers) to a large family of linear recurrences. This extends work of Anderson and…

Let $f,g\in\mathbb{C}[z]\setminus\mathbb{C}$ and $c\in\mathbb{C}[z]$. Suppose that $\mathrm{deg}(c)=1$ if $\mathrm{deg}(f)=\mathrm{deg}(g)=1$. Using the theory of Presburger arithmetic, we prove that the rank-two recurrence set…

We introduce a family of rings of symmetric functions depending on an infinite sequence of parameters. A distinguished basis of such a ring is comprised by analogues of the Schur functions. The corresponding structure coefficients are…

Let $\mathbb{F}_q$ be the field with $q$ elements and of characteristic $p$. For $a\in\mathbb{F}_p$ consider the set \begin{equation*} S_a(n)=\{f\in\mathbb{F}_q[x]\mid\operatorname{deg}(f)=n,~f\text{ irreducible, monic and}…

The orthogonal polynomials with recurrence relation \[(\la\_n+\mu\_n-z) F\_n(z)=\mu\_{n+1} F\_{n+1}(z)+\la\_{n-1} F\_{n-1}(z)\] with two kinds of cubic transition rates $\la\_n$ and $\mu\_n,$ corresponding to indeterminate Stieltjes moment…

Recurrences for positive definite functions in terms of the space dimension have been used in several fields of applications. Such recurrences typically relate to properties of the system of special functions characterizing the geometry of…

We present an algorithm which, given a linear recurrence operator $L$ with polynomial coefficients, $m \in \mathbb{N}\setminus\{0\}$, $a_1,a_2,\ldots,a_m \in \mathbb{N}\setminus\{0\}$ and $b_1,b_2,\ldots,b_m \in \mathbb{K}$, returns a…

Iterating Newton's method symbolically for the general quadratic yields a rational function, the numerator and denominator of which are polynomials with highly composite coefficients.

The periodic points of the algebraic function defined by the equation $g(x,y) = x^3(4y^2+2y+1)-y(y^2-y+1)$ are shown to be expressible in terms of Ramanujan's cubic continued fraction $c(\tau)$ with arguments in an imaginary quadratic field…

The recurrence for the $k$-Fibonacci polynomials is usually iterated upwards to positive values of $n$ only. When the recurrence is iterated downwards to $n<0$, there are indices where the polynomials vanish identically. This fact does not…