Related papers: Nested recursions with ceiling function solutions

Given a sequence $(M_{n},Q_{n})_{n\ge 1}$ of i.i.d. random variables with generic copy $(M,Q)$ such that $M$ is a regular $d\times d$ matrix and $Q$ takes values in $\mathbb{R}^{d}$, we consider the random difference equation (RDE)…

We introduce the notion of $\mathcal{N}=1$ abstract super loop equations, and provide two equivalent ways of solving them. The first approach is a recursive formalism that can be thought of as a supersymmetric generalization of the…

A complex rational function R, of degree n>1, on a compact Riemann surface M provided with a cyclic order of its q critical values, determines an homogeneous tessellation of the Riemann surface M, whose 2n tiles are topological q-gons with…

Expansion of higher transcendental functions in a small parameter are needed in many areas of science. For certain classes of functions this can be achieved by algebraic means. These algebraic tools are based on nested sums and can be…

Let $\mathbf a=(a_1,\ldots,a_r)$ be a vector of positive integers. In continuation of a previous paper we present other formulas for the restricted partition function $p_{\mathbf a}(n): = $ the number of integer solutions $(x_1,\dots,x_r)$…

<Q>_e is the effective list of all finite predicate logic programs. <T_e> is the list of recursive trees. We modify constructions of Marek, Nerode, and Remmel [25] to construct recursive functions f and g such that for all indices e, (i)…

Let the symmetric functions be defined for the pair of integers $\left( n,r\right) $, $n\geq r\geq 1$, by $p_{n}^{\left( r\right) }=\sum m_{\lambda }$ where $m_{\lambda }$ are the monomial symmetric functions, the sum being over the…

We derive recursions for the probability distribution of random sums by computer algebra. Unlike the well-known Panjer-type recursions, they are of finite order and thus allow for computation in linear time. This efficiency is bought by the…

Divisor functions have attracted the attention of number theorists from Dirichlet to the present day. Here we consider associated divisor functions $c_j^{(r)}(n)$ which for non-negative integers $j, r$ count the number of ways of…

Integer iteration rules such as n |-> {a n + b, c n +d} are studied as minimal examples of the general process of multicomputation. Despite the simplicity of such rules, their multiway graphs can be complex, exhibiting, for example,…

We present a constant and a recursive relation to define a sequence $f_n$ such that the floor of $f_n$ is the $n$th prime. Therefore, this constant generates the complete sequence of primes. We also show this constant is irrational and…

This paper focuses on the problem of reconstructing a vector of rational functions given some evaluations, or more generally given their remainders modulo different polynomials. The special case of rational functions sharing the same…

We consider estimation procedures which are recursive in the sense that each successive estimator is obtained from the previous one by a simple adjustment. We propose a wide class of recursive estimation procedures for the general…

We examine so-called rank function equations and their solutions consisting of non-nilpotent matrices. Secondly, we present some geometrical properties of the set of solutions to certain rank function equations in the nilpotent case.

In the present work, we explore the possibility of developing rogue waves as exact solutions of some nonlinear dispersive equations, such as the nonlinear Schr\"odinger equation, but also, in a similar vein, the Hirota, Davey-Stewartson,…

Let No be Conway's class of surreal numbers. I will make explicit the notion of a function f on No recursively defined over some family of functions. Under some "tameness" and uniformity condition, f must satisfy some interesting…

We study the convergence of stochastic fixed point iterations in the consistent case (in the sense of Butnariu and Fl{\aa}m (1995)) in several different settings, under decreasingly restrictive regularity assumptions of the fixed point…

We define discrete nested sums over integer points for symbols on the real line, which obey stuffle relations whenever they converge. They relate to Chen integrals of symbols via the Euler-MacLaurin formula. Using a suitable holomorphic…

In the present paper we study stability of recurrence equations (which in particular case contain a dynamics of rational functions) generated by contractive functions defined on an arbitrary non-Archimedean algebra. Moreover,…

In this note we study the convergence of recursively defined infinite series. We explore the role of the derivative of the defining function at the origin (if it exists), and develop a comparison test for such series which can be used even…