English
Related papers

Related papers: Squaring the terms of an $\ell^{th}$ order linear …

200 papers

It is classical that univariate algebraic functions satisfy linear differential equations with polynomial coefficients. Linear recurrences follow for the coefficients of their power series expansions. We show that the linear differential…

Symbolic Computation · Computer Science 2008-04-03 Alin Bostan , Frédéric Chyzak , Bruno Salvy , Grégoire Lecerf , Éric Schost

We write a generating function for all spherical functions on the product of several copies of SU(2).

Representation Theory · Mathematics 2012-11-27 Yury A. Neretin

We derive and prove a new formulation of the Lerch zeta function as a fractional derivative of an elementary function. We demonstrate how this formulation interacts very naturally with basic known properties of Lerch zeta, and use the…

Complex Variables · Mathematics 2021-05-03 Arran Fernandez

A new approach to deal with the scattering amplitudes in Glauber theory is proposed. It relies on the use of generating function, that has been explicitly found. The method is applied to the analytical calculation of the nucleus-nucleus…

High Energy Physics - Phenomenology · Physics 2022-06-07 Yu. M. Shabelski , A. G. Shuvaev

We prove recursive formulas for sums of squares and sums of triangular numbers in terms of sums of divisors functions and we give a variety of consequences of these formulas. Intermediate applications include statements about positivity of…

Number Theory · Mathematics 2011-06-23 Mohamed El Bachraoui

A simple recurrence relation for the even order moments of the Fabius function is proven. Also, a very similar formula for the odd order moments in terms of the even order moments is proved. The matrices corresponding to these formulas (and…

Classical Analysis and ODEs · Mathematics 2017-03-07 Søren G. Have

We present some Euler-type recurrences for the partition function $p(n)$.

Combinatorics · Mathematics 2018-11-26 Yuriy Choliy , Louis W. Kolitsch , Andrew V. Sills

We give an exact formula for the number of distinct square patterns of a given size that occur in the Squiral tiling.

Combinatorics · Mathematics 2024-09-17 Johan Nilsson

We use the generating function of the characters of $C_2$ to obtain a generating function for the multiplicities of the weights entering in the irreducible representations of that simple Lie algebra. From this generating function we derive…

Mathematical Physics · Physics 2016-03-27 José Fernández Nuñez , Wifredo García Fuertes , Askold M. Perelomov

We study generalized sums of linear orders. These are binary operations that, given linear orders $A$ and $B$, return an order $A \oplus B$ that can be decomposed as an isomorphic copy of $A$ interleaved with a copy of $B$. We show that…

Logic · Mathematics 2025-12-17 Álvaro Díaz Ramos , Garrett Ervin , Saharon Shelah

In the present article, we review a continual effort on generalization of the Trotter formula to higher-order exponential product formulas. The exponential product formula is a good and useful approximant, particularly because it conserves…

Mathematical Physics · Physics 2011-11-10 Naomichi Hatano , Masuo Suzuki

We use analytic combinatorics to give a direct proof of the closed formula for the generating function of $p$-Bernoulli numbers.

Combinatorics · Mathematics 2018-07-05 Markus Kuba

For a fixed integer N, and fixed numbers b_1,...,b_N, we consider sequences, the nth term (a_n) of which is the sum of the squares of the terms in the expansion of (b_1 + ... + b_N)^n. In the case all b_i=1, we give a formula for a…

Combinatorics · Mathematics 2007-05-23 H. A. Verrill

Non-linear recurrences which generate integers in a surprising way have been studied by many people. Typically people study recurrences that are linear in the highest order term. In this paper I consider what happens when the recurrence is…

Combinatorics · Mathematics 2009-09-03 Emilie Hogan

New iterative methods for solving linear equations are presented that are easy to use, generalize good existing methods, and appear to be faster. The new algorithms mix two kinds of linear recurrence formulas. Older methods have either high…

Numerical Analysis · Mathematics 2012-03-13 Joseph F. Grcar

The aim of this paper is to establish various factorization results and then to derive estimates for linear functionals through the use of a generalized Taylor theorem. Additionally, several error bounds are established including…

Classical Analysis and ODEs · Mathematics 2024-12-10 Ali Hasan Ali , Zsolt Páles

We develop a toolbox for the error analysis of linear recurrences with constant or polynomial coefficients, based on generating series, Cauchy's method of majorants, and simple results from analytic combinatorics. We illustrate the power of…

Numerical Analysis · Mathematics 2023-03-02 Marc Mezzarobba

In the paper, by establishing a new and explicit formula for computing the $n$-th derivative of the reciprocal of the logarithmic function, the author presents new and explicit formulas for calculating Bernoulli numbers of the second kind…

Combinatorics · Mathematics 2014-05-06 Feng Qi

In this paper, we propose a factorization of a fourth-order harmonic tensor into second-order tensors. We obtain moreover explicit equivariant reconstruction formulas, using second-order covariants, for transverse isotropic and orthotropic…

Mathematical Physics · Physics 2019-01-01 Marc Olive , Boris Kolev , Boris Desmorat , Rodrigue Desmorat

In this work we develop an algebraic theory of linear recurrence equations and systems with constant coefficients and reflection. We obtain explicit solutions and the Green's functions associated to different problems under general linear…

Classical Analysis and ODEs · Mathematics 2019-09-10 F. Adrián F. Tojo