Related papers: A recursion identity for formal iterated logarithm…
We present a unified theory for formal mathematical systems including recursive systems closely related to formal grammars, including the predicate calculus as well as a formal induction principle. We introduce recursive systems generating…
We derive several identities that feature irreducible characters of the general linear, the symplectic, the orthogonal, and the special orthogonal groups. All the identities feature characters that are indexed by shapes that are "nearly"…
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:…
I revisit an automated proof of Andrews' pentagonal number theorem found by Riese. I uncover a simple polynomial identity hidden behind his proof. I explain how to use this identity to prove Andrews' result along with a variety of new…
We explore a physical model of ordered sums of integers as trains of rods. The trains for a fixed, possibly infinite, set of rod lengths naturally correspond to nodes in a tree; relations among finite linear recursions encoded in the…
Consider $k\ge 2$ distinct, linearly independent, homogeneous linear recurrences of order $k$ satisfying the same recurrence relation. We prove that the recurrences are related to a decomposable form of degree $k$, and there is a very broad…
Given word on $n$ letters, we study groups which satisfiy "iterated identity" $w$, meaning that for all $x_1, \dots, x_n$ there exists $m$ such that $m$-the iteration of $w$ of Engel type, applied to $x_1, \dots, x_n$, is equal to the…
We introduce new refinements of the Bell, factorial, and unsigned Stirling numbers of the first and second kind that unite the derangement, involution, associated factorial, associated Bell, incomplete Stirling, restricted factorial,…
The theory of Touchard polynomials is generalized using a method based on the definition of exponential operators, which extend the notion of the shift operator. The proposed technique, along with the use of the relevant operational…
We present a new formula for umbral operators that yields three main insights. First, it makes explicit a connection between umbral calculus and iteration theory. Second, it leads naturally to a definition of fractional exponents of umbral…
In the paper, the author establishes some identities which show that the functions $\frac1{(1-e^{\pm t})^k}$ and the derivatives $\bigl(\frac1{e^{\pm t}-1}\bigr)^{(i)}$ can be expressed each other by linear combinations with coefficients…
Motivated by the resemblance of a multivariate series identity and a finite analogue of Euler's pentagonal number theorem, we study multiple extensions of the latter formula. In a different direction we derive a common extension of this…
Recently, the numbers $Y_{n}(\lambda )$ and the polynomials $Y_{n}(x,\lambda)$ have been introduced by the second author [22]. The purpose of this paper is to construct higher-order of these numbers and polynomials with their generating…
Using combinatorial techniques, we derive a recurrence identity that expresses an exponential power sum with negative powers in terms of another exponential power sum with positive powers. Consequently, we derive a formula for the power sum…
This is the first of two papers in which we study the modular invariance of pseudotraces of logarithmic intertwining operators. We construct and study genus-one correlation functions for logarithmic intertwining operators among generalized…
In a reversible language, any forward computation can be undone by a finite sequence of backward steps. Reversible computing has been studied in the context of different programming languages and formalisms, where it has been used for…
There is increasing interest within the research community in the design and use of recursive probability models. Although there still remains concern about computational complexity costs and the fact that computing exact solutions can be…
Using the methods of the theory of formal symmetries, we obtain new easily verifiable sufficient conditions for a recursion operator to produce a hierarchy of local generalized symmetries. An important advantage of our approach is that…
Set partitions and permutations with restrictions on the size of the blocks and cycles are important combinatorial sequences. Counting these objects lead to the sequences generalizing the classical Stirling and Bell numbers. The main focus…
In this paper we present a family of identities for recursive sequences arising from a second order recurrence relation, that gives instances of Zeckendorf representation. We prove these results using a special case of an universal property…