We prove solution uniqueness for the genus one Canham variational problem arising in the
shape prediction of biomembranes. The proof builds on a result of Yu and Chen that …

It is a longstanding open problem whether there is an algorithm to decide the Skolem
Problem for linear recurrence sequences, namely whether a given such sequence has a …

The higher-dimensional version of Kannan and Lipton's Orbit Problem asks whether it is
decidable if a target vector space can be reached from a starting point under repeated …

Given an integer linear recurrence sequence $\langle X_n\rangle_n $, the Skolem Problem
asks to determine whether there is a natural number $ n $ such that $ X_n= 0$. Recent work …

Many sequences that arise in combinatorics and the analysis of algorithms turn out to be
holonomic (note that some authors prefer the terminology D-finite). In this paper, we study …

In the past few decades, numerous tools for automatically discovering and proving identities
involving sequences and special functions were developed. These tools are often based on …

Kurzfassung Die steigende Zahl von Computerprogrammen in unserem Alltag hat zu immer
umfangreicheren Softwaresystemen geführt. Die klassische Herangehensweise, um die …

We prove solution uniqueness for the genus one Canham variational problem arising in the
shape prediction of biomembranes. The proof builds on a result of Yu and Chen that …

The objective of this thesis is to shed some light on the boundaries of decidability by
answering some of the central problems in the study of linear programs, and to provide an …

Since there is a great conformity between the Operations in Species, and the same
Operations in common Numbers... I cannot but wonder that no body has thought of …