English
Related papers

Related papers: An Enumerative Function

200 papers

In this paper we use a formula for the $n$-th power of a $2\times2$ matrix $A$ (in terms of the entries in $A$) to derive various combinatorial identities. Three examples of our results follow. 1) We show that if $m$ and $n$ are positive…

Combinatorics · Mathematics 2019-01-03 James Mc Laughlin , Nancy J. Wyshinski

A finite sum of exponential functions may be expressed by a linear combination of powers of the independent variable and by successive integrals of the sum. This is proved for the general case and the connection between the parameters in…

Data Analysis, Statistics and Probability · Physics 2007-05-23 Bernhard Kaufmann

Let $(F_n)_{n\ge 1}$ be the Fibonacci sequence. Define $P(F_n): = (\sum_{i=1}^n F_i)_{n\ge 1}$; that is, the function $P$ gives the sequence of partial sums of $(F_n)$. In this paper, we first give an identity involving $P^k(F_n)$, which is…

Combinatorics · Mathematics 2021-06-08 Hung Viet Chu

We prove a classification of additive polynomial superfunctors, which allows us to compute some extensions of a superfunctor of the form $F \circ A$ where $F$ is a classical polynomial functor and $A$ is additive. We get a formula which…

Algebraic Topology · Mathematics 2022-02-01 Iacopo Giordano

We show that for a random polynomial \[ F(X) = \sum_{n=1}^{N} f(n) X^{n-1}, \] where $f(n)$ is a random completely multiplicative function taking values in $\{\pm 1\}$, one has \[ \limsup_{N \to \infty} \mathbb{P}\big[F(X) \text{ is…

Number Theory · Mathematics 2025-11-19 Oleksiy Klurman , Vlad Matei

The notion of block divisibility naturally leads one to introduce unitary cyclotomic polynomials $\Phi_n^*(x)$. They can be written as certain products of cyclotomic poynomials. We study the case where $n$ has two or three distinct prime…

Number Theory · Mathematics 2019-11-06 G. Jones , P. I. Kester , L. Martirosyan , P. Moree , L. Tóth , B. B. White , B. Zhang

A higher order difference equation may be generally defined in an arbitrary nonempty set S as: \[ f_{n}(x_{n},x_{n-1},...,x_{n-k})=g_{n}(x_{n},x_{n-1},...,x_{n-k}) \] where $f_{n},g_{n} :S^{k+1}\rightarrow S$ are given functions for…

Exactly Solvable and Integrable Systems · Physics 2010-12-27 Hassan Sedaghat

We consider a joint ordered multifactorisation for a given positive integer $n\geq 2$ into $m$ parts, where $n=n_1~\times~\ldots~\times~n_m$, and each part $n_j$ is split into one or more component factors. Our central result gives an…

Number Theory · Mathematics 2025-08-20 Ambrose D. Law , Matthew C. Lettington , Karl Michael Schmidt

In this article, we prove some factorization results for several classes of polynomials having integer coefficients, which in particular yield several classes of irreducible polynomials. Such classes of polynomials are devised by imposing…

Number Theory · Mathematics 2024-01-17 Jitender Singh , Rishu Garg

It is shown that if a function defined on the segment [-1,1] has sufficiently good approximation by partial sums of the Legendre polynomial expansion, then, given the function's Fourier coefficients $c_n$ for some subset of $n\in[n_1,n_2]$,…

Number Theory · Mathematics 2010-08-31 Sergei N. Preobrazhenskii

Let $K$ be a field of characteristic 0, $f:\mathbb{N}\to K$ be a multiplicative function, and $F(z)=\sum_{n\geq 1} f(n)z^n\in K[[z]]$ be algebraic over $K(z)$. Then either there is a natural number $k$ and a periodic multiplicative function…

Number Theory · Mathematics 2010-03-15 Jason P. Bell , Michael Coons

For a polynomial map $\mathbf{f} : k^n \to k^m$ ($k$ a field), we investigate those polynomials $g \in k[t_1,\ldots, t_n]$ that can be written as a composition $g = h \circ \mathbf{f}$, where $h: k^m \to k$ is an arbitrary function. In the…

Commutative Algebra · Mathematics 2019-09-04 Erhard Aichinger

Define {\em the Liouville function for $A$}, a subset of the primes $P$, by $\lambda_{A}(n) =(-1)^{\Omega_A(n)}$ where $\Omega_A(n)$ is the number of prime factors of $n$ coming from $A$ counting multiplicity. For the traditional Liouville…

Number Theory · Mathematics 2008-09-11 Peter Borwein , Stephen K. K. Choi , Michael Coons

In this paper we study the Frobenius characters of the invariant subspaces of the tensor powers of a representation V. The main result is a formula for these characters for a polynomial functor of V involving the characters for V. The main…

Representation Theory · Mathematics 2014-08-06 Bruce W. Westbury

For every partial combinatory algebra (pca) $A$ and every partial endofunction on $A$, a pca $A[f]$ is constructed such that in $A[f]$, the function $f$ is representable by an element; a universal property of the construction is formulated…

Logic · Mathematics 2007-05-23 Jaap van Oosten

The multi-point Taylor polynomial, which is the general, unique and of minimum degree ($mk+m-1$) polynomial $P_{k,m}(x)$ which interpolates a function's derivatives in multiple points is presented in its explicit form. A proof that this…

Classical Analysis and ODEs · Mathematics 2021-06-23 Andrés Gómez Arias

The main goal in this manuscript is to present a class of functions satisfying a certain orthogonality property for which there also exists a three term recurrence formula. This class of functions, which can be considered as an extension to…

Numerical Analysis · Mathematics 2016-06-28 Cleonice F. Bracciali , John H. McCabe , Teresa E. Pérez , A. Sri Ranga

In a recent article a generalization of the binomial distribution associated with a sequence of positive numbers was examined. The analysis of the nonnegativeness of the formal expressions was a key-point to allow to give them a statistical…

Mathematical Physics · Physics 2015-06-04 H. Bergeron , E. M. F. Curado , J. P. Gazeau , Ligia M. C. S. Rodrigues

Convolution powers of $1/x$ are transformed into functions $f_n$, which satisfy a simple recurrence relation. Solutions are characterized and analyzed.

Combinatorics · Mathematics 2022-03-21 Andreas B. G. Blobel

For any two arithmetic functions $f,g$ let $\bullet$ be the commutative and associative arithmetic convolution $(f\bullet g)(k):=\sum_{m=0}^k \left( \begin{array}{c} k m \end{array} \right)f(m)g(k-m)$ and for any $n\in\mathbb{N},$…

Number Theory · Mathematics 2017-03-08 Jitender Singh