Search arXivSearch

arXiv · 2607.04700

Determining Particular Solutions for Exponential-Polynomial Forcing Terms in Linear Nonhomogeneous Recurrence Relations

Abstract

This paper develops a systematic method for determining particular solutions of the $k$th-order linear nonhomogeneous recurrence relation $$a_n + c_1 a_{n-1} + \cdots + c_k a_{n-k} = \sum_{j=1}^J p_j(n){r_j}^n$$ with $n \geq k$, $c_k \neq 0$, $r_j \neq 0$. Here each $p_j(n)$ is a polynomial. The main result is the following: for the characteristic polynomial $c(t)=t^k+c_1t^{k-1}+\cdots+c_k$, if $s_j$ denotes the multiplicity of $r_j$ as a root of $c(t)$ ($s_j=0$ when $r_j$ is not a root), then there exists a particular solution of the form $q_n=\sum_{j=1}^J b_j(n)n^{s_j}r_j^n$, where each $b_j(n)$ is a polynomial of the same degree as $p_j(n)$. This result parallels the method of undetermined coefficients for linear ODEs with constant coefficients and yields a systematic procedure for determining the form of particular solutions.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Heesung Shin. 2026-07-06. Determining Particular Solutions for Exponential-Polynomial Forcing Terms in Linear Nonhomogeneous Recurrence Relations. https://doi.org/10.23390/ckrims.2026.2.1.29

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Quorum colorings of maximum cardinality in linear time for a subclass of perfect trees

A partition $π=\{V_{1},V_{2},...,V_{k}\}$ of the vertex set $V$ of a graph $G$ into $k$ color classes $V_{i}$, with $1\leq i\leq k$ is called a quorum coloring of $G$ if for every vertex $v\in V$, at least half of the vertices in the closed neighborhood $N[v]$ of $v$ have the same color as $v$. The maximum cardinality of a quorum coloring of $G$ is called the quorum coloring number of $G$ and is denoted by $ψ_{q}(G)$. A quorum coloring of order $ψ_{q}(G)$ is a $ψ_{q}$-coloring. The determination of the quorum coloring number or design a linear-time algorithm computing it in a perfect $N$-ary tree has been posed recently as an open problem by Sahbi. In this paper, we answer this problem by designing a linear-time algorithm for finding both a $ψ_{q}$-coloring and the quorum coloring number for every perfect tree whose the vertices at the same depth have the same degree.

math.CO

Universal behaviour of majority bootstrap percolation on high-dimensional geometric graphs

Majority bootstrap percolation is a monotone cellular automaton that can be thought of as a model of infection spreading in networks. Starting with an initially infected set, new vertices become infected once at least half of their neighbours are infected. The average case behaviour of this process was studied on the $n$-dimensional hypercube by Balogh, Bollobás and Morris, who showed that there is a phase transition as the typical density of the initially infected set increases: For small enough densities the spread of infection is typically local, whereas for large enough densities typically the whole graph eventually becomes infected. Perhaps surprisingly, they showed that the critical window in which this phase transition occurs does not contain $p=1/2$, and they gave bounds on its width on a finer scale. In this paper we consider the majority bootstrap percolation process on a class of high-dimensional geometric graphs which includes many of the graph families on which percolation processes are typically considered, such as grids, tori and Hamming graphs, as well as other well-studied families of graphs such as (bipartite) Kneser graphs, including the odd graph and the middle layer graph. We show similar quantitative behaviour in terms of the location and width of the critical window for the majority bootstrap percolation process on this class of graphs.

math.CO

Analytic expressions pertaining to certain arithmetical functions

We demonstrate the general outlines of a method for obtaining analytic expressions for certain types of general arithmetical sums. In particular, analytical expressions for a general arithmetical sum whose terms are summed over either the positive integer solutions $(a,b)$ of the Diophantine equation $kb^2+da^2 = N$ or the positive integer solutions $(a,b)$ of the Diophantine equation $kb^2-da^2 = N$ are derived.

math.CO