HIGHLIGHTS
- who: Maximilian Jaroschek from the QAware Gmbh, Aschauer Strau00dfe, Mu00fcnchen, Germany Institute for Algebra, Johannes Kepler University Linz, Altenbergerstrasse, Linz , have published the paper: Lonely Points in Simplices, in the Journal: (JOURNAL)
- what: It would be good to know when the authors can stop: starting from the recurrence of_(an )u221e n=0, can the authors determine a finite bound on the degree of the polynomials q that may lead to lower order recurrences? The authors develop algorithms for deciding whether in a given setting the number of lonely points is finite or infinite, as . . .

If you want to have access to all the content you need to log in!
Thanks :)
If you don't have an account, you can create one here.