Let be a partition. BG-rank() is defined as an alternating sum of parities of parts of [1]. In [2], Berkovich and Garvan found theta series representations for the t-core generat...
The numbers game is a one-player game played on a finite simple graph with certain "amplitudes" assigned to its edges and with an initial assignment of real numbers to i...
The technique of Finite Markov Chain Imbedding (FMCI) is a classical approach to complex combinatorial problems related to sequences. In order to get efficient algorithms, it is k...
Reactive programs have to react continuously to their inputs. Here the time needed to react with the according output is important. While the synchrony hypothesis takes the view t...
Marian Boldt, Claus Traulsen, Reinhard von Hanxled...
In this study, we introduce a model transformation tool for a time-triggered language: Giotto. The tool uses graphs to represent the source code (Giotto) and the target (the sched...