Abstract
We construct an algorithm that tests a system of recurrence equations on a tree for the existence of a nontrivial solution and computes it.
| Original language | English |
|---|---|
| Pages (from-to) | 603-609 |
| Number of pages | 7 |
| Journal | Mathematical Notes |
| Volume | 78 |
| Issue number | 5-6 |
| DOIs | |
| State | Published - Nov 2005 |
| Externally published | Yes |
Keywords
- Algorithmic solvability
- Grobner basis
- Monomial algebra
- Recurrence equation
- Tree
- Ufnarovskii graph
- Zero divisor