maths.freeCombinatorics & Graph Theory › 9. Recurrence Equations › Solving advancement operator equations

Solving advancement operator equations

In this section, we will explore some ways of solving advancement operator equations. Some we will make up just for the sake of solving, while others will be drawn from the examples we developed in .

Solving advancement operator equations

In this section, we will explore some ways of solving advancement operator equations. Some we will make up just for the sake of solving, while others will be drawn from the examples we developed in . Again, readers familiar with differential equations will notice many similarities between the techniques used here and those used to solve linear differential equations with constant coefficients, but we will not give any further examples to make those parallels explicit.

Homogeneous equations

Homogeneous equations, it will turn out, can be solved using very explicit methodology that will work any time we can find the roots of a polynomial. Let's start with another fairly straightforward example.

Example

Find all solutions to the advancement operator equation \[\begin{aligned}\end{aligned}\]

Solution

Before focusing on finding all solutions as we've been asked to do, let's just try to find some solution. We start by noticing that here \(p(A) = A^2+A-6 = (A+3)(A-2)\). With \(p(A)\) factored like this, we realize that we've already solved part of this problem in ! In that example, the polynomial of \(A\) we encountered was (while not explicitly stated as such there) \(A-2\). The solutions to \((A-2)f_1=0\) are of the form \(f_1(n) = c_12^n\). What happens if we try such a function here? We have \[\begin{aligned}\end{aligned}\] so that \(f_1\) is a solution to our given advancement operator equation. Of course, it can't be all of them. However, it's not hard to see now that \((A+3)f_2 = 0\) has as a solution \(f_2(n) = c_2(-3)^n\) by the same reasoning that we used in . Since \((A+3)(A-2) = (A-2)(A+3)\), we see right away that \(f_2\) is also a solution of .

Now we've got two infinite families of solutions to . Do they give us all the solutions? It turns out that by combining them, they do in fact give all of the solutions. Consider what happens if we take \(f(n) = c_1 2^n + c_2 (-3)^n\) and apply \(p(A)\) to it. We have \[\begin{aligned}(A+3)(A-2)f(n) \amp = (A+3)(c_1 2^{n+1} + c_2 (-3)^{n+1} - 2(c_12^n + c_2(-3)^n)) \\ \amp = (A+3)(-5c_2(-3)^{n}) \\ \amp = -5c_2(-3)^{n+1}-15c_2(-3)^n \\ \amp = 15c_2(-3)^n - 15c_2(-3)^n \\ \amp =0.\end{aligned}\]

It's not all that hard to see that since \(f\) gives a two-parameter family of solutions to , it gives us all the solutions, as we will show in detail in .

What happened in this example is far from a fluke. If you have an advancement operator equation of the form \(p(A)f=0\) (the constant term of \(p\) nonzero) and \(p\) has degree \(k\), then the general solution of \(p(A)f=0\) will be a \(k\)-parameter family (in the previous example, our parameters are the constants \(c_1\) and \(c_2\)) whose terms come from solutions to simpler equations arising from the factors of \(p\). We'll return to this thought in a little bit, but first let's look at another example.

Condensed — the full section is in Keller & Trotter, Applied Combinatorics.

Nonhomogeneous equations

As we mentioned earlier, nonhomogeneous equations are a bit trickier than solving homogeneous equations, and sometimes our first attempt at a solution will not be successful but will suggest a better function to try. Before we're done, we'll revisit the problem of lines in the plane that we've considered a couple of times, but let's start with a more illustrative example.

You hopefully noticed that in the previous example, we said that the first guess to try for a particular solution looks a lot like right hand side of the equation, rather than exactly like. Our next example will show why we can't always take something that matches exactly.

Example

Find the solution to the advancement operator equation \[\begin{aligned}\end{aligned}\] if \(f(0) = 1\) and \(f(1) = 5\).

Solution

The corresponding homogeneous equation here is the same as in the previous example, so its general solution is again \(f_1(n) = c_1(-2)^n + c_2 6^n\). Thus, the real work here is finding a particular solution \(f_0\) to the given advancement operator equation. Let's just try what our work on the previous example would suggest here, namely \(f_0(n) = d6^n\). Applying the advancement operator polynomial \((A+2)(A-6)\) to \(f_0\) then gives, uh, well, zero, since \((A-6)(d6^n) = d6^{n+1}-6d6^n =0\). Huh, that didn't work out so well. However, we can take a cue from how we tackled homogeneous advancement operator equations with repeated roots and introduce a factor of \(n\). Let's try \(f_0(n) = dn6^n\). Now we have \[\begin{aligned}(A+2)(A-6)(dn6^n) \amp = (A+2)(d(n+1)6^{n+1}-6dn6^n) \\ \amp = (A+2)d6^{n+1} \\ \amp = d6^{n+2} + 2d 6^{n+1} \\ \amp = 6^n(36d+12d) = 48d6^n.\end{aligned}\] We want this to be equal to \(6^n\), so we have \(d = 1/48\). Therefore, the general solution is \[\begin{aligned}\end{aligned}\]

All that remains is to use our initial conditions to find the constants \(c_1\) and \(c_2\). We have that they satisfy the following pair of equations: \[\begin{aligned}1 \amp = c_1 + c_2 \\ 5 \amp = \frac{1}{8} -2c_1+6c_2\end{aligned}\] Solving these, we arrive at the desired solution, which is \[\begin{aligned}\end{aligned}\]

What's the lesson we should take away from this example? When making a guess at a particular solution of a nonhomogeneous advancement operator equation, it does us no good to use any terms that are also solutions of the corresponding homogeneous equation, as they will be annihilated by the advancement operator polynomial. Let's see how this comes into play when finally resolving one of our longstanding examples.

Condensed — the full section is in Keller & Trotter, Applied Combinatorics.

Practice (3)

Try each one on paper first. Reveal the answer to check; verified ones can be opened in the solver for every step.

  1. Solve the advancement operator equation \((A+4)f(n) = 0\) with the initial condition \(f(0)=2\). In the box below, type your answer in the form \(f(n) = \text{blah}\) and briefly explain in couple of sentences how you arrived at this solution.

  2. Let \(c_1\) and \(c_2\) be constants and define \(f(n) = c_1 3^n + c_2 (-4)^n\). Compute \[\begin{aligned}\end{aligned}\] in two steps: First, compute \((A-3)f(n)\) and in the box below tell me what you get for this first step after simplifying. (Please do not put all your work in the box!) Second, take your answer from the first step and apply \((A+4)\) to it. In the box below, tell me what you get for this second step after simplifying.

  3. Provide a brief summary of your answers to the three assigned questions on the Nonhomogeneous Advancement Operator Equations activity. Don't include the algebra, but do provide:

    1. What is the issue in the first question?

    2. How did you adjust \(f_1\) in the second question and what did you get for a particular solution (or where did you get stuck, if you didn't get one)?

    3. What did you get as your general solution?

Symbols used here

n!
factorial
n × (n−1) × … × 1; the number of orderings of n things. 0! = 1.
\binom{n}{k}
binomial coefficient, "n choose k"
Number of k-element subsets of n things: n!/(k!(n−k)!).
\sum_{k=1}^{n} a_k
summation
Add a_k for k = 1 up to n.
\prod_{k=1}^{n} a_k
product
Multiply a_k for k = 1 up to n.
\emptyset,\ |A|
empty set, cardinality
The set with no elements; the number of elements of A.

Questions people ask

Permutation or combination?

Ask whether order matters. A lock code is a permutation (order matters); a hand of cards is a combination (it does not).

What is a graph in this sense?

Dots (vertices) joined by lines (edges) — not a plot. Road maps, social networks and molecules are graphs; questions like "is there a route" and "how few colours" are graph theory.

Prueba tu propio

Parts of this page are adapted from Keller & Trotter, Applied Combinatorics (CC BY-SA 4.0). Condensed and re-explained here; errors are ours.

Más en Combinatorics & Graph Theory