Related papers: General Recurrence Multidimensional Zeckendorf Rep…

Labeled infinite trees provide combinatorial interpretations for many integer sequences generated by nested recurrence relations. Typically, such sequences are monotone increasing. Several of these sequences also have straightforward…

The purpose of the paper is to introduce two new algorithms. The first one computes a linear recursion for proper hypergeometric multisums, by treating one summation variable at a time, and provides rational certificates along the way. A…

In this paper we use the Recursion Theorem to show the existence of various infinite sequences and sets. Our main result is that there is an increasing sequence e_0, e_1, e_2 .. such that W_{e_n}={e_{n+1}} for every n. Similarly, we prove…

In accordance with P. Vogel, a set of algebra structures in Chern-Simons theory can be made universal, independent of a particular family of simple Lie algebras. In particular, this means that various quantities in the adjoint…

We examine the convergence properties of sequences of nonnegative real numbers that satisfy a particular class of recursive inequalities, from the perspective of proof theory and computability theory. We first establish a number of results…

Results concerning recurrence and ergodicity are proved in an abstract Hilbert space setting based on the proof of Khintchine's recurrence theorem for sets, and on the Hilbert space characterization of ergodicity. These results are carried…

Given k>1, let a_n be the sequence defined by the recurrence a_n=c_1a_{n-1}+c_2a_{n-2}+...+c_ka_{n-k} for n>=k, with initial values a_0=a_1=...=a_{k-2}=0 and a_{k-1}= 1. We show under a couple of assumptions concerning the constants c_i…

We study the confluence property of abstract rewriting systems internal to cubical categories. We introduce cubical contractions, a higher-dimensional generalisation of reductions to normal forms, and employ them to construct cubical…

We study the combinatorial and algebraic properties of Nonnegative Matrices. Our results are divided into three different categories. 1. We show a quantitative generalization of the 100 year-old Perron-Frobenius theorem, a fundamental…

We discuss algebraic universality in the sense of P. Vogel for the simplest refined quantity, the Macdonald dimensions. The main known source of universal quantities is given by Chern-Simons theory. Refinement of Chern-Simons theory means…

It is well known that every positive integer can be expressed as a sum of nonconsecutive Fibonacci numbers provided the Fibonacci numbers satisfy $F_n =F_{n-1}+F_{n-2}$ for $n\geq 3$, $F_1 =1$ and $F_2 =2$. In this paper, for any…

We study the joint distribution of descents and inverse descents over the set of permutations of n letters. Gessel conjectured that the two-variable generating function of this distribution can be expanded in a given basis with nonnegative…

In arXiv:1603.03910 [math.NT] we introduced some $C_{n}$ in $Z/2[t]$ defined by a linear recurrence and showed that each $C_{n}$, $n\equiv 0 \bmod{4}$, is a sum of $C_{k}$, $k<n$. Combining this with results from arXiv:1508.07523 [math.NT]…

We consider a family of nonlinear rational recurrences of odd order which was introduced by Heideman and Hogan. All of these recurrences have the Laurent property, implying that for a particular choice of initial data (all initial values…

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…

Expanding General Relativity in the inverse speed of light, 1/c, leads to a nonrelativistic gravitational theory that extends the Post-Newtonian expansion by the inclusion of additional strong gravitational potentials. This theory has a…

Let (F_n^{(k)})_{n\geq -(k-2)} be the k-generalized Fibonacci sequence, defined as the linear recurrence sequence whose first k terms are \(0, 0, \ldots, 0, 1\), and whose subsequent terms are determined by the sum of the preceding k terms.…

We discuss implications of the following statement about the representation theory of symmetric groups: every integer appears infinitely often as an irreducible character evaluation, and every nonnegative integer appears infinitely often as…

We give an overview of the recursive characterisations of random matrix ensembles that are currently at the forefront of random matrix theory by way of studying two classes of ensembles using two different types of recursive schemes:…

We consider a group SO(2n+1) over a p-adic field, and tempered irreducible representations of this group, of unipotent reduction. We use the construction due to Lusztig of these representations. In an old paper with Moeglin, we have defined…