Related papers: The generalization of Schr\"oder's theorem (1871):…
We prove a stronger version of Jarden's Theorem for recurrence of powers of recursive functions
In this work, the authors provide closed forms and recurrence expressions for computing the $k$th power of the formal power series, some of them in terms of a determinant of some matrices. As a consequence, we obtain the reciprocal of the…
We observe that the classical Faulhaber's theorem on sums of odd powers also holds for an arbitrary arithmetic progression, namely, the odd power sums of any arithmetic progression $a+b, a+2b, ..., a+nb$ is a polynomial in $na+n(n+1)b/2$.…
In this paper we prove a basic theorem which says that if f : F_p^n -> [0,1] has the property that ||f^||_(1/3) is not too ``large''(actually, it also holds for quasinorms 1/2-\delta in place of 1/3), and E(f) = p^{-n} sum_m f(m) is not too…
Let $K$ be a field of characteristic zero and suppose that $f:\mathbb{N}\to K$ satisfies a recurrence of the form $$f(n)\ =\ \sum_{i=1}^d P_i(n) f(n-i),$$ for $n$ sufficiently large, where $P_1(z),...,P_d(z)$ are polynomials in $K[z]$.…
Formal power series come up in several areas such as formal language theory , algebraic and enumerative combinatorics, semigroup theory, number theory etc. This paper focuses on the set x R[[x]] consisting of formal power series with zero…
This is a lecture on the theory of formal power series developed entirely without any analytic machinery. Combining ideas from various authors we are able to prove Newton's binomial theorem, Jacobi's triple product, the Rogers--Ramanujan…
A famous theorem of Nakaoka asserts that the cohomology of the symmetric group stabilizes. The first author generalized this theorem to non-trivial coefficient systems, in the form of $\mathrm{FI}$-modules over a field, though one now…
We generalize the Umbral Calculus of G-C. Rota by studying not only sequences of polynomials and inverse power series, or even the logarithms studied in, but instead we study sequences of formal expressions involving the iterated logarithms…
When $A$ is a matrix with all eigenvalues in the disk $|z-1|<1$, the principal $p$th root of $A$ can be computed by Schr\"oder's method, among many other methods. In this paper we present a further study of Schr\"oder's method for the…
For $k$ a positive integer let $S_k(n) = 1^k + 2^k + \cdots + n^k$, i.e., $S_k(n)$ is the sum of the first $k$-th powers. Faulhaber conjectured (later proved by Jacobi) that for $k$ odd, $S_k(n)$ could be written as a polynomial of…
Recently, Ivan Mihajlin and Alexander Smal proved a composition theorem of a universal relation and some function via so called xor composition, that is there exists some function $f:\{0,1\}^n \rightarrow \{0,1\}$ such that…
The generalized composition graph is used by Cardoso and some researchers for factorization of the adjacency spectrum and Laplacian of a simple graph. Because the generalized composition graph is an example of a set-theoretic linear operad,…
A system of multivariate formal power series $\varphi$ with a homogeneous decomposition $\varphi=\sum_{k=0}^\infty\varphi_k$ is invertible under composition if $\varphi_0=0$ and $\mathrm{det}(\varphi_1)\ne 0.$ All invertible series over a…
We define an enumerative function F(n,k,P,m) which is a generalization of binomial coefficients. Special cases of this function are also power function, factorials, rising factorials and falling factorials. The first section of the paper is…
It is shown that the exponential of a complex power series up to order n can be implemented via (23/12+o(1))M(n) binary arithmetic operations over complex field, where M(n) stands for the (smoothed) complexity of multiplication of…
If a function $f:\mathbb{R}\to\mathbb{R}$ can be represented as the sum of $n$ periodic functions as $f=f_1+\dots+f_n$ with $f(x+\alpha_j)=f(x)$ ($j=1,\dots,n$), then it also satisfies a corresponding $n$-order difference equation…
The concept of a fully interlacing matrix of formal power series with real coefficients is introduced. This concept extends and strengthens that of an interlacing sequence of real-rooted polynomials with nonnegative coefficients, in the…
Let $(r_{A,n}(x))_{n \in \mathbb{N}}$ be a sequence of polynomials with coefficients from a field $K$ satisfying the recurrence relation $r_{A,n}(x)= \sum_{|\alpha|\leq m} t_{\alpha,n}(x)\textbf{r}_{A,n}^\alpha(x)$ of order $d+1 \in…
Let $f\_1,\ldots, f\_s$ be formal power series (respectively polynomials) in thevariable $x$. We study the semigroup of orders of the formal series inthe algebra $K[[ f1,\ldots, f\_s]] \subseteq K[[ x ]]$ (respectively the semigroup of…